US6285873B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for generating a broadcast challenge value
Assignee: Qualcomm Inc
•
Filing: 1998-03-09
•
Granted: 2001-09-04
•
Expires: 2018-03-09
Abstract
Abstract A method for generating a broadcast challenge value includes the steps of applying a first updating algorithm to the most significant bits of the broadcast challenge value, and applying a second, distinct updating algorithm to the least significant bits of the broadcast challenge value. The updating algorithms can be maximal-length shift registers or other forms of pseudorandom noise generator. The sequence of successive unrepeated values can be extended for either one or both sets of bits by inserting an all-zeroes value once during the period of time before which an update value recurs. System-wide synchronization can be achieved via a global time reference.
Inventors
- 👤 Roy F. Quick, Jr.
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-07 11:05
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/32; H04L9/3271; G; G04; G04R; G04R20/00; G04R20/02; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662; H04W; H04W12/00; H04W12/06; H04W12/062; H04L2209/00; H04L2209/80
Claims Analysis
Total Claims: 64
Claim 1
Independent Claim
65 words
A method of updating a broadcast challenge value transmitted by a cellular base station on a control channel, comprising the steps of: applying a first updating algorithm to a plurality of most significant bits of the broadcast challenge value; and operating on a plurality of least significant bits of the broadcast challenge value with a second updating algorithm to generate an updated broadcast challenge value.
Claim 2
Independent Claim
65 words
A method of updating a broadcast challenge value transmitted by a cellular base station on a control channel, comprising the steps of: applying a first updating algorithm to a plurality of most significant bits of the broadcast challenge value; and operating on a plurality of least significant bits of the broadcast challenge value with a second updating algorithm to generate an updated broadcast challenge value.
Claim 3
Dependent Claim
18 words
The method of claim 1 , wherein the applying step comprises applying a first maximal-length shift register algorithm.
Claim 4
Dependent Claim
18 words
The method of claim 1 , wherein the applying step comprises applying a first pseudorandom noise generation algorithm.
Claim 5
Dependent Claim
26 words
The method of claim 1 , wherein the operating step comprises operating on the plurality of least significant bits with a second maximal-length shift register algorithm.
Claim 6
Dependent Claim
26 words
The method of claim 1 , wherein the operating step comprises operating on the plurality of least significant bits with a second pseudorandom noise generation algorithm.
Claim 7
Dependent Claim
55 words
The method of claim 1 , wherein the applying step comprises applying a first updating algorithm that inserts an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 8
Dependent Claim
63 words
The method of claim 1 , wherein the operating step comprises operating on the plurality of least significant bits with a second updating algorithm that inserts an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 9
Dependent Claim
33 words
The method of claim 1 , wherein the applying step comprises applying a first updating algorithm that ensures that every update value for the plurality of most significant bits is a nonzero value.
Claim 10
Dependent Claim
41 words
The method of claim 1 , wherein the operating step comprises operating on the plurality of least significant bits with a second updating algorithm that ensures that every update value for the plurality of least significant bits is a nonzero value.
Claim 11
Dependent Claim
103 words
In a cellular system, a method of synchronously updating binary numbers used by a plurality of base stations to authenticate a plurality of mobile subscriber units, the method comprising the steps of: applying a first updating algorithm to a plurality of most significant bits of the binary number for each of the plurality of base stations; operating on a plurality of least significant bits of the binary number for each of the plurality of base stations with a second updating algorithm; and synchronizing across the plurality of base stations update values of the binary numbers that result from the applying and operating steps.
Claim 12
Dependent Claim
103 words
In a cellular system, a method of synchronously updating binary numbers used by a plurality of base stations to authenticate a plurality of mobile subscriber units, the method comprising the steps of: applying a first updating algorithm to a plurality of most significant bits of the binary number for each of the plurality of base stations; operating on a plurality of least significant bits of the binary number for each of the plurality of base stations with a second updating algorithm; and synchronizing across the plurality of base stations update values of the binary numbers that result from the applying and operating steps.
Claim 13
Dependent Claim
24 words
The method of claim 10 , wherein the synchronizing step is accomplished with a system-wide time reference available to the plurality of base stations.
Claim 14
Dependent Claim
14 words
The method of claim 11 , wherein the system-wide time reference is GPS time.
Claim 15
Dependent Claim
18 words
The method of claim 11 , wherein the applying step comprises applying a first maximal-length shift register algorithm.
Claim 16
Dependent Claim
18 words
The method of claim 11 , wherein the applying step comprises applying a first pseudorandom noise generation algorithm.
Claim 17
Dependent Claim
26 words
The method of claim 11 , wherein the operating step comprises operating on the plurality of least significant bits with a second maximal-length shift register algorithm.
Claim 18
Dependent Claim
26 words
The method of claim 11 , wherein the operating step comprises operating on the plurality of least significant bits with a second pseudorandom noise generation algorithm.
Claim 19
Dependent Claim
55 words
The method of claim 11 , wherein the applying step comprises applying a first updating algorithm that inserts an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 20
Dependent Claim
63 words
The method of claim 11 , wherein the operating step comprises operating on the plurality of least significant bits with a second updating algorithm that inserts an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 21
Dependent Claim
33 words
The method of claim 11 , wherein the applying step comprises applying a first updating algorithm that ensures that every update value for the plurality of most significant bits is a nonzero value.
Claim 22
Dependent Claim
41 words
The method of claim 11 , wherein the operating step comprises operating on the plurality of least significant bits with a second updating algorithm that ensures that every update value for the plurality of least significant bits is a nonzero value.
Claim 23
Dependent Claim
64 words
A cellular base station, comprising: an integrated circuit capable of running software; and a set of software instructions executed by the integrated circuit for applying a first updating algorithm to a plurality of most significant bits of a binary number and for applying a second updating algorithm to a plurality of least significant bits of the binary number to generate an updated binary number.
Claim 24
Dependent Claim
64 words
A cellular base station, comprising: an integrated circuit capable of running software; and a set of software instructions executed by the integrated circuit for applying a first updating algorithm to a plurality of most significant bits of a binary number and for applying a second updating algorithm to a plurality of least significant bits of the binary number to generate an updated binary number.
Claim 25
Dependent Claim
20 words
The base station of claim 21 , wherein the first updating algorithm comprises a first simulated maximal-length shift register algorithm.
Claim 26
Dependent Claim
19 words
The base station of claim 21 , wherein the first updating algorithm comprises a first pseudorandom noise generation algorithm.
Claim 27
Dependent Claim
20 words
The base station of claim 21 , wherein the second updating algorithm comprises a second simulated maximal-length shift register algorithm.
Claim 28
Dependent Claim
19 words
The base station of claim 21 , wherein the second updating algorithm comprises a second pseudorandom noise generation algorithm.
Claim 29
Dependent Claim
50 words
The base station of claim 21 , wherein the first updating algorithm inserts an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 30
Dependent Claim
50 words
The base station of claim 21 , wherein the second updating algorithm inserts an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 31
Dependent Claim
28 words
The base station of claim 21 , wherein the first updating algorithm ensures that every update value for the plurality of most significant bits is a nonzero value.
Claim 32
Dependent Claim
28 words
The base station of claim 21 , wherein the second updating algorithm ensures that every update value for the plurality of least significant bits is a nonzero value.
Claim 33
Dependent Claim
131 words
A cellular system, comprising: a system-wide time reference signal; a plurality of mobile subscriber units; and a plurality of base stations configured for wireless communication with the plurality of mobile subscriber units, each of the plurality of base stations comprising: an integrated circuit capable of running software; and a set of software instructions executed by the integrated circuit for applying a first updating algorithm to a plurality of most significant bits of a binary number and for applying a second updating algorithm to a plurality of least significant bits of the binary number, the binary number serving to authenticate any mobile subscriber unit requesting communication with a base station, and for synchronizing successive update values of the binary numbers with the system-wide time reference signal across the plurality of base stations.
Claim 34
Dependent Claim
131 words
A cellular system, comprising: a system-wide time reference signal; a plurality of mobile subscriber units; and a plurality of base stations configured for wireless communication with the plurality of mobile subscriber units, each of the plurality of base stations comprising: an integrated circuit capable of running software; and a set of software instructions executed by the integrated circuit for applying a first updating algorithm to a plurality of most significant bits of a binary number and for applying a second updating algorithm to a plurality of least significant bits of the binary number, the binary number serving to authenticate any mobile subscriber unit requesting communication with a base station, and for synchronizing successive update values of the binary numbers with the system-wide time reference signal across the plurality of base stations.
Claim 35
Dependent Claim
27 words
The cellular system of claim 30 , wherein the system-wide time reference signal conveys to each of the plurality of base stations a measure of GPS time.
Claim 36
Dependent Claim
20 words
The cellular system of claim 30 , wherein the first updating algorithm comprises a first simulated maximal-length shift register algorithm.
Claim 37
Dependent Claim
19 words
The cellular system of claim 30 , wherein the first updating algorithm comprises a first pseudorandom noise generation algorithm.
Claim 38
Dependent Claim
20 words
The cellular system of claim 30 , wherein the second updating algorithm comprises a second simulated maximal-length shift register algorithm.
Claim 39
Dependent Claim
19 words
The cellular system of claim 30 , wherein the second updating algorithm comprises a second pseudorandom noise generation algorithm.
Claim 40
Dependent Claim
50 words
The cellular system of claim 30 , wherein the first updating algorithm inserts an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 41
Dependent Claim
50 words
The cellular system of claim 30 , wherein the second updating algorithm inserts an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 42
Dependent Claim
28 words
The cellular system of claim 30 , wherein the first updating algorithm ensures that every update value for the plurality of most significant bits is a nonzero value.
Claim 43
Dependent Claim
28 words
The cellular system of claim 30 , wherein the second updating algorithm ensures that every update value for the plurality of least significant bits is a nonzero value.
Claim 44
Dependent Claim
41 words
A base station, comprising: first means for updating a plurality of most significant bits of a broadcast challenge value; and second means for updating a plurality of least significant bits of the broadcast challenge value to generate an updated binary number.
Claim 45
Dependent Claim
41 words
A base station, comprising: first means for updating a plurality of most significant bits of a broadcast challenge value; and second means for updating a plurality of least significant bits of the broadcast challenge value to generate an updated binary number.
Claim 46
Dependent Claim
20 words
The base station of claim 40 , wherein the first means for updating comprises a first simulated maximal-length shift register.
Claim 47
Dependent Claim
19 words
The base station of claim 40 , wherein the first means for updating comprises a first pseudorandom noise generator.
Claim 48
Dependent Claim
20 words
The base station of claim 40 , wherein the second means for updating comprises a second simulated maximal-length shift register.
Claim 49
Dependent Claim
19 words
The base station of claim 40 , wherein the second means for updating comprises a second pseudorandom noise generator.
Claim 50
Dependent Claim
52 words
The base station of claim 40 , wherein the first means for updating comprises inserting an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 51
Dependent Claim
52 words
The base station of claim 40 , wherein the second means for updating comprises inserting an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 52
Dependent Claim
30 words
The base station of claim 40 , wherein the first means for updating comprises ensuring that every update value for the plurality of most significant bits is a nonzero value.
Claim 53
Dependent Claim
30 words
The base station of claim 40 , wherein the second means for updating comprises ensuring that every update value for the plurality of least significant bits is a nonzero value.
Claim 54
Dependent Claim
110 words
A cellular system, comprising: means for establishing system-wide time synchronization; a plurality of mobile subscriber units; and a plurality of base stations configured for wireless communication with the plurality of mobile subscriber units, each of the plurality of base stations comprising: first means for updating a plurality of most significant bits of a binary number, the binary number serving to authenticate any mobile subscriber unit requesting communication with a base station; second means for updating a plurality of least significant bits of the binary number; and means for synchronizing successive update values of the binary numbers across the plurality of base stations with the means for establishing system-wide time synchronization.
Claim 55
Dependent Claim
110 words
A cellular system, comprising: means for establishing system-wide time synchronization; a plurality of mobile subscriber units; and a plurality of base stations configured for wireless communication with the plurality of mobile subscriber units, each of the plurality of base stations comprising: first means for updating a plurality of most significant bits of a binary number, the binary number serving to authenticate any mobile subscriber unit requesting communication with a base station; second means for updating a plurality of least significant bits of the binary number; and means for synchronizing successive update values of the binary numbers across the plurality of base stations with the means for establishing system-wide time synchronization.
Claim 56
Dependent Claim
29 words
The cellular system of claim 49 , wherein the means for establishing system-wide time synchronization conveys to each of the plurality of base stations a measure of GPS time.
Claim 57
Dependent Claim
20 words
The cellular system of claim 49 , wherein the first means for updating comprises a first simulated maximal-length shift register.
Claim 58
Dependent Claim
19 words
The cellular system of claim 49 , wherein the first means for updating comprises a first pseudorandom noise generator.
Claim 59
Dependent Claim
20 words
The cellular system of claim 49 , wherein the second means for updating comprises a second simulated maximal-length shift register.
Claim 60
Dependent Claim
19 words
The cellular system of claim 49 , wherein the second means for updating comprises a second pseudorandom noise generator.
Claim 61
Dependent Claim
51 words
The cellular system of claim 49 , wherein the first means for updating inserts an all-zeroes value as an update for the plurality of most significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of most significant bits.
Claim 62
Dependent Claim
51 words
The cellular system of claim 49 , wherein the second means for updating inserts an all-zeroes value as an update for the plurality of least significant bits once during the period of time necessary for the sequence of updates to produce a repeat value for the plurality of least significant bits.
Claim 63
Dependent Claim
29 words
The cellular system of claim 49 , wherein the first means for updating ensures that every update value for the plurality of most significant bits is a nonzero value.
Claim 64
Dependent Claim
29 words
The cellular system of claim 49 , wherein the second means for updating ensures that every update value for the plurality of least significant bits is a nonzero value.
References Cited (Backward Citations)
US4845491A
Cited
US5450071A
Cited
US5537097A
Cited
US5301225A
Cited
US5392287A
Cited
US5228054A
Cited
US5377183A
Cited
US5347580A
Cited
US5392452A
Cited
US5382949A
Cited
US5363448A
Cited
US5398021A
Cited
US5778316A
Cited
US5481254A
Cited
US5506796A
Cited
US5491718A
Cited
US5878339A
Cited
US5511067A
Cited
US5485463A
Cited
US5511110A
Cited
US5544223A
Cited
US5717830A
Cited
US6035039A
Cited
US6112083A
Cited
US5943425A
Cited
US5943615A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-09-03 | 2005-03-05 | 2005-09-04 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-09-03 | 2009-03-05 | 2009-09-04 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-09-03 | 2013-03-05 | 2013-09-04 | $7700.00 | Window Closed / Lapsed |