1. Field
The present disclosure relates generally to wireless telecommunications, and more specifically, to security in wireless communications.
2. Background
Consumer demand for wireless services has led to the development of numerous wireless communication networks. One such network is based on Code-Division Multiple Access (CDMA) technology which supports wireless voice and data services using spread-spectrum processing. Spread-spectrum processing enables high quality service at low cost by efficiently using the available frequency spectrum. As a result, CDMA technology is considered by most to be the way of the future for digital wireless communications.
To provide the widest availability of CDMA technology, certain deployment strategies may be implemented. One such strategy is to introduce CDMA technology as a means for connecting to an existing network infrastructure, such as a Global System for Mobile Communications (GSM). GSM, which has become the de facto standard in Europe and Asia, represents the previous generation of digital wireless communications and utilizes narrowband Time-Division Multiple Access (TDMA) to support wireless voice and data services. By using CDMA as a means for connecting to a GSM network, or other existing networks, reduced cost may be realized because a substantial portion of the existing infrastructure may be used to support CDMA technology.
The introduction of a CDMA into to a GSM network raises a number of security issues. Currently, a GSM network establishes trust and session keys with a GSM subscriber station using a challenge/response procedure. The challenge/response procedure is based on authentication credentials and GSM algorithms stored on a removable Subscriber Identity Module (SIM) in the GSM subscriber station. The removable SIM may be installed on any GSM subscriber station, thereby eliminating the need to provision authentication credentials every time a consumer purchases a new GSM device. Many consumers of GSM products have expressed a certain level of satisfaction with this feature, and therefore, it is desirable to deploy a CDMA subscriber station that can accept a SIM from a GSM subscriber station. This will require that certain compatibility issues be addressed between a CDMA network employing a legacy protocol known as Cellular Authentication and Voice Encryption (CAVE) and a CDMA subscriber station with a GSM SIM.
An aspect of a subscriber station is disclosed. The subscriber station includes a processor having an authentication algorithm for a first network, the processor further being configured to use a key for a second network in the authentication algorithm to establish a session with the second network.
Another aspect of a subscriber station is disclosed. The subscriber station includes a processor having an authentication algorithm configured to receive a first key for a first network, and a SIM configured to generate a second key for a second network. The processor is further configured to use the second key in place of the first key in the authentication algorithm to establish a session with the second network.
A method of secured communications from a subscriber station is disclosed. The subscriber station has an authentication algorithm for a first network. The method includes generating a key for a second network, and using the key in the authentication algorithm to establish a session with the second network.
Computer readable media embodying a program of instructions executable by a computer to perform a method of secured communications from a subscriber station is disclosed. The subscriber station has an authentication algorithm for a first network. The method includes generating a key for a second network, and using the key in the authentication algorithm to establish a session with the second network.
It is understood that other embodiments of the present invention will become readily apparent to those skilled in the art from the following detailed description, wherein various embodiments of the invention are shown and described by way of illustration. As will be realized, the invention is capable of other and different embodiments and its several details are capable of modification in various other respects, all without departing from the spirit and scope of the present invention. Accordingly, the drawings and detailed description are to be regarded as illustrative in nature and not as restrictive.
Aspects of the present invention are illustrated by way of example, and not by way of limitation, in the accompanying drawings, wherein:
The detailed description set forth below in connection with the appended drawings is intended as a description of various embodiments of the present invention and is not intended to represent the only embodiments in which the present invention may be practiced. The detailed description includes specific details for the purpose of providing a thorough understanding of the present invention. However, it will be apparent to those skilled in the art that the present invention may be practiced without these specific details. In some instances, well known structures and components are shown in block diagram form in order to avoid obscuring the concepts of the present invention.
In the following detailed description, various encryption techniques will be described in the context of a subscriber station in communication with a GSM core network through a CDMA wireless connection. While these techniques may be well suited for this application, those skilled in the art will readily appreciate that these techniques can be extended to other communication networks co-existing within the same geographic region. Accordingly, any reference to a CDMA or GSM network is intended only to illustrate various inventive aspects of the present invention, with the understanding that these inventive aspects have a wide range of applications.
The CDMA wireless network 108 is based on a topology in which a geographic coverage region is broken up into cells. Within each of these cells is a fixed Base Transceiver Station (BTS) that provides an air interface to the subscriber stations. A Base Station Controller (BSC) may be used to manage and coordinate the BTSs in the CDMA wireless network 108. For illustrative purposes, a single cell is shown in
A GSM Home Location Register (HLR) 122 is used to maintain a record of subscribers for various service providers in the GSM core network 104. For each of these subscribers, the HLR 122 maintains certain information, such as the Electronic Serial Number (ESN), the phone number of the subscriber, the current location of the subscriber station, etc. Typically, the HLR 122 will be coupled with an Authentication Center (AC). The AC is used to authenticate subscribers to the GSM core network 104 and generate session keys for each.
In the embodiment of the communications system 100 shown in
A Visitor Location Register (VLR) 126 is coupled with the MSC 120. The VLR 126 is used to maintain a register of subscriber stations in the CDMA network 104. In the embodiment shown, the VLR 126 basically serves as a local cache of HLR subscriber information from the GSM core network 104. When the subscriber station 102 registers with the MSC 120, the MSC 120 retrieves the subscriber information from the GSM HLR 124 and places it into the VLR 126. The gateway 124 is designed to appear to the MSC 120 as a GSM VLR. This may be achieved by using specific protocols that are well known in the art.
Before describing various security features for a CDMA subscriber station in communication with a GSM core network, the authentication and encryption protocols unique to CDMA and GSM networks will first be described.
When the subscriber station 102 initially registers with the CDMA network, the authentication process begins with the generation of a secondary key called the “Shared Secret Data” key (SSD-A) at the CDMA AC 202 and the subscriber station 102. At the CDMA AC 202, a RAND generator 204 is used to generate a random number (RAND) which, along with the A-key, are input to a CAVE algorithm 206 to generate the SSD-A. The RAND is also sent to the subscriber station 102 so that the SSD-A can be generated there. At the subscriber station 102, the RAND and the A-key are input to a similar CAVE algorithm 208 to generate the SSD-A.
The SSD-A is generally referred to as a “shared secret key” because it is shared between the subscriber station 102 and the MSC 120. Every time a session is initiated, a challenge/response authentication procedure can be used between the subscriber station 102 and the MSC 120 using the SSD-A, without the assistance of the CDMA AC 202. This tends to reduce signaling traffic over the CDMA network. A new SSD-A may be generated at the CDMA AC 202 by sending a RAND to the subscriber station 102, but this generally occurs only after a security breach has been detected or after some predetermined time has expired.
The challenge/response authentication procedure is initiated by the MSC 120 by sending to the subscriber station 102 a random challenge (Broadcast RAND) from a Broadcast RAND generator 210. The subscriber station 102 uses the Broadcast RAND, along with the SSD-A, the ESN, and the telephone number dialed, as inputs to a CAVE algorithm 212 to generate an authentication signature, i.e., a response to the challenge. This signature is then used by the MSC 120 to authenticate the subscriber station 102 by comparing 216 the signature to the output of a similar CAVE algorithm 214 applied to the Broadcast RAND, the SSD-A, the ESN, and the telephone number dialed. The ESN may be retrieved by the MSC 120 from the VLR (see
The GSM subscriber station 302 also uses the individual subscriber authentication key (Ki) provisioned into the SIM and the RAND received from the GSM MSC 304 to generate the ciphering key (KC) using an A8 GSM algorithm 312, which is also well known in the art. The ciphering key (KC) generated by the GSM subscriber station 308 is sent to a GSM BTS 314 where it is compared 315 to the ciphering key (KC) received from the GSM MSC 304. The ciphering key (KC) is also used by the GSM subscriber station 302 to encrypt communications with the GSM BTS 314 using an A5 GSM algorithm, which is also well known in the art.
A CDMA subscriber station may be designed to replace a GSM device. The CDMA subscriber station may be configured to accept the SIM from the GSM device, thereby facilitating the transition to CDMA wireless connectivity to GSM core networks. In this configuration, the CDMA subscriber station uses the GSM security credentials on the SIM to establish a secure connection with the GSM core network. Preferably, the authentication process is performed using a challenge/response procedure between the subscriber station and the MSC in the CDMA wireless network. This approach tends to reduce signaling traffic between the CDMA and GSM networks. In at least one embodiment of the communications system, the challenge/response procedure does not require any changes to the CDMA MSC or the GSM core network.
A process for authenticating a CDMA subscriber station in a GSM network that meets these objectives will now be described in connection with
The authentication process is performed in two stages. The first stage involves the establishment of the shared secret key, i.e., the ciphering key (KC), between the subscriber station 102 and the CDMA MSC 120. The second stage involves a one-pass challenge/response transaction between the two.
The first stage begins with the registration of the subscriber station 102 with the MSC 120 in the CDMA wireless network 108. The MSC 120 then sends an authentication request to the gateway 124. In response to the authentication request, the gateway 124 retrieves from the GSM HLR 122 subscriber information and a triplet. The triplet includes a ciphering key (KC), a RAND, and an XRES. The gateway 124 stores the subscriber information in the VLR (not shown), and sends the ciphering key (KC) to the MSC 120 and the RAND to the SIM 114. The SIM 114 uses the RAND, along with its individual subscriber authentication key (Ki), to generate the ciphering key (KC) using an A8 GSM algorithm 312.
The second stage of the authentication process is performed for each new session established by the subscriber station 102. The process begins at the MSC 120 by sending to the subscriber station 102 a random challenge (Broadcast RAND) from a Broadcast RAND generator 210. The subscriber station 102 uses the Broadcast RAND, along with the ciphering key (KC) computed on the SIM 114, the ESN, and the telephone number dialed, as inputs to a CAVE algorithm 212 to generate an authentication signature, i.e., a response to the challenge. This signature is then used by the MSC 120 to authenticate the subscriber station 102 by comparing 216 the signature to the output of a similar CAVE algorithm 214 applied to the Broadcast RAND, the ciphering key (KC), the ESN, and the telephone number dialed. The ESN may be retrieved by the MSC 120 from the VLR (not shown) and the telephone number dialed is sent to the MSC 120 by the subscriber station 102 as part of an exchange of signaling messages to negotiate the session.
The various illustrative logical blocks, modules, circuits, elements, and/or components 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 component, 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 components, 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.
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 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 limited to the embodiments shown herein, but is to be accorded the full scope consistent with the claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.” All structural and functional equivalents to the elements of the various embodiments described throughout this disclosure that are known or later come to be known to those of ordinary skill in the art are expressly incorporated herein by reference and are intended to be encompassed by the claims. Moreover, nothing disclosed herein is intended to be dedicated to the public regardless of whether such disclosure is explicitly recited in the claims. No claim element is to be construed under the provisions of 35 U.S.C. §112, sixth paragraph, unless the element is expressly recited using the phrase “means for” or, in the case of a method claim, the element is recited using the phrase “step for.”
Number | Name | Date | Kind |
---|---|---|---|
4901307 | Gilhousen et al. | Feb 1990 | A |
5675629 | Raffel et al. | Oct 1997 | A |
5862481 | Kulkarni et al. | Jan 1999 | A |
5878036 | Spartz et al. | Mar 1999 | A |
5887251 | Fehnel | Mar 1999 | A |
6144653 | Persson et al. | Nov 2000 | A |
6195338 | Decker | Feb 2001 | B1 |
6223026 | Martschitsch | Apr 2001 | B1 |
6298232 | Marin et al. | Oct 2001 | B1 |
6320873 | Nevo et al. | Nov 2001 | B1 |
6408173 | Bertrand et al. | Jun 2002 | B1 |
6564055 | Hronek | May 2003 | B1 |
6584310 | Berenzweig | Jun 2003 | B1 |
6681111 | Ahn et al. | Jan 2004 | B2 |
6839434 | Mizikovsky | Jan 2005 | B1 |
6853729 | Mizikovsky | Feb 2005 | B1 |
7043238 | Ahn et al. | May 2006 | B2 |
7110747 | Jain et al. | Sep 2006 | B2 |
7155526 | Chaudhary et al. | Dec 2006 | B2 |
7206576 | Jain et al. | Apr 2007 | B2 |
7343490 | Le et al. | Mar 2008 | B2 |
7539491 | Jain et al. | May 2009 | B2 |
7660417 | Blom et al. | Feb 2010 | B2 |
7733901 | Salkini et al. | Jun 2010 | B2 |
20010044295 | Saito et al. | Nov 2001 | A1 |
20020094811 | Bright et al. | Jul 2002 | A1 |
20030101345 | Nyberg | May 2003 | A1 |
20030108007 | Holcman et al. | Jun 2003 | A1 |
20030148791 | Ahn et al. | Aug 2003 | A1 |
20040003056 | Yamaguchi et al. | Jan 2004 | A1 |
20040116155 | Aisenberg | Jun 2004 | A1 |
20040133623 | Murtagh et al. | Jul 2004 | A1 |
20040137899 | Hartmaier | Jul 2004 | A1 |
20040224666 | Jain et al. | Nov 2004 | A1 |
20040224667 | Jain et al. | Nov 2004 | A1 |
20050010692 | Jain et al. | Jan 2005 | A1 |
20050031124 | Jain et al. | Feb 2005 | A1 |
20050096014 | Jain et al. | May 2005 | A1 |
20050111666 | Blom et al. | May 2005 | A1 |
20050143396 | Parthasaradhi et al. | Jun 2005 | A1 |
20050215245 | Tian et al. | Sep 2005 | A1 |
20050238171 | Chen et al. | Oct 2005 | A1 |
20060050680 | Naim et al. | Mar 2006 | A1 |
20060246949 | Gupta et al. | Nov 2006 | A1 |
20070263586 | You et al. | Nov 2007 | A1 |
Number | Date | Country |
---|---|---|
2003293525 | Jul 2004 | AU |
2003293525 | Jul 2004 | AU |
1259811 | Jul 2000 | CN |
0955783 | Nov 1999 | EP |
0955783 | Nov 1999 | EP |
1001570 | May 2000 | EP |
1001570 | May 2000 | EP |
1124401 | Aug 2001 | EP |
1124401 | Aug 2001 | EP |
1257143 | Nov 2002 | EP |
1257143 | Nov 2002 | EP |
06-500900 | Jan 1994 | JP |
06500900 | Jan 1994 | JP |
0669882 | Mar 1994 | JP |
11513853 | Nov 1999 | JP |
2000-013873 | Jan 2000 | JP |
2000013873 | Jan 2000 | JP |
2000269959 | Sep 2000 | JP |
2001005782 | Jan 2001 | JP |
2001-251292 | Sep 2001 | JP |
2001251292 | Sep 2001 | JP |
2002-320255 | Oct 2002 | JP |
2002320255 | Oct 2002 | JP |
2003078969 | Mar 2003 | JP |
19990088046 | Dec 1999 | KR |
2172077 | Aug 2000 | RU |
2160975 | Dec 2000 | RU |
2160975 | Dec 2000 | RU |
92002087 | Feb 1992 | WO |
WO9202087 | Feb 1992 | WO |
97015161 | Apr 1997 | WO |
WO9715161 | Apr 1997 | WO |
00013441 | Mar 2000 | WO |
WO0013441 | Mar 2000 | WO |
01054435 | Jul 2001 | WO |
WO0154435 | Jul 2001 | WO |
02041641 | May 2002 | WO |
WO0241641 | May 2002 | WO |
2062085 | Aug 2002 | WO |
WO02062085 | Aug 2002 | WO |
WO2004084424 | Sep 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20070180242 A1 | Aug 2007 | US |