← Back to Patent Explorer
US5440640A Expired / Lapsed US ⏱️ 0.0 years remaining

Multistream encryption system for secure communication

Assignee: Arithmetica Inc
•
Filing: 1993-10-05
•
Granted: 1995-08-08
•
Expires: 2013-10-05
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract MUSE, a programmable multistream encryption system for secure communication provides dynamic cryptographic security and a highly efficient surveillance mechanism for transferring very large blocks of data (VLBD) subject to real-time constraints. Encryption varies pseudorandomly in both space and time. MUSE allows the user to specify a finite state machine which sequentially accepts parallel streams of data (VLBD) and encrypts this data in real time employing an arithmetic-algebraic pseudorandom array generator (PRAG). The method of enciphering is a one-time algebraic pad system which views the incoming data streams as elements from an algebraic alphabet (finite ring) and encrypts by adding to this a pseudorandom vector sequence iteratively generated from a single seed key. Decipherment is obtained by reversing this process.

Inventors

  • 👤 Michael M. Anshel
  • 👤 Izidor C. Gertner
  • 👤 Dorian Goldfeld
  • 👤 Boris A. Klebansky

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-09 16:47
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/065; H04L9/0656; H04L2209/00; H04L2209/12; H04L2209/125

Claims Analysis

Total Claims: 16
Claim 1
Independent Claim 62 words
An apparatus for encrypting blocks of data comprising: a first finite state machine responsive to a seed key to generate a plurality of keys from said seed key: a second finite state machine responsive to said plurality of keys to generate a pseudorandom encryption array, wherein said first and second finite state machines exhibit a varying output in both time and space.
Claim 2
Independent Claim 62 words
An apparatus for encrypting blocks of data comprising: a first finite state machine responsive to a seed key to generate a plurality of keys from said seed key: a second finite state machine responsive to said plurality of keys to generate a pseudorandom encryption array, wherein said first and second finite state machines exhibit a varying output in both time and space.
Claim 3
Dependent Claim 19 words
An apparatus according to claim 1, further comprising means for combining said pseudorandom encryption array with a data array.
Claim 4
Dependent Claim 21 words
An apparatus according to claim 2, wherein said means for combining is a means for encrypting information in said data buffer.
Claim 5
Dependent Claim 21 words
An apparatus according to claim 3, wherein said means for combining is a means for decrypting information in said data buffer.
Claim 6
Independent Claim 71 words
An apparatus for encrypting blocks of data comprising: a key vector generator having a seed key input and at least one next-state output and generating a time varying key; a pseudorandom ring based array generator connected to said key vector generator; an encryption array buffer connected to said pseudorandom array generator; a data buffer; means for combining information contained in said encryption array buffer with information contained in said data buffer.
Claim 7
Independent Claim 71 words
An apparatus for encrypting blocks of data comprising: a key vector generator having a seed key input and at least one next-state output and generating a time varying key; a pseudorandom ring based array generator connected to said key vector generator; an encryption array buffer connected to said pseudorandom array generator; a data buffer; means for combining information contained in said encryption array buffer with information contained in said data buffer.
Claim 8
Dependent Claim 38 words
An apparatus according to claim 5, wherein said key vector generator and said array generator are configured to generate multiple independent pseudorandom sequences using the same quantity of non-linear operations as required to produce one independent pseudorandom sequence.
Claim 9
Dependent Claim 21 words
An apparatus according to claim 5, further comprising a statistical monitor connected to said data buffer for detecting unauthorized decryption attempts.
Claim 10
Dependent Claim 17 words
An apparatus according to claim 5, wherein said pseudorandom array generator comprises a plurality of parallel processors.
Claim 11
Dependent Claim 18 words
An apparatus according to claim 5 wherein said pseudorandom array generator is an iterative real time array generator.
Claim 12
Independent Claim 52 words
A method for encrypting blocks of data comprising the steps of: generating a plurality of pseudorandom keys from a seed key; generating one or more pseudorandom arrays varying in both time and space from each pseudorandom key; storing said arrays in an encryption buffer; combining data with information in said encryption buffer.
Claim 13
Independent Claim 52 words
A method for encrypting blocks of data comprising the steps of: generating a plurality of pseudorandom keys from a seed key; generating one or more pseudorandom arrays varying in both time and space from each pseudorandom key; storing said arrays in an encryption buffer; combining data with information in said encryption buffer.
Claim 14
Dependent Claim 17 words
A method according to claim 10, further comprising the step of: storing information in a data buffer.
Claim 15
Dependent Claim 21 words
A method according to claim 11, wherein the step of combining is an addition and operates to encrypt or decrypt data.
Claim 16
Dependent Claim 33 words
A method according to claim 11, further comprising the step of storing said arrays into a plurality of buffers and storing a plurality of data streams into a plurality of corresponding data buffers.

References Cited (Backward Citations)

US4202051A Cited
US5257282A Cited
US4747139A Cited
US4799259A Cited
US5008935A Cited
US5177790A Cited
US5159633A Cited
US5048086A Cited
US5163092A Cited
US5327365A Cited
US5267316A Cited
US5241602A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1998-08-07 1999-02-06 1999-08-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2002-08-07 2003-02-06 2003-08-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2006-08-07 2007-02-06 2007-08-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag