Presentation is loading. Please wait.

Presentation is loading. Please wait.

CELLULAR TELEPHONE NETWORK SECURITY Ari Vesanen, Department of Information Processing Sciences, University of Oulu.

Similar presentations

Presentation on theme: "CELLULAR TELEPHONE NETWORK SECURITY Ari Vesanen, Department of Information Processing Sciences, University of Oulu."— Presentation transcript:

1 CELLULAR TELEPHONE NETWORK SECURITY Ari Vesanen, Department of Information Processing Sciences, University of Oulu

2 Contents 1.Introductionto GSM 2.GSM network structure and properties 3.GSM network security model 4.GSM network security threats 5.GPRS vs. GSM Security 6.UMTS vs. GSM Security

3 Introduction to GSM GSM world’s most widely used cellular phone system –About 1000 million users –First digital cellular phone standard –1982 GSM (Groupe Special Mobile) –committee to create standard –1989 ETSI (European Telecommunications Standards Institute) responsible for development –1990 first specifications frozen

4 GSM specifications developed secretly –No public evaluation according to scientific procedure –Kerckhoff’s principle violated: Algorithm strength should depend on secrecy of key and not on the secrecy of the algorithm itself –GSM specifications and encryption algorithms have leaked and been subject to criticism

5 GSM Network Structure Mobile station MS SIMPHONE BTS BSC HLR AuC EIR VLR Base Station subsystem BSS Network Switching Subsystem NSS MSC PLMN, PSTN,... A bis UmUm A

6 Mobile Station = phone + SIM –SIM = Subscriber Identity Module –User identity IMSI (International Mobile Subscriber Identity) on SIM –MSISDN (Mobile Subscriber International Integrated Services Digital Network) –number = Phone number on SIM –Phone identity IMEI (International Mobile Equipment Identity) in phone Got from phone: type *#06#

7 BSS components: Base Transceiver Station (BTS) and Base Station Controller (BSC) –BTS controls radio communication with phone, encrypts calls and does decryption –BSC can control several BTS’s, tasks Initialization of radio channel Frequency hopping Handover (transferring user between cells) Traffic between BSS and MSC

8 NSS = MSC + SMSC + Registers (+ OSS) Mobile Services Switching Centre (MSC) –Main component of NSS –Works as link to wired network –Services for registering and authenticating mobile user –Services related to mobility Short Message Service Centre (SMSC) –Transmission of short messages –Needs routing information -> works in co- operation with HLR

9 HLR (Home Location Register) –Information on subscribers registered in this GSM network –Current location of users (location network’s VLR address) –One network can contain only one HLR VLR (Visitor Location Register) –Relevant information on all active users in GSM network AuC (Authentication Center) –User secret key information by IMSI EIR (Equipment Identity Register) –Valid equipments by their IMEI code

10 GSM Network Radio Interface Band control: combined TDMA/FDMA –FDMA divides band into 200 kHz wide channels GSM 900 – 124 channels GSM 1800 – 374 channels Channels grouped and distributed to operators –Carrier frequency into time frames according to TDMA model –TDMA frame = eight time intervals (slots) Message in one slot = burst –Logical channel = one slot in one frame

11 Frequency hopping –216,7 hops/second –After each burst frequency changed according to predefined pattern –Spreads disturbances –Makes eavesdropping more difficult TDMA/FDMA model technically challenging

12 Establishing Call Updating location –Uses MSC, HLR and VLR –When MS moves to new location area or to new operator area -> must register for update –Location update message to new MSC/VLR –pair that registers new information and sends it to subscribers HLR. HLR sends the previous VLR information that subscriber left its area

13 Phone’s home MSC Phone’s location MSC Incoming call HLR VLR BTS BSC MS Call Routing

14 GSM Network Security Model Identification of subscriber – IMSI –IMSI consists of three components: 1.Mobile Country Code (MCC) 2.Mobile Network Code (MNC) 3.Mobile Subscriber Identity Number (MSIN) –TMSI temporary identifier, used instead of IMSI in communication Changed when location changed Makes IMSI capturing and subscriber communication monitoring more difficult

15 Authentication –Actors: SIM card and (home network’s) Authentication Center (AuC) –Authenticates user to network (not vice versa) –Based on secret 128 –bit key Ki (resides only on SIM and in AuC) –Authentication always in home network! Authentication algorithm may be changed, yet works in visited networks Authentication method challenge-response –Algorithm A3

16 MSC HLR AuC MS 1.Register to network 6. Check SRES 4. RAND 5. SRES 2. Request authentication triplet 3. Authentication triplet (RAND,SRES,Kc) Authentication in GSM Network SRES = A3(RAND,Ki) Kc = Air interface encryption key

17 Air interface encryption –Encryption algorithm A5 must reside in phone, for all network operators common algorithm –Key generated using algorithm A8 – on SIM, hence may be operator specific –Uses (64 –bit) session key Kc = A8(RAND, Ki) and (22 –bit) TDMA frame number –A5 stream cipher, re-synchronized for each frame –Kc rarely updated (in connection with authentication) –Only air interface encrypted in GSM network, no encryption in operator network Relied on physical security

18 MS (A)BTS (B) Air Interface Encryption in GSM Network A5A5 A5A5 Kc (64 bit) Frame no (22 bit) Kc (64 bit) CIPHER A->B XOR PLAIN A->B CIPHER B->A PLAIN B->AXOR PLAIN B->A PLAIN A->B Frame no (22 bit) 114 bit

19 Algorithms SAGE –group under ETSI designed algorithms –Composition secret A3, Device authentication algorithm –Takes as parameters 128 –bit key Ki and random number RAND, computes 32 –bit fingerprint, SRES. – Almost without exception: COMP128 –algorithm used both as A3 and A8 –COMP128 proposed in GSM specification

20 A8 air interface encryption key generation algorithm –Mostly COMP128 –Takes as parameters 128 –bit key Ki and random number RAND, computes 64 –bit session key Kc –Kc used until MSC decides to re-authenticate device Both A3 and A8 on SIM card –Operator can decide algorithms –Authentication done in subscriber’s home network -> local network does not have to know algorithms, yet authentication works also when user roams

21 COMP128 not public, found out using SIM cards and leaked specifications – (Marc Briceno, Ian Goldberg and David Wagner) implementation –Published in April 1998 –Produces both SRES and Kc in one run Upper 32 bits SRES Lowest 54 bits + 10 zeros Kc -> effectively Kc is 54 –bit!

22 A5 – Air Interface Encryption Algorithm Stream cipher algorithm ”Original” European algorithm A5 leaked in general already in 1994, details in May 1999 (Briceno from GSM phone) Initialized each sent frame –Key Kc used during call, but 22-bit frame number changed

23 European A5 –Three feedback shift registers (LFSR = Linear Feedback Shift Register) of different lengths –Register lengths 19, 22 and 23 bits –Register values XORed and obtained bit XORed with plaintext bit –Registers initialized using session key Kc and frame number –After initialization 228 bits pseudo random bit stream formed: 114 first bits to encrypt frame from device to base station, rest 114 bits from base station to device –Cf.

24 | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | XOR R1 (19) R2 (22) R3 (23) A5 - cipher 1813C1 C C37 Rotation: Majority of C1,C2 and C

25 Algorithm in many forms, original A5/1 –Stronger than other A5/x ’s –A5/0 = No encryption –A5/2 decidedly weakened form (used e.g. in USA) Published and analyzed in August 1999 (very weak) – Other A5/x ’s not become public (if any)

26 GSM Network Security Defects Network not authenticated –Faking base station principally possible Algorithm weaknesses –Both A5 and COMP128 defective Data integrity not checked –Makes alteration of data possible

27 Authentication data transmitted in clear both inside and between networks –Contains also air interface encryption key Lack of visibility –User can not know whether encryption used or not –No confirmation to home network, whether serving network uses correctly authentication parameters when user roams

28 Threats Attacks against A5 –A5 –implementation (Mike Roe): m/gsm_security.html –Breaking air interface encryption -> call eavesdropping –Many methods proposed for breaking A5: –Almost practical attack by Golic: ” Cryptanalysis of Alleged A5 Stream Cipher” cf. -hack.html Birthday attack type time/memory - optimization

29 –Attack applicable in real time: –Biryukov, Shamir and Wagner (cf. Real time break algorithm on PC against the strong algorithm A5/1 –Basic assumption: Attacker knows or guesses part of bit stream produced by cipher –Basic idea: Great number of pre-computed states stored (possible, since feedback registers can only be in 2 64 different states) Idea by Golic

30 –Key can be deduced from initial state of each frame –A5/1 can be effectively implemented on PC (each register small enough to store their states in computer’s memory as three cyclic arrays) –A5/1 can be run backwards effectively –However, backward computation not entirely deterministic: one state can be arrived at from several states

31 –Suitable 16-bit number alpha in advance chosen and only frames that include alpha considered –The number of register states producing alpha is about 2 48 –States computed in advance and stored on disk -> attack demands large amount of space –Three different attacks (all require at least two 73GB hard drives)

32 –Estimate: First type attack (”biased birthday attack” –two versions), needs about 2 minutes of call data Alpha appears sufficiently many times (ca. 71) in data –Direct collision with disk data and cipher data Encryption broken in one second –Third type attack (”random subgraph attack”): call data 2 seconds Performing attack takes minutes –No crypto attack carried out in practice (presumably)

33 SIM card cloning (by physical contact) –Subscriber’s secret key on SIM and security depends on this key -> if attacker obtains SIM security can be broken –An identical copy of SIM can be made If card noticed missing, it can quickly be shut out of services If copy and original simultaneously used, network notices and invalidates both In principal cloned card can be used such that subscriber is billed

34 –Revealing key Ki from SIM Based on weakness of COMP128 Inventors: SDA (Smartcard Developer Association) and ISAAC (Internet Security, Applications, Authentication and Cryptography) –Cf. faq.html Flaw in algorithm -> information on Ki obtained by giving suitable random number inputs RAND as an argument to A8 –Input RAND slightly changed and observed when identical answer obtained – inputs enough to deduce Ki

35 Test attack: SIM in card reader attached to PC; PC generated challenges, using which SIM computed SRES –response and session key Kc -> based on information Ki computed. Took ca. 8 hours –April 1998 Used attack technique standard -like –Cf. e.g. Serge Vaudenay ”FFT-Hash-II is not yet Collision-Free”

36 SIM cloning over-the-air –ISAAC: According to experts possible in practice (faking base station) Cf. gsm.html –Type 1: Attacker builds fake base station, covering subscriber’s valid BTS -> Subscriber’s SIM may be bombed with self-generated authentication requests

37 Estimate: Attack duration 8 – 13 hours, victim device has to be in operating area of fake base station (not necessarily continuously) Subscriber can not detect attack –Enhanced version of COMP128 exists (COMP128-2) Some operators use Not (known to be) broken –Type 2: Attack from legal network Client outside home network (e.g. abroad) Attacker inside location network

38 Building fake (rogue) base station –Cost estimate euros –Can capture IMSI –Gathered information might be used in networks with more loose authentication – Counter: Temporary identifier TMSI, changed when subscriber location updated TMSI not entirely prevents IMSI capture since IMSI has to be sent once –Also other attacks (e.g. mentioned SIM – cloning)

39 Cell change in GSM network 1.Phone sends audibility reports to BTS 2.BTS adds own information and sends to BSC 3.BSC cell change request to MSC (if necessary) 4.MSC resource allocation request to new BSC, that waits for MS to arrive 5.New BSC send acknowledgement to MSC that sends cell change command to old BSC, this forwards it to MS 6.MS breaks connection to old base station and continues with new one

40 How to hook up a phone to my fake base station? Item 5: Cell change command from the network -> Attacker may simulate command and force the phone to change –No authentication for base stations -> Device can not know communicating with a rogue base station

41 GPRS vs. GSM Security GPRS transition phase to 3G, supports packet switched traffic –Voice (circuit switched traffic) as in GSM –GPRS data uses multiple slots Air interface encryption (differences with GSM) –New A5 –algorithm GEA Yet secret –GPRS traffic encryption extends further (base stations cannot cope with traffic using several slots)

42 Authentication (differences with GSM) –Separate authentication for circuit switched and packet switched traffic Packet switched backbone has own security features –Not considered here

43 UMTS design applies open standardization Specs: 3GPP ( 3rd Generation Partnership Project) –WWW –site contains specifications etc. –Cf. TTAE.3G ”3G Security; Security Architecture” –UMTS network constructed on (and parallel to) existing GSM networks -> Security model constructed on GSM security model UMTS vs. GSM Security

44 Authentication method as in GSM –Based on a secret key K, residing only on USIM and in home network AuC Comparison: in GSM network authentication vectors triplets (RAND, SRES,Kc) in UMTS network quintets (RAND, XRES, CK, IK, AUTN) –IK integrity key for data integrity –AUTN authentication token for network authentication

45 Improvements to GSM security –Encryption algorithms use longer keys –Network also authenticated –Signaling data authenticated and integrity checked UMTS GSM –compatible –GSM users have GSM context –GSM users have practically GSM security in UMTS network

Download ppt "CELLULAR TELEPHONE NETWORK SECURITY Ari Vesanen, Department of Information Processing Sciences, University of Oulu."

Similar presentations

Ads by Google