Title of Invention

METHOD AND APPARATUS FOR AUTHENTICATION IN WIRELESS COMMUNICATION

Abstract

Systems and methods of securing wireless communications between network and a subscriber station include inserting a market denoting an encryption type within a random value used for authentication, calculating a first session key and a first response value as a function of the random value, then calculating a second session key and a second response value as a function of the random value, first session key and first response value. The two levels of sessions keys and response values may be used by upgraded subscriber stations and network access points to prevent attackets from intercepting authentication triplets.

Full Text

FORM 2 THE PATENTS ACT, 1970 (39 of 1970) & The Patents Rules, 2003 COMPLETE SPECIFICATION (See section 10, rule 13) "METHOD AND APPARATUS FOR AUTHENTICATION IN WIRELESS COMMUNICATION" QUALCOMM INCORPORATED of 5775 Morehouse Drive, San Diego, California 92121-1714, USA. The following specification particularly describes the invention and the manner in which it is to be performed. 2 WO 2005/048638 PCT/US2004/036538 METHOD AND APPARATUS FOR AUTHENTICATION IN WIRELESS COMMUNICATIONS Claim of Priority under 35 U.S.C. §119 [0001] The present Application for Patent claims priority to Provisional Application No. 60/518,041 entitled "Authentication and Key Separation for Securing GSM Systems" filed November 7, 2003, and assigned to the assignee hereof and hereby expressly incorporated by reference herein. BACKGROUND Field [0002] The present disclosure relates generally to wireless telecommunications and, more specifically, to a method of securing wireless telecommunications systems. Background [0003] One cellular technology for wireless communications is defined by the Global System for Mobile (GSM) protocol. GSM has been further extended by new services, such as General Packet Radio Service (GPRS), which offers Internet content and packet-based data services for GSM networks. GSM is used for many types of wireless communications including voice, Internet browsing, e-mail and multimedia data. GSM incorporates various security mechanisms to protect the content communicated over such systems. Service providers and users alike rely on these security mechanisms for the privacy of their communications and protection of their data. The security mechanisms typically operate by authenticating users to the network, then user encrypting data before transmission over the air. Such security measures are subject to attack by third parties. There is a need therefore, for a method and apparatus for secure wireless communications. WO 2005/IMW.3.S ^ PC"(V'(."S24/0J65JS BRIEF DESCRIPTION OF THE DRAWINGS [0004] FIG. 1 illustrates a portion of a typical GSM network system which may be compromised by an attacker; [0005] FIG. 2 illustrates components of a subscriber station which may be involved during authentication; [0006] FIG. 3 is a flow diagram illustrating operation of an authentication center; [0007] FIG. 4 is a flow diagram illustrating operation of an illustrative network access point; [0008] FIG. 5A is a flow diagram illustrating operation of a first illustrative subscriber station; [0009J FIG. 5B is a flow diagram illustrating operation of a second illustrative subscriber station; and [0010] FIG 6 is a flow diagram illustrating operation of a subscriber station and a network access center. [0011] FIG 7 illustrates a subscriber station. DETAILED DESCRIPTION [0012] Encryption is a process of modifying data for protection against access by a non- authorized third party. This technique generally employs ciphering of data transmitted over an air interface, e.g., between subscriber stations and base stations, as well as over other wireless or wireline links, to a desired remote party. Ciphering refers in general to encoding data in such a way that only the recipient with the proper "key" can decode it. Ciphering may be achieved, for example, by performing an exclusive-OR operation between a pseudo-random bit sequence and the bits of a normal burst of communications data. Only when a recipient has the proper key may the operation be "undone" and the burst of communications data extracted. [0013] One type of encryption used in wireless communications systems is performed using a stream cipher. The encryption algorithm for stream cipher takes a secret key known only to the user's device (such as a cellular phone or specifically, a Subscriber Identity Module (SIM) card inside of a device) and a frame number, and generates a pseudo-random stream of bits (i.e., keystream) to be XORed with the input for encryption. The information is also used decrypt received data. Thus, the bits are effectively encrypted independently of one another. WO 2005/048638 PC'T/US20O4/06538 -3~ [0013] Two algorithms commonly used to generate the pseudo-random sequence for use as described above are the A5/1 and A5/2 algorithms. Original GSM protocols support three levels of security for airlink encryption: unencrypted; A5/2; and A5/1 encrypted. The A5 algorithm is used for encryption optionally on voice or data connections. A5 is a stream cipher, using a 64-bit cipher key, but is block based with a block length of 228 bits. A5 is designed to be efficiently implemented in hardware, involving only XOR and one-bit addition operations. A5 has two versions: A5/1 used in Europe; and A5/2 used in export systems. Both A5/1 and A5/2 are stream-cipher algorithms used for encryption, but each provides slightly different security and incurs different complexity. As will be recognized by those skilled in the art, A5 is part of the GSM specification. A5/1 is known as the "strong" export-limited version, and A5/2 is the standard and "weak" version having no export limitations. Another version of A5 encryption sometimes used is A5/3, which is based on the block-cipher Universal Mobile Telecommunications System (UMTS)/ Wideband Code Division-Multiple Access (WCDMA) algorithm known as "KASUMI." Kasumi is a 64-bit block cipher using a true 128-bit key. [0014] Each of these algorithms uses, as the secret key, a 64-bit session key (Kc) derived by an authentication mechanism, such as according to a standard GSM-supported authentication mechanism. GSM security is based on a challenge-response mechanism using a secret 128-bit key (K,) stored on the SIM card and on the user's home network Authentication Center (AuC). During initialization of an active session, the AuC generates a 128-bit randomly chosen value (RAND) and applies an authentication algorithm such as A3 or A8, also part of the GSM specification, to the RAND. The algorithm generates both an expected response (SRES) and an encryption key for the session (the Kc), each of which are functions of the RAND and the Kj. The RAND, SRES and Kc collectively constitute a GSM Authentication Vector (authentication triplet). [0015] During registration, the authentication triplet is issued to the base station, which forwards the RAND to the subscriber station. The SIM card in the subscriber station reads the RAND and computes the SRES and session key Kc according to the same authentication algorithm or key agreement algorithms (A3 or A8, respectively), using its secret key Kj. The calculated SRES value is sent to the base station, which can compare it to the SRES in the authentication triplet, thereby authenticating the subscriber WO 2OO5/04.S6JSN 5 PCT/t:.S20(M/il.J653X station's validity. Once the subscriber station is authenticated, the K^ may be used for encryption of communications during the active session, as directed by the base station. [0016J Unfortunately, the A5 algorithms are susceptible to third party attacks, causing both the data and the network to be compromised. Generally speaking, encryption of data communicated on wireless systems is performed after coding for error correction. It is well-known that coding introduces known linear relationships between the bits to be encrypted. Thus, although an attacker might not know the actual values of individual input bits, they may know certain groups will XOR to zero, in accordance with the known linear relationships of coding. Such known relationships may allow attackers to break into secured communications without specific knowledge of the content of data being encrypted. [0017] Such attacks are known as "ciphertext only" attacks, and have been demonstrated as effective against the various A5 encryption algorithms. One example of such an attack is a "Man In The Middle" attack (MITM) as disclosed by Biham et al. Basically, the MITM attack against GSM involves a false base station able to interject itself into the authentication process and intercept both the RAND and the SRES. The false base station forces the subscriber station to use the weaker A5/2 algorithm for encryption after authentication. Only a small amount of A5/2 encrypted communication is required in order for the false base station to break out the Kc from the A5/2 traffic. At that point, the false base station may act as a translator between the A5/2 encryption on the leg between the subscriber station and the false base station, and whichever encryption is requested by the real base station on the leg between the false base station and the real base station. More importantly, the false base station is able to recover the entire authentication triplet, which may then be re-used, such as for hijacking phone calls or establishing false service. Further, although stronger A5 algorithms, such as A5/3, have been developed, since Kc works with any of these algorithms, even the stronger ones are undermined by the security flaws in weaker algorithms allowing the Kc to be intercepted in the first place. [0018] Although proposals have been made for protecting against this type of attack, there is currently no effective solution that would not require significant changes to standard GSM protocols or equipment. Also, changes to SBVIs and deployed subscriber stations may be impossible or impracticable to implement. Changes to the network infrastructure would also be cumbersome, costly, and difficult to synchronize. Thus, WO 2005/.04863S 6 PCT/US2004/036538 currently proposed solutions to the threat of these attacks may be too costly or impracticable to actually implement. [0019] With reference now to FIG. 1 of the drawings, there is illustrated a portion of a typical GSM network system which may be compromised by an attacker. A user may communicate over the network by using a subscriber station 100, which may be or include a cellular phone, and a Subscriber Identity Module (SIM) card 104. Of course, it is to be understood that the teachings herein apply to various communications devices and are not limited to cellular phones. The SIM card 104 is a small piece of circuitry which may be placed within a cellular phone. The SIM card 104 may store personal information about a user, such as his phone number, secret key (explained in further detail below), phone book entries, and other details. Some of this information may be used so the user may be identified and authenticated to the network supplying the phone service. The SIM card 104 may also include processing capability, and encryption capability for voice and data transmissions before transmission from the subscriber station to the network. The SIM card 104 may optionally be moved from one device to another and/or different SIM cards 104 may be inserted into any GSM cellular phone. For example, if a user has one phone but uses it for both personal and business calls, he can change the SIM card depending on how he will be using the phone (one card . contains his personal identity and data and the second card carries his business identity and data). [0020] When a user powers up the subscriber station 100, it attempts to locate one or more Network Access Points (NAP) 106 to be used for communications. A NAP may include, for example, a base station or other hardware suitable for connecting to a GSM network. To do this, the subscriber station 100 monitors pilot signals sent from different NAPs. The subscriber station may choose the strongest pilot signals, which would identify one NAP as being suitable for establishing a link to the network. In the following description of the GSM network system, the subscriber station 100 establishes a link with one NAP 106. {0021] After the subscriber station 100 is connected to the network via a link 108 established with the NAP 106, the network must determine the location of the subscriber station 100. A database such as a Visited Location Register (VLR) 112 may store an entry for every subscriber station in its local area, along with subscriber station's last known location. Subscriber stations may periodically inform their Home Location Register (HLR) 110 of their current location, allowing HLR 110 to update WO 2005/048638 7 PCT/US2004/036538 stored information accordingly and route incoming calls to the subscriber station. When a subscriber station is not roaming (i.e. when it is in the area served by its home operator), the functions of the HLR 110 and the VLR 112 may be combined. When used, the VLR 112 may be helpful for communicating between a subscriber station roaming in a foreign network and the subscriber stations own HLR 110 which is in the home network. It is to be understood that the concepts herein may be applied to wireless systems with and without VLRs. [0022] After the network identifies the current location of the subscriber station 100, it may attempt to authenticate the user. Authentication is one part of GSM security measures. A user's secret key (Kj) is central to security in the GSM system, and one is used during authentication. Each user is assigned a random number as a secret key, referred to as Kj, stored in their SIM card 104 and in a database called the Authentication Center (AuC) 114. The secret key is carefully guarded as discovery by a third party would break down the system. The K, is never sent from the AuC 114, so it cannot be overheard in transmission. The Kj also never leaves the SIM card 104. During authentication, the NAP 106 first asks the AuC 114 for a random number and an associated response. The AuC 114 includes a processor 116 which may generate the random number (RAND) and perform a security algorithm in which the RAND and the user's Kj are used as inputs. The security algorithm may be in accordance with the A3/A8 authentication protocol, for example, though other protocols may be used as well. The outputs of this algorithm are the response (SRES) and a special encryption key, known as the session key (Kc). The SRES may be used to authenticate the user, and the Kg may be used by both the subscriber station and the network to encrypt and decrypt communications data after authentication occurs. [0023] After the AuC generates and calculates the RAND, SRES and Kc, it bundles the three values together in what is called an authentication triplet (triplet), and provides the triplet to the NAP 106. The NAP 106 then extracts the RAND from the triplet, and sends just the RAND to the subscriber station 100. The subscriber station 100 knows which authentication algorithms were used by the AuC to generate SRES and Kc. Thus, by using the same authentication algorithms, the subscriber station 100 may take the RAND received from the NAP and calculate the same SRES and Kc. As described above, these values are functions of Kj, the secret key stored on the SIM card 104 and available for use by the subscriber station 100. WO2005/048638 8 PCT/US2004/036538 [0024] FIG. 2 illustrates additional components of the subscriber station 100 which may be involved during the authentication process. An analog front end may include a transceiver 200 having both a receiver 202 and a transmitter 204. The subscriber station 100 may also include a processing system 206 including a processor 208 resident on the user's cellular phone and the SIM card 104 which, as explained above, has its own processor. [0025] Returning now to FIG. 1, once the subscriber station 100 (or its SIM card 104) calculates SRES and Kc, it can hold on to Kc and send the SRES back to the NAP 106. If the NAP 106 is able to authenticate the subscriber station 100, then communications may proceed and each entity can use the Kc to encrypt and decrypt communications data according to the encryption algorithm selected by the NAP and specified to the subscriber station 100. In order to authenticate the subscriber station 100, the NAP 106 first verifies the received the correct SRES is from the subscriber station 100. To do so, the NAP 106 may, via a processor 118, compare the SRES received from the subscriber station 100 and the SRES received from the AuC 114. If they do not match, then authentication fails. If they do match, however, then the subscriber is authenticated and communications may proceed. [0026] As explained above, the MTTM attack is conducted during the authentication procedure. When the NAP 106 sends a RAND to the subscriber station 100 for authentication, the RAND is intercepted by an attacker 120. The attacker 120 forwards the RAND to the legitimate user's subscriber station 100. The subscriber station 100, believing this authentication request legitimately comes from the NAP 106, computes the SRES as part of the normal authentication routine described above, and returns the SRES to the NAP 106. The SRES is again intercepted by the attacker 120, which forwards it on to the network. At this point, the attacker 120 appears "authenticated" to the NAP 106, and also has possession of both the RAND and the SRES, which it intercepted. The only part of a full authentication triplet the attacker 120 lacks is the K^. However, the attacker 120 can use the weak encryption algorithm A5/2 to obtain this value. [0027] For example, under normal conditions, when the NAP 106 verifies authentication, the NAP 106 sends a request for the subscriber station 100 to proceed with communications using A5/1 or A5/3 encryption (cipherstart message). During an attack, however, the attacker 120 can intercept the cipherstart message and, instead of forwarding it to the subscriber station 100, it changes the cipherstart message and WO 2005/048638 9 PCT/US2004/036538 instead tells the subscriber station 100 to use A5/2, the weak encryption algorithm. The A5/2 request appears to the subscriber station 100 to be a legitimate cipherstart message, so the subscriber station will begin encrypting its communications data with the A5/2 algorithm. The attacker 120, which is still intercepting communications between the NAP 106 and the subscriber station 100, may then employ cryptanalysis of A5/2 to retrieve the Kc. Once it knows Kc., the attacker 120 may act as a translator and communicate with the subscriber station 100 via A5/2 and communicate with the NAP 106 via whichever algorithm the NAP 106 specified in its cipherstart message, since the same Kc works with any of the A5 algorithms. More importantly, at this point the attacker 120 has every piece of a valid authentication triplet, which it may then re-use for future sessions, such as to hijack phone calls or steal phone service by posing as an authenticated user. [0028] In order to prevent the theft of Kc during authentication or active communications, the authentication process may include an additional step involving K, which, as explained above, cannot be intercepted by any third party. FIG. 3 is a flow diagram illustrating a procedure performed by an AuC to inject the additional K, step into a normal authentication routine. The procedure may be implemented with both legacy systems in which subscriber stations and network components (such as the NAP, VLR, a HLR) are old and upgraded systems in which network components are upgraded to recognize and respond to the new procedure. The procedure also works with systems including some legacy components and some upgraded components. First, at block 300, the AuC may generate a random value which may be modified to serve as a RAND in the authentication process. To modify the random value appropriately, the AuC may first select the encryption type for communication with the subscriber station at block 302. The selected encryption type may involve any encryption algorithm not easily compromised by a third party attacker. For example, the AuC may decide against selecting A5/2, which is known to be a weak encryption algorithm. The AuC may instead select A5/1 or A5/3, though other robust algorithms may be used as well. [0029] After the AuC selects an encryption type, it modifies the random value at block 304, which results in a RAND value, RAND], to be used for authentication. RAND i may have a special format in that a certain number of its bits are set to a special value. This value may be recognized by both the subscriber station and the network access point, and may indicate which encryption type was selected at block 302. The value of these bits may thus form a "mandated encryption marker." The format of RAND1, WO 2005/048638 10 PCT/US2004/036538 including the mandated encryption marker, may be in accordance with the teachings of an article entitled "Further Development of the Special RAND mechanism," Vodafone and Orange, 3GPP SA3 document S3-030588. However, those skilled in the art will recognize other RAND formats may be implemented as well, so long as some bits of RAND1 are reserved to include special (not random) values that both describe the selected authentication type and are recognizable by upgraded hardware at the NAP and the subscriber station. [0030] Once RAND1 is known, the AuC may at block 306 proceed in accordance with the traditional authentication procedure, in which it uses a security algorithm to calculate a Kc and an SRES corresponding to the RAND1. The security algorithm may, for example, be in accordance with the A3/A8 authentication protocol. The resulting Kc and SRES are denoted as Kci and SRES1 since they correspond to RAND]. At block 308, the AuC bundles these three values together to form a triplet Tj. Instead of passing this triplet to the NAP for authentication, however, the illustrative procedure performs additional security procedures involving Kj, to provide an extra layer of protection. [0031] At block 310, the AuC performs a one-way function known as a pseudorandom function, in which the output can be reproduced given the same inputs, but if any of the input values is not known, the output cannot be reproduced because the output does not include any information about the unknown input. One type of function which may be used is a secure hash function such as SHA-1. Details regarding SHA-1 are provided in FTPS-180-1 and FIPS-180-2, NIST. Another suitable function may be a secure Message Authentication Code such as, for example, HMAC. Details regarding HMAC are provided in a document entitled "Hash based Message Authentication Code," by Krawczyk et. al, RFC2401. Of course, it is to be understood that the teachings herein may be implemented with any pseudorandom function and are not limited to SHA-1, HMAC or other types of secure hash or Message Authentication Codes. [0032] The output of the pseudorandom function performed on triplet Ti at block 310 is a seemingly random number. Although its sequence was actually carefully derived by the previous steps, its appearance is one of a randomly generated number, and it may be used as such. Thus, the output generated at block 310 may be used as a second RAND, RAND2, in a secondary authentication operation. At block 314, a security algorithm may be implemented to calculate a second Kc and a second SRES which correspond to the RAND2. The security algorithm may again be in accordance with the A3/A8 authentication protocol. The resulting Kc and SRES are denoted as Kca and SRES2 WO 20115/0438638 PCT/US2004/036538 11 since they correspond to RAND2. At block 316, the AuC bundles these three values together to form a second triplet J2. [0033] At this point, the AuC has two triplets available for authentication of a subscriber station. Depending on whether the NAP includes upgraded hardware which can engage in a security method, the AuC may pass one or both of these triplets to the NAP for use during authentication. At block 318, the network determines whether the NAP comprises legacy hardware or upgraded hardware. This determination may be made by the AuC, the VLR or the HLR, or by some combination thereof. If the NAP comprises legacy hardware, then at block 320 the AuC sends only the second triplet T2 to the NAP. In this case, authentication will proceed as usual, with the NAP and subscriber station using the values in T2 to achieve authentication, and never using any of the Ti values. If, on the other hand, the NAP comprises upgraded hardware which can support the illustrative security methodology, then at block 322 the AuC will send both triplets, T, and T2, to the NAP. [0034] FIG. 4 is a flow diagram illustrating operation of an illustrative upgraded network access point upon receipt of both triplets. At block 400, both triplets Ti and J2 are received from the AuC, either directly or through the VLR or HLR. Rather than sending the RAND from both triplets to the subscriber station, though, the NAP forwards only the first triplet's RAND, RAND1- This is done to "test" whether the subscriber station comprises legacy or upgraded hardware, and thus whether the subscriber station like the NAP is capable of engaging in the illustrative security methodology. At block 404, the subscriber station processes RAND1 and generates a response. The value of this response will depend upon whether the subscriber station comprises legacy or upgraded hardware. Thus, the description now turns to the particular details of the subscriber station processing, which are illustrated in FIGs. 5A and 5B. [0035] FIG. 5A is a flow diagram illustrating operation of an upgraded subscriber station engaged in authentication with the upgraded NAP. At block 500, the subscriber station receives the specially formatted RAND1 from the NAP. Because it is an upgraded subscriber station, it will recognize the mandated encryption marker in the RAND1, at block 502. Because the subscriber station recognized this marker, it knows the NAP is also upgraded and the subscriber station and the NAP may engage in the illustrative security methodology. First, at block 504, the subscriber station calculates the Kc1 and SRES1 according to the normal authentication procedure. In other words, WO 2005/048638 PCT/US2004/036538 12 the SIM card may retrieve the K1 and use it with RAND1 to calculate Kci and SRES;. However, instead of sending back the SRES1 and using the Kci for encryption, the subscriber station continues with the illustrative security methodology in order to implement the extra layer of security. At block 506, it combines the RAND;, SRESt, and Kci to form a first triplet Tj. Then at block 508, the subscriber station performs a pseudorandom function, as explained above, to Ti. The output of this function at block 510 is RAND2, the same value previously calculated in the AuC. The subscriber station then uses the K, stored in the SIM card to calculate Kc2 and SRES2 at block 512. Finally, at block 514, the SRES2 is sent back to the NAP. (0036] If the subscriber station is not upgraded, it cannot engage in the illustrative security methodology described above. Yet, even a legacy subscriber station will be able to authenticate itself to the NAP using the specially formatted RAND!. FIG. 5B is a flow diagram illustrating operation of a legacy subscriber station engaged in authentication with the upgraded NAP. At block 516, the subscriber station receives the specially formatted RAND1 from the NAP. However, because the subscriber station is not upgraded, it cannot recognize the mandated encryption marker within the RAND1. As such, the subscriber station believes the RAND1 is merely a random number, and uses it as a normal RAND. That is, the subscriber station directs its SIM card to utilize the K, and calculate Kci and SRES1, which is shown at block 518. At block 520, the subscriber station returns SRES1 to the NAP for authentication. [00371 Returning now to FIG. 4, at block 406 the NAP receives an SRES from the subscriber station. As explained above with reference to FIGs. 5A and 5B, this SRES value may be either SRES1 or SRES2, depending on whether the subscriber station was upgraded or legacy. Thus, at block 408 the NAP first determines whether the received value matches the SRES1 it has from the Ti. If so, then the NAP knows the subscriber station was unable to recognize the special format of RAND1 and implement the additional security mechanism. Thus, at block 410 the NAP detects the subscriber station comprises legacy hardware and is unable to engage in the illustrative security methodology. As such, the NAP must operate according to the traditional authentication procedure, and send a cipherstart message requesting the subscriber station begin using a particular encryption type, as indicated at block 412. The subscriber station also operates according to the traditional authentication procedure and, as shown at block 414, uses the Kci previously calculated (in FIG. 5B) to encrypt its communications data. WO 2005/048638 PCT/US2004/036538 14 [0038] If, on the other hand, the NAP determines at block 408 the returned SRES does not match the SRES1 it has from the Ti, then the NAP knows the subscriber station might include upgraded hardware capable of the illustrative security methodology. First, however, the NAP must verify the subscriber station sent back the proper response value to indicate this. Thus, at block 416 the NAP tests whether the SRES matches the SRES2 it has from the T2. If not, then at block 418 authentication fails. However, if a match is detected then at block 420 the NAP detects the subscriber station is an upgraded one. As such, the NAP knows at block 422 that no encryption type request need be sent in the cipherstart message, and that at block 424 the subscriber station will use the second session key Kc2 previously calculated (in FIG. 5A) to encrypt its communications data. An encryption type request might still be sent in order to avoid changing existing protocols, but this would not affect the choice of encryption algorithm. Moreover, if an attacker attempts to send a false request to the subscriber station indicating an encryption type other than that specified in the mandated encryption marker recognized at block 502, the subscriber station will recognize it is a false request and ignore it, such as by encrypting communications data in accordance with the encryption type specified in the marker, or by declining to send communications data at all. [0039] FIG. 6 is a flow diagram illustrating operation of a subscriber station and a network access point when each has verified the other is upgraded. As explained above, each one may use the Kc2 for encryption and decryption because it has been derived with a second layer of security using the well-guarded Kj. However, according to another feature the subscriber station and NAP may instead calculate yet another encryption key, based on the Kc2, to encrypt and decrypt communications. Doing so interjects yet another layer of security. At blocks 600 and 602, the subscriber station and NAP, respectively, detect the other is upgraded. Thus, each is aware the illustrative security methodology may be employed. Upon using this methodology and calculating the secure Kc2, however, the subscriber station may at block 604 create a new key as a function of Kc2 and some value "X." The NAP may calculate the same new key, at block 606. This new key may be the output of the particular function, as indicated at blocks 608 and 610. For example, where X is a cipher value, Kencrypted may be a cipher-specific key. Where X is an authentication value, Kencrypted may be an authentication key. These keys, though based on the same Kc2, may be respectively used for ciphering data and for authentication. WO 20O5/04638 14 PCT/US2004/036538 [0040] FIG. 7 illustrates a subscriber station according to one embodiment. As illustrated, the subscriber station includes receive circuitry 700 coupled to key and response calculation unit 704. The receive circuitry 700 receives authentication information, such as the RAND value, and provides this information to the key and calculation unit 704. The key and calculation unit 704 also receives the secret key for the subscriber station, Kj, from memory storage unit 702. From these inputs, the key and calculation unit 704 generates a first response SRES1 and a first key KCi, which provide feed back to key and calculation unit 704. The key and calculation unit 704 then generates a second response SRES2 and a second key Kc2- The second response SRES2 is provided to the transmit circuitry 708 for transmission to complete authentication, while the second key Kc2 is provided to encode/decode unit 710 for processing and receiving data. A processor 706 is also provided for coordination and control of the key and calculation unit 704, the encode/decode unit 710, and the memory storage unit 702. FIG. 7 provides a functional description of the operation of a subscriber station, wherein alternate embodiments may combine functional units or further specify individual functional blocks to implement the security mechanisms discussed herein. [0041] While the specification describes particular embodiments of the present invention, those of ordinary skill can devise variations of the present invention without departing from the inventive concept For example, the teachings herein refer to circuit-switched network elements but are equally applicable to packet-switched domain network elements. Also, the teachings herein are not limited to authentication triplet pairs but can also be applied to use of a single triplet including two SRES values (one of the customary format and one of the newer format disclosed herein). [0042] Those skilled in the art will understand that information and signals may be represented using any of a variety of different technologies and techniques. For example, data, instructions, commands, information, signals, bits, symbols, and chips that may be referenced throughout the above description may be represented by voltages, currents, electromagnetic waves, magnetic fields or particles, optical fields or particles, or any combination thereof. [0043] Those skilled in the art will further appreciate that the various illustrative logical blocks, modules, circuits, methods and algorithms described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of WO 2005/048638 15 PCT/US2004/036538 hardware and software, various illustrative components, blocks, modules, circuits, methods and algorithms have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention. [0044] The various illustrative logical blocks, modules, and circuits described in connection with the embodiments disclosed herein may be implemented or performed with a general purpose processor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A general-purpose processor may be a microprocessor, but in the alternative, the processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. [0045] The methods or algorithms described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. A storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC. [0046] The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be WO 2005/048638 16 PCT/US2004/036538 limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein. [0047] WHAT IS CLAIMED IS: WO 2005/048638 17 PCT/US2004/036538 CLAIMS 1. A method of securing wireless communications with a network at a subscriber station, comprising: receiving a random value from the network; calculating a first session key and a first response value as a function of the random value; calculating a second session key and a second response value as a function of the random value, first session key and first response value; and communicating the second response value to the network for authentication. 2. The method of claim 1, wherein the random value including an encryption marker identifying an encryption type for a communication. 3. The method of claim 2, wherein the marker comprises a plurahty of bits that specify a predetermined sequence of values. 4. The method of claim 2, wherein the encryption type is different from A5/2 encryption. 5. The method of claim 1, further comprising receiving an encryption request that is inconsistent with the encryption type and ignoring the request 6. The method of claim 5, further comprising encrypting communications data in accordance with the encryption type. 7. The method of claim 5, further comprising declining to transmit communications data in response to the encryption request being inconsistent with the encryption type. 8. The method of claim 1, further comprising: retrieving a secret key stored in the subscriber station, wherein calculation of the first session key and the first response key is also a function of the secret key. 9. The method of claim 1, further comprising: modifying the random value, WO 2005/048638 18 PCT/US2004/036538 wherein calculation of the second session key and the second response value comprises combining the modified random value, the first session key and the first response value to form an authentication triplet, and performing a hash function on the authentication triplet. 10. The method of claim 9, wherein the second session key and second response value are calculated as a function of the output of the hash function and a secret key that is stored on a SIM card in the subscriber station. 11. The method of claim 1, further comprising calculating an encrypted key as a function of the first session key and a predetermined value. 12. The method of claim 11, wherein the encrypted key comprises a cipher key. 13. The method of claim 11, wherein the encrypted key comprises an authentication key. 14. The method of claim 11, further comprising encrypting communications data with the encrypted key prior to communicating the data to the network. 15. A method of securing wireless commtmications with a subscriber station from a network, comprising: generating a random value having a marker specifying an encryption type; calculating a first session key and a first response value as a function of the random value; calculating a second session key and a second response value as a function of the random value, first session key and first response value; communicating the random value to the subscriber station; receiving a subscriber response value from the subscriber station in response to the random value; and comparing the subscriber response value to each of the first and second response values. 16. The method of claim 15, wherein the marker comprises a plurality of bits that specify a predetermined sequence of values. WO 2IM5/048638 PCT/US2004/036538 -19 17. The method of claim 15, wherein the mandated encryption type is different from A5/2 encryption. 18. Hie method of claim 15, wherein the calculation of the first session key and first response value is also a function of a secret key associated with the subscriber station. 19. The method of claim 15, wherein the calculation of the second session key and second response value comprises: combining the modified random value, the first session key and the first response value to form an authentication triplet; and performing a hash function on the authentication triplet. 20. The method of claim 19, wherein the second session key and second response value are calculated as a function of the output of the hash function and a secret key that is associated with the subscriber station. 21. The method of claim 15, wherein the subscriber response value matches the first response value, and wherein the method further comprises calculating an encrypted key as a function of the first session key and a predetermined value. 22. The method of claim 21, further comprising receiving communications data from the subscriber station and decrypting the communications data with the encrypted key. 23. The method of claim 21, wherein the encrypted key comprises a cipher key. 24. The method of claim 21, wherein the encrypted key comprises an authentication key. 25. A subscriber station, comprising: means for receiving a random value from the network; means for calculating a first session key and a first response value as a function of the random value, and further for calculating a second session key and a second response value as a function of the random value, first session key and first response value; means for communicating the second response value to the network for authentication; and WO 2005/0438638 20 PCT/US2004/036538 means for applying the second session key to encryption of data for transmission. 26. A network, comprising: means for generating a random value comprising a marker specifying an encryption type; means for calculating a first session key and a first response value as a function of the random value; means for calculating a second session key and a second response value as a function of the random value, first session key and first response value; means for communicating the random value to the subscriber station; means for receiving a subscriber response value from the subscriber station in response to the random value; and means for comparing the subscriber response value to each of the first and second response values. 27. A subscriber station, comprising: a receiver configured to receive a random value from the network; a processor system configured to calculate a first session key and a first response value as a function of the random value, and calculate a second session key and a second response value as a function of the random value, first session key and first response value; an encryption unit adapted to receive the second session key for encryption and decryption of transmission data; and a transmitter configured to send the second response value to the network for authentication. 28. The subscriber station of claim 27 wherein the processor system comprises a first processor on a communications device and a second processor on a SIM card. 29. The subscriber station of claim 28 wherein the communications device comprises a Global System Mobile cellular phone. 30. The subscriber station of claim 27 wherein the processor system is further configured to combine the random value, first session key and first response value to form an authentication triplet and perform a hash function on the authentication triplet. WO 2005/048638 PCT/US2004/036538 21 31. The subscriber station of claim 27 wherein the processor system is further configured to calculate an encrypted key as a function of the first session key and a predetermined value. 32. The subscriber station of claim 26, further comprising: memory storage unit for storing a secret key unique to the subscriber station, wherein the processor calculates the second session key and the second response value as a function of the secret key, the random value, the first session key and the first response value. 33. A Method of securing wireless communications with a network at a subscriber station substantially as herein described with reference to the accompanying drawings. 34. A subscriber station and a network substantially as herein described with reference to the accompanying drawings. Dated this 4th day of May, 2006. OMANA RAMAKRISHNAN OOF K & S PARTNERS AGENT FOR THE APPLICANTS 22 ABSTRACT METHOD AND APPARATUS FOR AUTHENTICATION IN WIRELESS COMMUNICATIONS Systems and methods of securing wireless communications between a network and a subscriber station include inserting a marker denoting an encryption type within a random value used for authentication, calculating a first session key and a first response value as a function of the random value, then calculating a second session key and a second response value as a function of the random value, first session key and first response value. The two levels of session keys and response values may be used by upgraded subscriber stations and network access points to prevent attackers from intercepting authentication triplets.

Documents:

520-MUMNP-2006-ABSTRACT(8-5-2006).pdf

520-MUMNP-2006-ABSTRACT(GRANTED)-(14-10-2008).pdf

520-mumnp-2006-abstract-(05-05-2006).doc

520-mumnp-2006-abstract-(05-05-2006).pdf

520-mumnp-2006-cancelled pages(05-05-2006).pdf

520-MUMNP-2006-CANCELLED PAGES(24-9-2008).pdf

520-mumnp-2006-claim(granted)-(05-05-2006).doc

520-mumnp-2006-claim(granted)-(05-05-2006).pdf

520-MUMNP-2006-CLAIMS(8-5-2006).pdf

520-MUMNP-2006-CLAIMS(GRANTED)-(14-10-2008).pdf

520-mumnp-2006-correspondence(24-09-2008).pdf

520-MUMNP-2006-CORRESPONDENCE(24-9-2008).pdf

520-mumnp-2006-correspondence(ipo)-(06-10-2008).pdf

520-MUMNP-2006-CORRESPONDENCE(IPO)-(19-1-2012).pdf

520-MUMNP-2006-DESCRIPTION(COMPLETE)-(8-5-2006).pdf

520-MUMNP-2006-DESCRIPTION(GRANTED)-(14-10-2008).pdf

520-MUMNP-2006-DRAWING(8-5-2006).pdf

520-MUMNP-2006-DRAWING(AMENDED)-(24-9-2008).pdf

520-MUMNP-2006-DRAWING(GRANTED)-(14-10-2008).pdf

520-mumnp-2006-drawing-(05-05-2006).pdf

520-mumnp-2006-form 1(08-05-2006).pdf

520-mumnp-2006-form 1(24-09-2008).pdf

520-MUMNP-2006-FORM 16(24-9-2010).pdf

520-MUMNP-2006-FORM 16(8-7-2009).pdf

520-mumnp-2006-form 18(30-08-2006).pdf

520-MUMNP-2006-FORM 18(30-8-2006).pdf

520-MUMNP-2006-FORM 2(COMPLETE)-(8-5-2006).pdf

520-mumnp-2006-form 2(granted)-(05-05-2006).doc

520-mumnp-2006-form 2(granted)-(05-05-2006).pdf

520-MUMNP-2006-FORM 2(GRANTED)-(14-10-2008).pdf

520-MUMNP-2006-FORM 2(TITLE PAGE)-(8-5-2006).pdf

520-MUMNP-2006-FORM 2(TITLE PAGE)-(GRANTED)-(14-10-2008).pdf

520-mumnp-2006-form 26(06-03-2006).pdf

520-MUMNP-2006-FORM 26(9-6-2005).pdf

520-mumnp-2006-form 3(04-05-2006).pdf

520-MUMNP-2006-FORM 3(8-5-2006).pdf

520-mumnp-2006-form 5(04-05-2006).pdf

520-MUMNP-2006-FORM 5(8-5-2006).pdf

520-mumnp-2006-form-pct-isa-210(05-05-2006).pdf

520-MUMNP-2006-SPECIFICATION(AMENDED)-(24-9-2008).pdf

520-MUMNP-2006-WO INTERNATIONAL PUBLICATION REPORT(8-5-2006).pdf

abstract1.jpg

pdf