Patent US4817145A successfully refreshed from Google Patents.
US4817145A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Generator for generating binary ciphering sequences
Assignee: BBC Brown Boveri AG Switzerland
•
Filing: 1986-10-15
•
Granted: 1989-03-28
•
Expires: 2006-10-15
Abstract
Abstract A generator for generating ciphering sequences, including plural clocked subgenerators (Γ, ψ, Ψ) which, in turn, generate binary sequences at one or several outputs. To achieve high cryptographic security of the ciphering sequence (ω t ) generated by the generator, n+1, at least three subgenerator are used in an arrangement in which the clock of n of these subgenerators (ψ, Ψ) is controlled in each case by at least one of the outputs of the (n+1)th subgenerator (Γ) either directly or via function generators (Δf(t), Δf (t)) wherein the sequences (μf(t), μ f(t)) generated by the n sub generators are logically combined by at least one function, which function assumes both binary states with approximately the same frequency when its arguments pass through all possible values.
Inventors
- 👤 Christoph-Georg Gunther
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 20:44
CPC Classifications
H; H03; H03K; H03K3/00; H03K3/84; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L9/0662
Claims Analysis
Total Claims: 7
Claim 1
Independent Claim
382 words
Generator for generating binary ciphering sequences, comprising: a first random generator generated binary pseudo random sequences at at least one data output, wherein said first random generator has a clock input being connected to an external clock generator and wherein applying a clocking signal to the clock input has the effect of producing a new binary state at the at least one data output of said first random generator; function generator means being provided at the at least one data output of said first random generator and performing predetermined logic operations on said data output; a pair of further random generators generating binary pseudo random sequences at at least one data output, wherein said further random generators in each case have a clock input and wherein applying a clocking signal to the clock input has in each case the effect of producing a new binary state at the at least one data output of said further random generators; wherein the clock input of each of said further random generators is connected to the output of one of said function generator means with the effect, that said further random generators in each case produce their new binary state at random times; and at least one combining unit for logically combining the binary states being available at random times at the data outputs of said further random generators, wherein said combining unit performs a predetermined logical combining function to form at least one ciphering sequence so that both binary states are assumed with approximately the same frequency when the arguments of said combining function pass through all possible values; wherein the sequence generated by said first random generator and the sequences generated by said further random generators fulfill the following relations: (a) the period k of the sequence generated by said first random generator divides one of the two periods M, M of the sequences generated by said pair of further random generators, (b) the sums over the binary values of the sequences generated by said pair of further random generators, taken over a period k of the sequence of said first random generator are defined by F=2 e +p(M) and F=2 e +p(M) respectively, where e and e are positive integral numbers and p(M) and p(M) are arbitrary polynominals in M and M.
Claim 2
Dependent Claim
382 words
Generator for generating binary ciphering sequences, comprising: a first random generator generated binary pseudo random sequences at at least one data output, wherein said first random generator has a clock input being connected to an external clock generator and wherein applying a clocking signal to the clock input has the effect of producing a new binary state at the at least one data output of said first random generator; function generator means being provided at the at least one data output of said first random generator and performing predetermined logic operations on said data output; a pair of further random generators generating binary pseudo random sequences at at least one data output, wherein said further random generators in each case have a clock input and wherein applying a clocking signal to the clock input has in each case the effect of producing a new binary state at the at least one data output of said further random generators; wherein the clock input of each of said further random generators is connected to the output of one of said function generator means with the effect, that said further random generators in each case produce their new binary state at random times; and at least one combining unit for logically combining the binary states being available at random times at the data outputs of said further random generators, wherein said combining unit performs a predetermined logical combining function to form at least one ciphering sequence so that both binary states are assumed with approximately the same frequency when the arguments of said combining function pass through all possible values; wherein the sequence generated by said first random generator and the sequences generated by said further random generators fulfill the following relations: (a) the period k of the sequence generated by said first random generator divides one of the two periods M, M of the sequences generated by said pair of further random generators, (b) the sums over the binary values of the sequences generated by said pair of further random generators, taken over a period k of the sequence of said first random generator are defined by F=2 e +p(M) and F=2 e +p(M) respectively, where e and e are positive integral numbers and p(M) and p(M) are arbitrary polynominals in M and M.
Claim 3
Dependent Claim
35 words
Generator as claimed in claim 1, wherein said logical combining unit comprises: means for performing modulo 2 addition on at least two of the sequences available at the data output of the further random generators.
Claim 4
Dependent Claim
32 words
Generator as claimed in claims 1 or 2, wherein the periods M and M of the binary sequences generated by said pair of further random generators do not have a common divisor.
Claim 5
Dependent Claim
84 words
Generator as claimed in claim 3, wherein: one data output of the first random generator is connected immediately to the clock input of one of the pair of further random generators, and the complement of said one data output of the first random generator and the complement of at least one other data output of the first random generator are connected to function generator means for logically combining said complements as the clock input of the other of said pair of further random generators.
Claim 6
Dependent Claim
21 words
Generator as claimed in claim 4, wherein both M and F and M and F do not have a common divisor.
Claim 7
Dependent Claim
19 words
Generator as claimed in claim 1 wherein each of said further random generators comprises a linear feedback-type shift register.
References Cited (Backward Citations)
US3548174A
Cited
US3728529A
Cited
US3986168A
Cited
US4115657A
Cited
US4202051A
Cited
US4161041A
Cited
US4375620A
Cited
US4493046A
Cited
US4673871A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-03-27 | 1992-09-26 | 1993-03-28 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-03-27 | 1996-09-26 | 1997-03-28 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-03-27 | 2000-09-26 | 2001-03-28 | $7700.00 | Window Closed / Lapsed |