ESTABLISHMENT OF CRYPTOGRAPHIC KEYS IN RADIO NETWORKS

Abstract: Characteristics of the radio channel are used to establish key sequences for use in encrypting communicated information. These characteristics are the short-term reciprocity and rapid spatial decorrelation of phase of the radio channel. The keys can be established with computations equivalent to a bounded distance decoding procedure, and the decoder used to establish a key may be used for processing the subsequent data transmission. Compared to classical and public-key systems, an alternative mechanism for establishing and sharing key sequences that depends on a physical process is provided in which each party need not generate a pseudorandom quantity because the necessary randomness is provided by the temporal and spatial non-stationarity of the communication channel itself. By using a channel decoder, the probability of two users establishing the same secret key is substantially unity, and the probability of an eavesdropper establishing the same key is substantially zero. Also, the number of possible keys is large enough that finding the correct one by exhaustive search is impractical.

Description: Establ ishment of Cryptographic Keys 1n Radio Networks BACKGROUND Applicants' invention relates to apparatus and methods for communicating information securely, which is to say with reduced susceptibility to eavesdropping. The widespread need for secure communication in radio communication systems is apparent. As just two examples, information relating to financial transactions is routinely exchanged by radio, and law enforcement officers often must communicate voice and/or data by radio. In both examples, it is critical that the communication be conducted with almost perfect secrecy, despite potential eavesdroppers' having access to strong information signals. Users of cellular radiotelephones also desire privacy in their communications, which may travel on links between mobile phones and base stations or on direct links between mobile phones. One way of providing security is to encrypt the communicated information according to some system that the users have agreed in advance to use. Several encryption methods have been described in the literature, such as the data encryption standard (DES) and public key cryptography (PKC). As explained in W. Diffie et al., "Privacy and Authentication: An Introduction to Cryptography", Proc. IEEE vol. 67, pp. 397-427 (Mar. 1979), a classical cryptographic system is in general a set of instructions, a piece of hardware, or a computer program that can convert plaintext (unencrypted information) to ciphertext, or vice versa, in a variety of ways, one of which is selected by a specific key that is known to the users but is kept secret from others. The DES is a classical cryptographic system. Popular PKC systems make use of the fact that finding large prime numbers is computationally easy but factoring the products of two large prime numbers is computationally difficult. PKC systems have an advantage over other cryptographic systems like the DES in that a PKC system uses a key for decryption (two large prime numbers) that is different from the key for encryption (the product of the two prime numbers, and an associated number). Thus, a PKC user's encryption key can be published for use by others, and the difficulty of securely distributing keys is avoided. See, e.g., R. I. Rivest et al., "A Method of Obtaining Digital Signatures and Public-Key Cryptosystems", Commun. of the ACM vol. 21, pp. 120-126 (Feb. 1978); and W. Diffie, "The First Ten Years of Public-Key Cryptography", Proc. IEEE vol. 76, pp. 560-577 (May 1988). For either a classical or PKC system, the security of a message is dependent to a great extent on the length of die key, as described in C. E. Shannon, "Communication Theory of Secrecy Systems", Bell Svs. Tech, J. vol. 28, pp. 656-715 (Oct. 1949). Unfortunately, it is often the case that two users (two police officers, for instance) do not share a secret key a priori, making secure real-time communication via a classical crytographic system impossible. Even a PKC system requires a user to generate a pseudo-random quantity. Moreover, popul PKC systems are unprovably secure, and suffer from severe requirements in computational complexity and amount of information that must be exchanged. As new ways of attacking PKC systems are mounted, PKC systems will retreat to ever longer exchange vectors (in effect, larger prime numbers) and ever more complex computations. As a result, classical and PKC cryptographic systems ar less than ideal for many communication situations. Complicating the task of any radio communication system is the variability of the radio channel caused by atmospheric disturbances, relative motion of the system users, changing radio signal reflections from structures an vehicles, etc. Such channel variability contributes to errors in the information communicated, and much effort is expended to overcome these errors. For example, some cellular radiotelephone systems convert analog information to be transmitted into digital information, which is then transformed according to a block error correction code. Such cellular radio systems are the North America digital advanced mobile phone service (D-AMPS), some of the characteristics of which are specified by the IS-54B and IS- 136 standards published by the Electronic Industries Association and Telecommunications Industry Association (EIA TIA), and the European GSM system. In such time-division multiple access (TDMA) systems, each radio channel, or radio carrier frequency, is divided into a series of time slots, each of which contains a burst of information from a data source, e.g., a digitally encoded portion of a voice conversation. Successive time slots assigned to the same user, which are usually not consecutive time slots on the radio carrier, constitute the user's digital traffic channel, which may be considered a logical channel assigned to the user. During each time slot, 324 bits may be transmitted, of which the major portion, 260 bits, is due to the speech output of a coder/decoder (codec), including bits due to error correction coding of the speech output. The remaining bits are used for guard times and overhead signalling for purposes such as synchronization. Other current cellular mobile telephone systems use analog FM to transmit speech. The three principal standards are the AMPS system in the U.S. that uses wideband FM with a spacing between channels of 30 KHz, the TACS system in the United Kingdom that uses 25 KHz channel spacings, and the NMT system in Scandinavia that uses narrow-band FM with 12.5 KHz channel spacings. In an effort to alleviate the capacity restrictions of the current analog FM systems, the D-AMPS and GSM systems, as well as systems in Japan, use digital transmission as described above. Another approach to increasing system capacity by reducing bandwidth requirements is a narrow-band FM system according to the NAMPS specification, which specifies a channel spacing of 10 KHz that is achieved by splitting each 30-KHz channel of AMPS into three parts. Figs. 1A, IB illustrate an exemplary multi-layered cellular system. An umbrella macrocell 10 represented by a hexagonal shape (see Fig. 1A) is part of an overlying cellular structure comprising many macrocells A, - A 7 , B, - B, (see Fig. IB). Each umbrella cell may contain an underlying microcell structure. The radio coverage of the umbrella cell and an underlying microcell may overla or may be substantially non-overlapping. The umbrella cell 10 includes microcells 20 represented by the area enclosed within the dotted line and microcells 30 represented by the area enclosed within the dashed line corresponding to areas along city streets, and picocells 40, 50, and 60, which cover individual floors of a building. Briefly, control channels are used for setting up calls, informing the bas stations about location and parameters associated with mobile stations, and informing the mobile stations about location and parameters associated with the base stations. The base stations listen for call access requests by mobile station and the mobile stations in turn listen for paging messages. Once a call access message has been received, it must be determined which cell should be responsible for the call. Generally, this is determined by the signal strength of the mobile station received at the nearby cells. Next, the assigned cell is ordered, by the mobile switching center (MSC) for example, to tune to an available voice channel which is allocated from the set of voice channels accessible to the assigned cell. Figs. 2A-2C show exemplary time slot formats on a digital control channel (DCC) according to the IS- 136 standard. Two possible formats for information sent from a mobile station to a base station are shown in Figs. 2A and 2B, and a format for information sent from a base station to a mobile statio is shown in Fig. 2C. These formats are substantially the same as the formats used for digital traffic channels (DTCs) under the IS-54B standard, but new functionalities are accorded to the fields in each slot in accordance with U.S. Patent Application No. 08/331,703 filed October 31, 1994, which is expressly incorporated here by reference. In Figs. 2A-2C, the number of bits in each fiel is indicated above that field. The bits sent in the G, R, PREAM, SYNC, SYNC+, and AG fields are used in a conventional way to help ensure accurate reception of the CSFP and DATA fields, e.g., for synchronization, guard times, etc. For example, the SYNC field would be the same as that of a DTC according to IS-54B and would carry a predetermined bit pattern used by the base stations to find the start of the slot. Also, the SYNC+ field would include a fixed bit pattern to provide additional synchronization information for the base stations, which would set their receiver gains during the PREAM field so as to avoid signal distortion. Fig. 3 is a block diagram of an exemplary cellular mobile radiotelephone communication system for use with the cellular structure shown in Figs. 1A, IB and the time slot formats shown in Figs 2A-2C. The communication system includes a base station 110 that is associated with a respective one of the macrocell, microcell, and picocell; a mobile station 120; and an MSC 140. Each base station has a control and processing unit 130, which communicates with the MSC 140, which in turn is connected to the public switched telephone network (not shown). Each base station also includes at least one voice channel transceiver 150 and a control channel transceiver 160, which are controlled by the control and processing unit 130. The mobile station 170 includes a similar voice and control channel transceiver 170 for exchanging information with the transceivers 150, 160, and a similar control and processing unit 180 for controlling the voice and control channel transceiver 170. The mobile station's transceiver 170 can also exchange information with the transceiver 170 in another mobile station. Other approaches to communication use systems called code division multiplexing (CDM) and code division multiple access (CDMA). In a conventional CDMA system, a digital information sequence to be communicated is spread, or mapped, into a longer digital sequence by combining the information sequence with a spreading sequence. As a result, one or more bits of the information sequence are represented by a sequence of N "chip" values. In one form of this process, called "direct spreading", each spread symbol is essentially the product of an information symbol and the spreading sequence. In a second form of spreading called "indirect spreading", the different possible information symbols are replaced by different, not necessarily related, spreadin sequences. It will be understood that the information symbols may be produce by preceding stages of channel coding and/or spreading. An advantage of such spreading is that information from many sources can be transmitted at the same time in the same frequency band, provided the spreading sequences used to represent the different sources' information sequences do not interfere with one another too much. In effect, the different spreading sequences correspond to different communication "channels". In general, there are 2 N possible binary spreading sequences of length N chips, which results in a very large number of possible CDMA channels. This proper of a CDMA system is sometimes called "soft capacity" because the number of channels is not restricted to N, as it would be in a frequency-division multiple access (FDMA) or a time-division multiple access (TDMA) system of the same bandwidth and data rate. Various aspects of conventional CDMA communications are described in K. Gilhousen et al., "On the Capacity of a Cellular CDMA System," IEEE Trans. Veh. Technol. vol. 40, pp. 303-312 (May 1991); and the following U.S. patent documents that are expressly incorporated here by reference: U.S. Patents No. 5,151,919 to Dent; and No. 5,353,352 to Dent et al.; and U.S. Patent Application No. 08/155,557 file November 22, 1993. SUMMARY In accordance with Applicants' invention, characteristics of the radio channel are used to establish and exchange cryptographic keys with almost perfect secrecy. These characteristics are the short-term reciprocity and rapid spatial decorrelation of phase of the radio channel. In other words, for a short period of time (on the order of a few milliseconds), the impulse response of a radio channel viewed from an antenna located at a position A to an antenna located at a position B is the same as the impulse response of the channel view from position B to position A, excluding thermal noise. The keys can be established with computations equivalent to a bounded distance decoding procedure, and the decoder used to establish a key may be used for processing the subsequent data transmission. Thus, compared to classical and PKC cryptographic systems, Applicants' invention provides an alternative mechanism for establishing and sharing cryptographic keys that depends on a physical process. With Applicants' system, there is no need for each party to generate a pseudorandom quantity because the necessary randomness is provided by the temporal and spatial non-stationarity of the communication channel itself. By using a channel decoder, the probability of two users establishing the same secret key is close to one, and the probability of an eavesdropper establishing the same key is essentially zero. This is called "probabilistic secrecy". Also, the number of possible keys is large enough that finding the correct one by exhaustive search is impractical. This is called "computational secrecy". These probabilistic measures are different from the Shannon measure of perfect secrecy. In one aspect, Applicants' invention provides a method of establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising the steps of, in the first radio transceiver, transmitting a plurality of sinusoidal signals, each sinusoidal signal having a respective predetermined frequency and a predetermined initial phase; and in the second radio transceiver, detecting the plurality of sinusoidal signals transmitted by the first radio transceiver, and transmitting the plurality of sinusoidal signals after a predetermined time period. This method further includes, in each of the first and second radio transceivers, the steps of determining a phase of each of the plurality of sinusoidal signals received from the other radio transceiver; determining differences between the phases of pairs of the sinusoidal signals received; quantizing each difference into a respective one of a plurality of phase decision values; and decoding a plurality of the quantized differences into a key sequence according to a predetermined block code. The method may further include the step of determining a magnitude of each of the plurality of sinusoidal signals, wherein the magnitudes are used in t decoding step as soft information. Also, the method may further include, in at least one of the first and second radio transceivers, the step of encrypting information to be transmitted according to the key sequence; and in at least the other one of the first and second radio transceivers, the step of decrypting encrypted transmitted information according to the key sequence. In another aspect, Applicants' invention provides a method of establishin a key sequence for secure communication between a first radio transceiver and second radio transceiver comprising the steps of, in the first radio transceiver, transmitting a predetermined digital word including a plurality of bits; and in th second radio transceiver, detecting the predetermined digital word transmitted b the first radio transceiver, and transmitting the predetermined digital word after predetermined time period. This method further includes, in each of the first a second radio transceivers, hard-decision decoding each of the plurality of bits in the predetermined digital word received from the other radio transceiver; and mapping the hard-decision decoded plurality of bits into a key sequence according to a predetermined block code. In yet another aspect, Applicants' invention provides a method of establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising the steps of, in the first radio transceiver, transmitting a predetermined digital word including a plurality of bits; and in the second radio transceiver, detecting the predetermined digital word transmitted by the first radio transceiver, and transmitting the predetermined digital word after a predetermined time period. This method further includes, in each of the first and second radio transceivers, the steps of determining a phase of each of the plurality of bits received from the other radi transceiver; determining a difference between each phase determined and a respective predetermined phase; quantizing each difference into a respective one of a plurality of phase decision values; and decoding a plurality of the quantize differences into a key sequence according to a predetermined block code. In various other aspects, Applicants' invention provides several apparatus for establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver. BRIEF DESCRIPTION OF THE DRAWINGS Applicants' invention is described below in more detail with reference to embodiments that are given only by way of example and that are illustrated in the accompanying drawings, in which: Figs. 1A, IB illustrate an exemplary multi-layered cellular system; Figs. 2A-2C show exemplary time slot formats; Fig. 3 is a block diagram of an exemplary cellular mobile radiotelephone system; Fig. 4 is a block diagram illustrating a communication system; Fig. 5 is a block diagram illustrating a communication system using a comb of tones for establishing a key sequence; Fig. 6 shows phase-space decision regions; Fig. 7 shows probability density functions of the random variable Fig. 8 is a block diagram of a communication system using pilot symbols for establishing a key sequence; and Fig. 9 shows the performance of a communication system in accordance with Applicants' invention. DETAILED DESCRIPTION While the following description is in the context of cellular communication systems involving portable or mobile radiotelephones and/or personal communication networks, it will be understood by those skilled in the art that Applicants' invention may be applied to other communication applications. SYSTEM OVERVIEW Consider the n-dimensional vector space consisting of all vectors having elements that are contained in the Galois field GF(M = 2"), viz., all r = (r,, r 2 ..., r where £ GF(M = 2"). (In the following, vector quantities, or sequences, are indicated by bold type and scalar quantities and functions are indicated by plain type.) For some Hamming radius t, the M* vectors r are t- sphere packed into S spheres, viz., the maximum number of disjoint spheres having radii t is S. The vectors in a sphere are mapped into a representative consisting of the center of that sphere. Let the set of S representatives be {c,, c ..., c s }. Each representative vector c, has a length n and can be mapped into a binary vector k having a length mn. Let the set of corresponding binary vectors If a transmitter and a receiver can establish, with high probability, a common sequence kj that is contained in the set K, then the sequence kj can be used for spreading an information sequence communicated from the transmitter to the receiver. In addition, if the probability is substantially zero that an eavesdropper can determine that common sequence k,, then secure communication is also achieved - without incorporating an extra encryption and decryption algorithm to achieve cryptographic security. The spheres constructed in accordance with Applicants' invention increas the probability of the transmitter's and receiver's establishing such a common sequence k, in the event of noise and other discrepancies in the radio channel an system hardware. In general, the transmitter establishes a sequence r τ and the receiver establishes a different sequence r R . If the sequences r τ , r R fall within the same sphere, they will be mapped into the same sequence k in the set K. Thus, Applicants' invention provides methods and apparatus for establishing two sequences, one at a transmitter and another at a receiver, such that with high probability the two sequences fall within the same sphere. Moreover, the rare event that the two sequences are not in the same sphere is quickly detectable, enabling the procedure for establishing a common sequence t be repeated. The sphere associated with an arbitrary vector is determined efficiently in real time and with low hardware complexity. SEQUENCE ESTABLISHMENT A generalized communication link comprises two communication channels: a channel from a first user's transmitter to a second user's receiver, and a channel from the second user's transmitter to the first user's receiver. One can consider the link to include a third channel to an eavesdropper desiring access to the information exchanged by the first and second users. This simple scenario is depicted in Fig. 4, which shows a first user A, a second user B, and an eavesdropper E. In general, the characteristics of the AB channel, the BA channel, and the AE channel all vary with time. Thermal noise in each of the channels is represented by the additive noise terms n,(t), i = 1, 2, 3. Although they vary with time, the impulse response of the A-B channel is the same as the impulse response of B-A channel excluding thermal noise, which is to say that over short periods of time, on the order of a few milliseconds, the link is reciprocal. It will be understood that the link is not reciprocal when thermal noise (and other possible nonidealities) are included. Also, it is important to understand that the impulse responses of the A-B channel and B-A channel are different from the impulse responses of the first- user—eavesdropper A-E channel and the second-user— eavesdropper B-E channel. These differences arise because signal phase decorrelates rapidly with changing spatial position. Two methods of establishing a key sequence are described below. COMB OF TONES The immediately following description involves transmission of two tones at a time, but it will be appreciated that more than two tones can be transmitted at a time as described later. Referring to Fig. 5, suppose a first transceiver such as the first user A transmits a signal s(t) comprising two sinusoids having frequencies f, and f 2 and having equal initial phase offsets φ and energies E during a k-th signaling interval [kT, (k+ l)T]. The transmitted signal s(t) can be generated in any of a number of ways, e.g., by amplifying and summing the output signals of two suitable oscillators 501, 503 or a frequency synthesizer, and upconverting the result to a suitable transmission frequency by modulating a carrier signal. Ignoring the modulation, the transmitted signal s(t) is given by the following expression: s(ή = v / 2E/rcos(2τ/ l t + φ) * v2£/7cos(2τ/ 2 t * φ) • In general, the transmitted signal s(t) is radiated by an antenna and passe through a channel such as the air, which modifies the transmitted signal by introducing time-varying fading due to multipath propagation and by adding white Gaussian noise n(t) having double-sided power spectral density Nr/2. The receiver downconverts and amplifies the signal that it obtains from die channel (die downconverter and amplifier are not shown in Fig. 5), and correlates the resulting signal r(t) with its own locally generated versions of cos(2τf,t) and cos(2τf 2 t). As shown in Fig. 5, each correlation can be carried out by a suitable mixer 505, 507 and a resettable integrator 509, 511, which integrates the mixer's output signal during successive time intervals T = l/2τf;, although many other devices that are known to those of ordinary skill in this art can be used. The output signals generated by the correlators are conventionally filtered by low-pass filters 513, 515 for suppressing the sum (up-converted) signals, as well as components mat might be due to nearby radio signals. Assuming the sinusoids cos(2τf,t) and cos(2τf 2 t) are orthogonal and separated by at least the coherence bandwidth of the channel, the signal r(t) received by a second transceiver such as the second user B during the k-th signaling interval is given by the following expression: r(ή - 2Λ 2 (*)E/7cos(2 ;f + θ,(*)) + v / 2Λ 2 (*)£/rcos(2τ 2 * θ 2 (*)) * /ι(t) where the amplitude coefficients Aj(k), i = 1, 2, are independent, identically distributed random variables. For a channel suffering Rayleigh-distributed fading, the variables Λ j (k) have Rayleigh probability densities given by the following expression: Eq. 2 where σ 2 is a characteristic of die channel and E{.} denotes expectation with respect to p A . The phase terms θ,(k) and θ 2 (k) are mutually independent random variables, and each has a probability density that is uniform over die interval [— T, T]. Similar expressions for die received signal r(t) can be developed for communication channels having otiier characteristics, such as Rician-distributed fading. For example, the probability densities for a Rician-distributed channel are given by die following expression: λ, x? - _ exp(- -) I 0 (^). for ≥ 0 σ 2 20 2 PA) - 0, for \. < 0 Eq. 3 where I Q (.) is die modified Bessel function of zero order, and s 2 is die power of a direct line-of-sight component. In the transceiver of die second user B, die filtered correlator output signals are provided to a differential phase detector 517, which generates, for each time interval T, an estimate of die difference between the phase terms θ,(k) and θ 2 (k). The successive phase-difference estimates are provided to a quantize 519, which allocates a respective one of a number of predetermined phase value to each phase-difference estimate. In accordance with Applicants' invention, it only necessary tiiat die phase-difference estimates for different time intervals be uncorrelated with each otiier. (In die following, die time index k will be dropp when it results in no ambiguity.) The baseband differential signal generated by die differential phase detector 517 in die receiver B is given by the following expression: U B = 2A,A j E exp[ (θ, - θ 2 )] + Λ,iV, + Λ J Λ J ' - X B + /y B Eq. where N, and N 2 are complex-valued Gaussian random variables having zero means and variances σ 2 = 2EN 0 , and "*" denotes conjugation. The phase- difference estimate is given by Φ B = tan' 1 Y B /X B . As noted above, die second user B quantizes die phase-difference estimate into one of M predetermined pha values, generating a quantizer output signal Q(Φ B ). Fig. 6 illustrates phase-spac decision regions for M = 4. The differential phase detector or phase measuring device 517 may produce either an analog or a digital measurement of die baseband signal's instantaneous phase. A suitable differential detector is a combination of two of the phase detectors described in U.S. Patents No. 5,084,669 to Dent and U.S. Patent No. 5,220,275 to Holmqvist, botii of which are expressly incorporated here by reference. By repeating die above estimation-quantization process at each of times k = l, 2, ..., n, die second user B establishes a sequence of quantized phase- difference estimates mat is given by the following expression: r B = [ <2(*!), β(Φ 2 ), .-, (K*W) ]• *' This sequence r B of phase values generated by die quantizer 519 is stored in a buffer 521, such as a random-access memory, a shift register, or equivalent device, which has a lengtii that is determined by parameters of a minimum distance, error correction decoder 523. The error correction decoder 523 in die receiver B transforms die sequence of quantized phase-difference estimates and generates an output signal tiiat corresponds to die receiver's key sequence kg. In effect, die size of die buffer 521 is determined by die lengtii of die key sequence desired. If die decoder 523 has a block lengtii N and dimensionality k, men die buffer delay is N for tiiis example in which die comb consists of only two tones simultaneously transmitted at each of N times. As described below, more than two tones can be simultaneously transmitted, which reduces die buffer delay accordingly. For example, if T tones are simultaneously transmitted, T — 1 phase differences can be quantized at once, and die buffer delay is N/(T - 1). The vector r B generated by die buffer 521 has N elements, each of which is M-ary, and this N-element vector is die input to any of a wide variety of minimum distance decoders 523. One useful decoder is die bounded distance decoder, which is a low-complexity decoder described in R. Blahut, Theory and Practice of Error Control Codes, chapt. 7, Addison- Wesley, Reading, MA (1983). The decoder 523 maps die N symbols generated by the buffer to anotiier N symbols, which is die cryptographic key sequence k B of interest, as described in more detail below. It will be appreciated tiiat the signal processing operations carried out in die receiver can be performed in die digital domain by a suitable digital signal processing (DSP) device. With such a configuration, almost any type of modulation can be detected by programming die DSP device to appropriately manipulate digital samples of die received signal, as described for example in U.S. Patent Application No. 07/967,027 to Dent et al. for "Multi-Mode Signal Processing", which is expressly incorporated here by reference. It will be appreciated tiiat the DSP device may be implemented as hard-wired logic circuitry, or, preferably, as an integrated digital signal processor, such as an application-specific integrated circuit (ASIC). Of course it will be understood that an ASIC may include hard-wired logic circuitry that is optimal for performing a required function, which is an arrangement commonly selected when speed or anotiier performance parameter is more important man die versatility of a programmable digital signal processor. In a manner and with hardware similar to tiiat described above, die first user A establishes its own sequence of quantized phase-difference estimates fro a signal transmitted by the second user B. With a delay after transmission by first user that is negligible, i.e., a delay that is small in comparison to die channel's coherence bandwidtii, the second user B transmits a signal comprisin die two sinusoids having die frequencies f, and f 2 and equal phase offsets and energies. In other words, die first user A transmits, then the second user B, th die first user A, and so on in an interleaved manner in order to maintain the reciprocity assumption. Suppose die first user A is a radiotelephone moving at a speed of 100 km/hr with respect to a base station or other transceiver (die second user B and using a radio frequency carrier in die 900 MHz region. If the delay betwe die transmissions by die first user and die transmissions by the second user is 1 μsec, die radiotelephone would move only 0.28 mm during each delay, a distance tiiat is negligible in comparison to the wavelength of 0.3 m. Thus, the scatterings of the signal from the various reflectors should be strongly correlate Also, a 10-μsec delay is longer than the time usually needed to permit all signa rays due to multipath propagation to arrive at die second user and shorter than die few milliseconds needed to ensure the reciprocity of die channel. If the motion is slower or the delay is shorter, the reciprocity of the channel is even more precise. Thus, die first user A forms a baseband differential signal (the output of its own differential phase detector) given by the following expression: U λ * 2Λ 1 Λ 2 £ exprøθ. - θ 2 )] + A,V, + ^v; - X A + jY A Eq. 6 where V, and V 2 are independent of N, and N 2 . The estimated phase difference generated by die first user A is Φ* = tan '1 Y A /X A . It will be observed that, due to die reciprocity of die channel, d e only difference between U A and U B is die additive Gaussian noises. By successively repeating die estimation-quantization process, the first user A establishes a sequence of phase-difference estimates at is given by die following expression: r κ « [ β(Φf), β ), ..., β(Φ Λ A ) ]. Eq. 7 which is die sequence stored in a buffer in die first user's transceiver and provided to a corresponding error correction decoder in tiiat first transceiver. From these transmitted signals, die eavesdropper E can obtain a baseband differential signal given by die following expression: U E = 2Λ 3 Λ 4 £ exp[ (θ 3 - Θ ] + Λ 3 3 + Λ 4 V/ = X E + jY E E . 8 where the A;, i = 1, 2, 3, 4, are mutually independent. The eavesdropper's estimated phase difference is Φ E = tan 0 Y E /X E . Also, the θ it i = 1, 2, 3, 4, are mutually independent random variables. The eavesdropper E can establish a sequence of phase-difference estimates given by die following expression: r E - [ fl( Ϊ>. Q(Φ 2 E ), »., <2(Φ£) ] Eq- 9 As noted above, each of the tiiree sequences or vectors r A , r„, and r B that are established is provided as an input signal to a respective error correction decoder. The output signals generated by die decoders correspond to die key sequences k A , k B , k E . It will be noted tiiat no encrypting need be performed at die transmitters A, B. The decoders limit die number of possible keys to increase die probability of die first user's and second user's establishing the sa key as described in more detail below. To explain why die tones f,, f 2 must have frequencies that are sufficientl separated so mat tiieir phases are independent, let A (θ, - 9,) - (θ 3 - Θ . Eq. and define ΛM 1 -α 2 V / l -α 2 cos 2 j + αcosx cos ' H-c-COSx) _ . * w τ 4T_x 2 (l —-α 3 2 —cos 2 2 jr)3 3 /2 2 Eq. where α 2 = ; Jo is the Bessel function of order 0; ωi, is die Doppler frequency shift due to relative motion between the transmitter and receiver; r is die transmission time delay; and σ is a time delay spread between die multipath signal rays. Then, as explained in W. C. Jakes, Jr., ed., Microwave Mobile Communications chapt. 1, John Wiley and Sons (1974), i a random variable having a probability density function given by the following expression: />♦<*) = 4T J * *(*)[*(* * tf) + 8dx ~ m dx Eq. Fig. 7 shows the probability density function p* as a function of /τ for five different values of the parameter a 2 . For a frequency separation (ω, — ω^ of 40 KHz and a time delay spread a of 5 μsec (i.e., or 2 < 0.4, even for the worst case that ω D r = 0), die random variable tj is almost uniformly distributed In this case, die quantizers quantize the phase-difference estimates into each of die M phase values witii equal probability 1/M. The security of the system depends on die degree to which the phases of die tones are decorrelated by passage through die communication channel. If the decorrelation is substantiall complete, then the amount of work an eavesdropper must do to break die syste approaches that of an exhaustive search for the key sequences k A , k B . It will be appreciated that the preceding analysis was simplified by lettin die two tones have equal energies and equal initial phase offsets, which are easy to obtain witii a phase-locked loop for example. In general, it is only necessary for tiiese parameters to be predetermined, viz., known a priori to both transceivers, but such a system is more complicated than that described above. Also, die preceding analysis considered only two tones transmitted at any one time, but in general, the comb could consist of more man two simultaneously transmitted tones and die preceding analysis would apply to successive pairs of such a comb of tones. In fact, die sequences r A , r B could be generated all at once by simultaneously transmitting a comb of the appropriate number of tones, and estimating and quantizing die phase difference of each successive pair of tones. Simultaneous transmission of the two or more tones is desirable because it is easy then to control the initial phases of die tones, leading to a less complicated system. Moreover, it is not necessary tiiat die frequency separation between the tones in one pair of tones be die same as die frequency separation between another pair; in other words, die "comb" can have unevenly spaced "teeth". Also, it is not necessary to consider only pairs of successive tones; in other words, die "teeth" in a pair can be separated by otiier "teeth". For example, if die comb includes ten tones f,, f 2 , . . . f, 0 arranged in order of increasing frequency, die necessary uniform distribution of the random variable ψ (see Eq. 12) could be obtained by pairing, say, die tones f, and f 4 ; f 2 and f 5 ; f 3 and f β ; etc. It is only necessary for die tones in each pair to be orthogonally spaced, i.e., die frequency separations must be sufficient as described above. PILOT SYMBOLS Instead of transmitting a comb of sinusoids as described above, die key sequences k A , k B can be established based on only a plurality of pilot symbols such as die bits tiiat may be transmitted for synchronizing the operation of a first transceiver and a second transceiver. Such sync bits are typically included in conventional cellular radiotelephone systems as described above in connection witii Figs. 2A-2C. Two ways of establishing die keys based on die pilot symb are described below. A sequence k can be crudely established by hard-decision decoding die pilot symbols and mapping die resulting sequence of decoded pilot symbols to t center of a sphere. It is believed that any errors in die sequence decoded by di first user will be die same as errors in the sequence decoded by the second use Thus, the two pilot symbol sequences will be mapped to the same sphere and yield the same key. Even if the errors in the sequences decoded by the first an second users are slightly different, die two sequences will still be mapped to th same sphere with high probability, yielding the same key. A possible shortcoming of this method is that many pilot symbols are needed to make it computationally difficult for an eavesdropper to exhaust all possibilities. If the pilot symbols are die sync bits in a cellular radio telephone system, it is current believed tiiat at least sixty bits are needed. It will be appreciated that die necessary pilot symbols need not be transmitted together, viz., it is not necessary to use all of the sync bits in one time slot of a TDMA channel. For example, any one or more of the sync bits one time slot can be used with any one or more of the sync bits in other time slots. It is only necessary that the time slots be separated by a time interval th is longer than the coherence time of die channel as described above. A more refined method of establishing a key sequence based on the pilo symbols uses channel state information rather than hard-decision decoding. In this method, the first and second users interpolate known pilot symbols and quantize the outputs of die interpolators in a manner similar to that described above with respect to die method of establishing die key based on a comb of tones. For example, after downcon verting, amplifying, and filtering the receiv signal as necessary, the second user determines a phase estimate for each of th bits in the sync portion of a time slot. Of course, the first and second users could agree to use another set of known bits. The second user determines the differences between each of die phase estimates and die respective predetermined phases for die known bits. These phase-difference estimates are then quantized and provided to a minimum distance decoder as described above in connection with key establishment by transmitting a comb of tones. Fig. 8 is a block diagram of a system for carrying out this "refined method" of using pilot symbols. In a first transceiver, data to be transmitted is encrypted according to a key sequence by an encryptor 801. Of course, before die key sequence has been established, die encryptor would simply pass die data to be transmitted widiout alteration. A multiplexer 803 combines the encrypted data to be transmitted witii the known pilot symbols, which may be bits used for synchronization and overhead signaling in conventional radiotelephony. It is only necessary for die pilot symbols to be transmitted with known phases. The sequence of interleaved data and pilot symbols formed by die multiplexer 803 is provided to a pulse shaper and up-converter 805 for transmitting the information through the communication channel, which in general is characterized by fading and additive white gaussian noise. At the receiving second transceiver, die signal received from die channel is down-converted as necessary and passed through a matched filter 807. The signal generated by the matched filter 807 is divided by a suitably controlled switch 809, or decimator, into a signal comprising the received data that was transmitted and a signal comprising die received pilot symbols. An interpolator 811 measures die phases of die received pilot symbols and forms the difference between each measured phase, which generally will have been rotated by channel fading, and the known transmitted phase of die respective pilot symbol. The interpolator 811 preferably low-pass filters these phase-difference estimates. The phase difference values generated by die interpolator 811 are quantized by a quantizer 813, stored in a buffer memory 815 if necessary for accumulating enough phase difference values, and then decoded by a decoder 817 for generating a key sequence as described above in relation to Fig. 5. The phase difference values generated by die interpolator 811 are also provided to a demodulator 819 such as an error correction decoder for recoveri the data that was transmitted. The demodulator 819 also receives die data that was transmitted, which may have passed through a delay device 821 suitable fo synchronizing the phase difference values and die data that was transmitted. Assuming that received data was encrypted according to die key sequence befo transmission, die encrypted transmitted data produced by the demodulator 819 and die key sequence produced by die decoder 817 are provided to a decryptor 823 for recovering die data transmitted. In a manner and witii hardware similar to that described above, the transmitter establishes its own key sequence based on transmissions from die receiver, and tiiat key sequence can be used to decrypt encrypted transmissions from the receiver. SPHERE PACKING AND ASSOCIATION Assuming that K is given and die spheres are predetermined, die genera problem of mapping an arbitrary sequence to a sphere is NP-hard, viz., die computational complexity of the problem is proportional to the number of possible spheres. For this application of secure transmission and spreading, die number of spheres is prohibitively large. Nevertheless, imposing a simplifying structure on the candidate sequences k (corresponding to the representatives c o die spheres) serves to reduce die computational complexity to an acceptable level. In accordance with Applicants' invention, the set of candidate sequences is limited to the set of sequences of a linear block error correcting code. The radii of the spheres are tiien determined by such a code's error correcting capability, i.e., die number of errors tiiat the code can correct, and die received sequences r can be mapped to die candidate sequences k by an appropriate known decoding procedure. As one specific example, linear Bose-Chaudhuri-Hocquenghem (BCH) codes can be used as the set of candidate sequences k; such codes can be decoded witii low complexity using either the Peterson-Gorenstein-Zierler procedure or die Berlekamp-Massey procedure, or any procedure for decoding cyclic codes, as described in die above-cited book by R. Blahut. If the code parameters are (n, k) with minimum Hamming distance d and witii code symbol alphabet GF(2"), candidate sequences of lengtii mn can be established from a set of size 2"". The Hamming radius t of die sphere, or equivalently die error correcting capability of die code, is given by t ≤ [(d — l)/2]. (The spheres need not be closely packed). The received sequences r A , r B , and r E are die inputs to error correction decoders implementing the Berlekamp-Massey procedure. The outputs of the decoders are die sequences k A , k B , and k E . Again, it will be noted tiiat no encrypting need be performed by die transmitters. The decoders substantially limit the number of possible sequences, thereby increasing the likelihood of sequence agreement between die first and second users. It may be noted that decoders might not be needed at very high signal-to-noise ratios (SNRs), although such very high SNRs would be difficult to obtain in a practical communication system. In many communication systems, an information sequence to be communicated is block-coded for correcting errors. In orthogonal block coding, a number N of information bits are converted to one of 2 N N-bit orthogonal codewords. Decoding such an orthogonal codeword involves correlating it with all members of die set of 2 N codewords. The binary index of die codeword giving the highest correlation yields die desired information. For example, if the correlations of a received 16-bit codeword with each of die set of sixteen orthogonal 16-bit codewords having indices 0-15 produce die highest correlation on the tenth codeword, die underlying information signal is the 4-bit binary codeword 1010 (which is die integer ten in decimal notation). Such a code is called a [16,4] orthogonal block code. By inverting all of die bits of the codewords, one further bit of information may be conveyed per codeword. This type of coding is known as bi-orthogonal block coding. A significant feature of such coding is tiiat simultaneous correlation with all the orthogonal block codewords in a set may be performed efficiently by means of a Fast Walsh Transform (FWT) device. In die case of a [128,7] block code, for example, 1 input signal samples are transformed into a 128-point Walsh spectrum in which each point in the spectrum represents the value of the correlation of the input signal samples with one of the codewords in the set. A suitable FWT processo is described in U.S. Patent No. 5,357,454 to Dent, which is incorporated here reference. PERFORMANCE ANALYSIS To assess die performance of Applicants' sequence agreement system, it is helpful to assume the following events: G, = {Θ A 6 R t , Θ B e /?,}, B, = {Θ A e Λ,, Θ E e R . The probability of a symbol match between die first and second users is given die following expression: p . Pr JPriG) ■ ∑ [Λ- (Θ A 6 *,)] 2 Eq. The probability of a symbol match between die first user and an eavesdropper i given by the following expression: P h -- Pr IJ/V-tfJ,) Eq. ■ •1 Λf The probability density function of an estimated phase θ in a decision region can be derived as follows. Initially, assume Δ = θ, - θ 2 is given and equal to zero. Consider die following: where, conditioned on Λ, and Λ 2 , E{X} = 2Λ,Λ 2 £ & μ ; E(Y) = 0, and variance (X) = variance (Y) = 2£iV 0 (Λ^ + Λ^) A σj • The conditional join U = 2A,A j £ + Λ j -V, ♦ A j iVj * - X * jY X - 2A t Λ 2 £ * Re{X N x * Λ j _V 2 * ) Y - Im(A l N. + Λ J Λ probability density function of X and Y is given by die following expression: -rXr,y|Λ lf Λ a ) - [ζr - μ) 2 * y 2 ] I2ά§ and with the change of variables: R - xJX 2 * 2 , and θ -* tan' 1 ∑ X die conditional joint density function of θ and R is given by die following expression: lA A j ) = — - exp {- (r 2 + μ 2 - 2μr cosø) /2σgj 2τσ Q Integrating over the interval r e [0, oβ], it can be shown that the probability density function of θ is given by: p,(θ\T) = exp (-D - Q (jϊFcosθ) where: It can be shown tiiat Δ' is uniformly distributed over die interval [— x, T]. Witii regions given by Rj = [— τi/M, τi/M], for i = 1, ..., M, the desired probability of an estimated phase θ in a decision region is given by: 2 2 2 iV n + Λ Ϊ Priβ e R) p θ (fl - δ|r) P(T) <rø dδ dT Now consider die use of a linear block code having minimum Hamming distance d, dimension k, and block length n. Let t = [(d - l)/2] be die number of errors tiiat can be corrected by die decoder. The probability that the sequences established by die first and second users agree is the probability of di two received vectors being in the same decoding region of a codeword. Let c be a codeword with Hamming weight 1. Three vectors c, r A , and are available. Rearranging die coordinates of these vectors does not change the performance analysis. One such permutation is as follows: • - 1111111 _ 11111 111 _ 11 . to - 11 coo _ oo »,_ TTr T ii-i «-■• 11-.1 β β .-* 111-1 m~*. The probability tiiat the sequences agree and that die sequence is c can be show to be given by: '■ ■ ( i - P βP;"- β Eq. where: S « /π, + m 2 + m 3 + m 4 0 ≤ j + k ≤ t Thus, the probability of mutual agreement is given by: where A, is a weight enumerator function of the code. The probability P B that die sequence established by die eavesdropper agrees is given by a similar equation substituting p,, for p ( . Without die use of a decoder, Pr(k A = kβ) = Pr(r A = r.) = p n , and Pr(k A = ke) = Pr(r A = r = 1/M » . O It is of interest to discuss die tradeoffs involved in such a sequence agreement system. A small value for die dimension k yields a code witii good error correcting capability, but as k decreases die speed witii which an exhaustive search can be carried increases exponentially. The choice of the code parameters is crucial since the code restricts die size of die candidate sequence space, but the reduction should not yield an insecure system. For a large number M of decision regions, a larger code can be used, diereby increasing die computational secrecy of the system; also, P b decreases, which results in a good probabilistic secrecy. This is not sufficient, however, to obtain a good cryptographic system. With increasing M, thermal noise effects become dominant and an increase in EJN 0 (ratio of bit energy to noise energy) is required to achieve a sequence agreement witii certain probabilistic secrecy. Therefore, a tradeoff exists between computational secrecy, probabilistic secrecy, and transmitted energy. As anodier example, consider the use of a (31,13) Reed-Solomon code over GF(32). The size of die code (die number of possible codewords, or bit sequences) is 32 13 = 2 65 , and the computational secrecy is substantially better than that of DES 2 M , which is a sequence of a system using the digital encryp standard, consisting of fifty-six secret bits and eight parity bits. The minimum Hamming distance of such a Reed-Solomon code is eighteen. Fig. 9 shows die performance of a secure communication system that u such a Reed-Solomon code. Also shown are the performance of a (61, 11) Ree Solomon code and die performances of two uncoded systems. From Fig. 9, it can be seen that, with die use of a channel decoder, die probability tiiat the ke established by die first and second users do not agree is 10"* at signal to noise ratios Eb/No of 11 dB and 13 dB for M = 64 and M = 32, respectively. This a gain of about 9 dB and 4 dB, respectively, compared to a communication system without a decoder. Moreover, Pr(k A = k^ = 0 and Pr(r A = r^ « 0 (both are about 10"* 1 ). In such a system, the use of a decoder is desirable for the first and seco users, although not strictly required as described above, but use of a decoder does not help die eavesdropper. For spreading the information transmitted or despreading die information received, die sequence produced by the decoders c be used as it is, or a binary representation of die whole or part of die sequence can be used. It will be understood that this "spreading" does not refer to die spreading carried out in a CDMA communication system. The key sequences established in accordance witii Applicants' invention are generally unsuitable fo use as CDMA spreading sequences due to their uncontrolled cross-correlation properties, although Applicants' key sequences can be used for encrypting and decrypting information communicated in a CDMA system. Applicants' sequence agreement methods and apparatus based on die reversibility of a radio channel provide superior computational secrecy as well probabilistic secrecy. Using Applicants' invention, long arbitrary key sequence can be shared, and a key sequence can be changed even during a communicatio "session". In a cellular radio telephone system, it would be desirable to establi a new key sequence at least each time a mobile station registered with the communication system, and even perhaps more frequendy, such as for each cal or each time a predetermined time interval elapses. Instead of using a linear block code, a secure communication system could employ combs of 2M orthogonal tones transmitted by each user. Such a comb system has the same performance as a block-code system, but die comb system requires a much larger bandwidth, as required by orthogonal signaling, and a more complex frequency synthesizer for generating die tones. In either system, the performance measure for security is taken to be probabilistic, and different from die Shannon measure of perfect secrecy. In particular, in the block-code system, die probability of two users' establishing the same secret key sequence is close to one and the probability of an eavesdropper's establishing die same sequence is substantially zero. This is probabilistic secrecy. Also, die number of possible key sequences is large enough tiiat finding die correct sequence by exhaustive search is impractical. This is computational secrecy. While particular embodiments of Applicants' invention have been described and illustrated, it should be understood tiiat die invention is not limited thereto. This application contemplates any and all modifications that fall within die spirit and scope of Applicant's invention as defined by die following claims.

Claims: CLAIMS: 1. A method of establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising the steps of: in die first radio transceiver, transmitting a plurality of sinusoidal signa each sinusoidal signal having a respective predetermined frequency and a predetermined initial phase; in the second radio transceiver, detecting the plurality of sinusoidal signals transmitted by die first radio transceiver, and transmitting the plurality sinusoidal signals after a predetermined time period; in each of the first and second radio transceivers, determining a phase each of the plurality of sinusoidal signals received from the other radio transceiver; in each of die first and second radio transceivers, determining differenc between the phases of pairs of die sinusoidal signals received; in each of the first and second radio transceivers, quantizing each difference into a respective one of a plurality of phase decision values; and in each of die first and second radio transceivers, decoding a plurality the quantized differences into a key sequence according to a predetermined blo code. 2. The method of claim 1, further comprising, in each of the first and second radio transceivers, the step of determining a magnitude of each of the plurality of sinusoidal signals, wherein the magnitudes are used in the decodin step as soft information. 3. The metiiod of claim 1, further comprising, in at least one of the fi and second radio transceivers, the step of encrypting information to be transmitted according to the key sequence; and in at least the other one of die first and second radio transceivers, die step of decrypting encrypted transmitte information according to die key sequence. 4. The method of claim 3, wherein the encrypting step comprises the step of combining die key sequence and die information to be transmitted in a stream cipher system. 5. The metiiod of claim 3, wherein the encrypting step comprises die step of combining die key sequence and die information to be transmitted in a block-oriented cipher system. 6. A method of establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising die steps of: in die first radio transceiver, transmitting a predetermined digital word including a plurality of bits; in the second radio transceiver, detecting die predetermined digital word transmitted by die first radio transceiver, and transmitting the predetermined digital word after a predetermined time period; in each of die first and second radio transceivers, hard-decision decoding each of the plurality of bits in die predetermined digital word received from the otiier radio transceiver; and in each of the first and second radio transceivers, mapping the hard- decision decoded plurality of bits into a key sequence according to a predetermined block code. 7. The metiiod of claim 6, further comprising, in each of the first and second radio transceivers, die step of determining a magnitude of each of die plurality of bits, wherein die magnitudes are used in die mapping step as soft information. 8. The method of claim 6, further comprising, in at least one of die first and second radio transceivers, the step of encrypting information to be transmitted according to the key sequence; and in at least the other one of die first and second radio transceivers, die step of decrypting encrypted transmitted information according to die key sequence. 9. The metiiod of claim 8, wherein die encrypting step comprises the step of combining the key sequence and die information to be transmitted in a stream cipher system. 10. The method of claim 8, wherein die encrypting step comprises die step of combining die key sequence and the information to be transmitted in a block-oriented cipher system. 11. A metiiod of establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising die steps of: in the first radio transceiver, transmitting a predetermined digital word including a plurality of bits; in the second radio transceiver, detecting the predetermined digital word transmitted by die first radio transceiver, and transmitting the predetermined digital word after a predetermined time period; in each of die first and second radio transceivers, determining a phase of each of die plurality of bits received from die other radio transceiver; in each of the first and second radio transceivers, determining a differenc between each phase determined and a respective predetermined phase; in each of die first and second radio transceivers, quantizing each difference into a respective one of a plurality of phase decision values; and in each of the first and second radio transceivers, decoding a plurality of die quantized differences into a key sequence according to a predetermined bloc code. 12. The method of claim 11, further comprising, in each of die first and second radio transceivers, die step of determining a magnitude of each of die plurality of bits, wherein the magnitudes are used in die decoding step as soft information. 13. The method of claim 11, further comprising, in at least one of the first and second radio transceivers, die step of encrypting information to be transmitted according to die key sequence; and in at least the other one of the first and second radio transceivers, the step of decrypting encrypted transmitted information according to the key sequence. 14. The metiiod of claim 13, wherein die encrypting step comprises the step of combining the key sequence and die information to be transmitted in a stream cipher system. 15. The method of claim 13, wherein die encrypting step comprises the step of combining the key sequence and the information to be transmitted in a block-oriented cipher system. 16. An apparatus for establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising: in the first radio transceiver, means for transmitting a plurality of sinusoidal signals, each sinusoidal signal having a respective predetermined frequency and a predetermined initial phase; in the second radio transceiver, means for detecting the plurality of sinusoidal signals transmitted by the first radio transceiver, and for transmitting the plurality of sinusoidal signals at a predetermined time after the beginning is detected; in each of the first and second radio transceivers, means for determining a phase of each of die plurality of sinusoidal signals received from me other radio transceiver; in each of die first and second radio transceivers, means for determining differences between die phases of pairs of the sinusoidal signals received; in each of die first and second radio transceivers, means for quantizing each difference into a respective one of a plurality of phase decision values; and in each of the first and second radio transceivers, means for decoding a plurality of die quantized differences into a key sequence according to a predetermined block code. 17. The apparatus of claim 16, further comprising, in each of the first and second radio transceivers, means for determining a magnitude of each of die plurality of sinusoidal signals, wherein die magnitudes are used by die decoding means as soft information. 18. The apparatus of claim 16, further comprising, in at least one of d first and second radio transceivers, means for encrypting information to be transmitted according to die key sequence; and in at least the other one of the first and second radio transceivers, means for decrypting encrypted transmitted information according to the key sequence. 19. The apparatus of claim 18, wherein the encrypting means combine the key sequence and the information to be transmitted in a stream cipher syste 20. The apparatus of claim 18, wherein the encrypting means combine the key sequence and die information to be transmitted in a block-oriented ciph system. 21. An apparatus for establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising: in the first radio transceiver, means for transmitting a predetermined digital word including a plurality of bits; in the second radio transceiver, means for detecting the predetermined digital word transmitted by die first radio transceiver, and for transmitting the predetermined digital word after a predetermined time period; in each of die first and second radio transceivers, means for hard-decisi decoding each of die plurality of bits in the predetermined digital word receive from die other radio transceiver; and in each of die first and second radio transceivers, means for mapping th hard-decision decoded plurality of bits into a key sequence according to a predetermined block code. 22. The apparatus of claim 21, further comprising, in each of die first and second radio transceivers, means for determining a magnitude of each of d plurality of bits, wherein the magnitudes are used by the mapping means as so information. 23. The apparatus of claim 21, further comprising, in at least one of t first and second transceivers, means for encrypting information to be transmitt according to die key sequence; and in at least die other one of the first and second transceivers, means for decrypting encrypted transmitted information according to die key sequence. 24. The apparatus of claim 23, wherein die encrypting means combines die key sequence and die information to be transmitted in a stream cipher system. 25. The apparatus of claim 23, wherein die encrypting means combines the key sequence and the information to be transmitted in a block-oriented cipher system. 26. An apparatus for establishing a key sequence for secure communication between a first radio transceiver and a second radio transceiver comprising: in the first radio transceiver, means for transmitting a predetermined digital word including a plurality of bits; in the second radio transceiver, means for detecting the predetermined digital word transmitted by die first radio transceiver, and for transmitting the predetermined digital word after a predetermined time period; in each of die first and second radio transceivers, means for determining a phase of each of die plurality of bits received from die otiier radio transceiver; in each of the first and second radio transceivers, means for determining a difference between each phase determined and a respective predetermined phase; in each of the first and second radio transceivers, means for quantizing each difference into a respective one of a plurality of phase decision values; and in each of die first and second radio transceivers, means for decoding a plurality of the quantized differences into a key sequence according to a predetermined block code. 27. The apparatus of claim 26, further comprising, in each of the first and second radio transceivers, means for determining a magnitude of each of the plurality of bits, wherein the magnitudes are used by die decoding means as soft information. 28. The apparatus of claim 26, further comprising, in at least one of the first and second transceivers, means for encrypting information to be transmitte according to die key sequence; and in at least d e otiier one of die first and second transceivers, means for decrypting encrypted transmitted information according to die key sequence. 29. The apparatus of claim 28, wherein die encrypting means combines die key sequence and die information to be transmitted in a stream cipher syste 30. The apparatus of claim 28, wherein the encrypting means combines the key sequence and die information to be transmitted in a block-oriented ciphe system.

Inventors: CHENNAKESHU SANDEEP, HASSAN AMER A, HERSHEY JOHN E, CHENNAKESHU, SANDEEP, HASSAN, AMER, A., HERSHEY, JOHN, E.
Applicants: ERICSSON GE MOBILE INC, ERICSSON, INC.
Application year: 1996
Main classification: H04L9
IPC codes: H04B17, H04J13, H04K1, H04L9, H04Q7