Patent US3796830A successfully refreshed from Google Patents.
← Back to Patent Explorer
US3796830A Expired / Lapsed US ⏱️ 0.0 years remaining

Recirculating block cipher cryptographic system

Assignee: International Business Machines Corp
•
Filing: 1971-11-02
•
Granted: 1974-03-12
•
Expires: 1991-11-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract This is a cryptographic system for enciphering a block of binary data under the control of a subscriber cipher key consisting of a preassigned combination of binary symbols. The block of data is processed on a segmented basis with each segment of data being serially transformed in accordance with control signals determined from the binary values of key segments. The system is utilized within a data processing environment to provide complete privacy of data that is stored, or transmitted within a computer network. The ciphered message is developed by passing the clear message through a series of nonlinear transformations, each transformation being a function of the binary values that appear in the subscriber key.

Inventors

  • 👤 J Smith

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-23 23:51
CPC Classifications
H; H04; H04L; H04L9/00; H04L9/06; H04L9/0618; H04L2209/00; H04L2209/12; H04L2209/125; H04L2209/24

Claims Analysis

Total Claims: 11
Claim 1
Independent Claim 188 words
A cryptographic system for enciphering or deciphering a block message consisting of, n, binary digits, under the control of a block cipher key consisting of, k, binary digits, the constituent digits of said message being grouped into segments having, p, binary digits, said system comprising: means for loading a first group of message segments into a first store means and a second group of message segments into a second store means; said first and second store means being formed from a plurality of storage cells; means connected to the output of said first store means for generating a plurality of transformed signals, T, that are a function of said first group of message segments and selected binary digits of said cipher key; a plurality of logic means interposed between the storage cells of said second store means for combining signals of said second message segments with said transformed signals, T, by a reversible mathematical operation; said logic means being made selectively operative by the binary values of selected key digits, K, which in combination with a control signal gate the, T, signals to said plurality of logic means.
Claim 2
Dependent Claim 188 words
A cryptographic system for enciphering or deciphering a block message consisting of, n, binary digits, under the control of a block cipher key consisting of, k, binary digits, the constituent digits of said message being grouped into segments having, p, binary digits, said system comprising: means for loading a first group of message segments into a first store means and a second group of message segments into a second store means; said first and second store means being formed from a plurality of storage cells; means connected to the output of said first store means for generating a plurality of transformed signals, T, that are a function of said first group of message segments and selected binary digits of said cipher key; a plurality of logic means interposed between the storage cells of said second store means for combining signals of said second message segments with said transformed signals, T, by a reversible mathematical operation; said logic means being made selectively operative by the binary values of selected key digits, K, which in combination with a control signal gate the, T, signals to said plurality of logic means.
Claim 3
Dependent Claim 31 words
The system as defined in claim 1 wherein said means for generating transformed signals, T, comprises: nonlinear transformation means for effecting a keyed substitution of said first group of message segments.
Claim 4
Dependent Claim 55 words
The system as defined in claim 2 further comprising: third store means for maintainig said cipher key and presenting selected key digits on a plurality of, K, output lines; selection means for causing said third store means to present identified key segments on said, K, output lines in accordance with a key digit accessing schedule.
Claim 5
Dependent Claim 37 words
The system as defined in claim 3 further comprising adder means for performing a modulo addition on information contained in said first and third store means and providing the sum, Sigma , to said nonlinear transformation means
Claim 6
Dependent Claim 22 words
The system as defined in claim 4 further comprising interchange means for interchanging the contents of said first and second store means.
Claim 7
Dependent Claim 41 words
The system as defined in claim 5 wherein each of said logic means comprises an exclusive-or gate for performing a modulo-2 addition of said, T, signals and the binary signal values contained in the store cells connected to said exclusive-or gate.
Claim 8
Dependent Claim 83 words
The system as defined in claim 6 wherein said second store means comprises: a plurality of recirculating shift registers, each register having associated therewith a set of logic means interposed between storage cells within the register; said logic means being selectively made operative by the binary values of selected digits of said cipher key so that at least one of said exclusive-or gates in each of said sets of logic means is operative when said shift registers are caused to shift their contents.
Claim 9
Dependent Claim 56 words
The system as defined in claim 7 further comprising counter means for counting the number of shift cycles performed by said recirculating shift registers so to enable the determination of when said interchange means is to be made operative and for enabling determination as to when said cryptographic system has completed an encipher or decipher operation.
Claim 10
Dependent Claim 193 words
An automatic process for enciphering or deciphering a block message consisting of, n, binary digits, under the control of a block cipher key consisting of, k, binary digits, said binary message digits being grouped into, p, digit segments, said process comprising the steps of: loading a first group of message segments into a first storage location and a second group of message segments into a second storage location; generating a plurality of transformed signals, T, as a nonlinear function of said first Group of message segments and the binary values of selected digits of said cipher key; permuting said, T, signals as a function of the binary value of selected digits of said cipher key, K,; combining the permuted, T, signals with a control signal for selectively controlling a reversible mathematical operation performed on message segments contained in said second storage location; interchanging the contents of said first storage location with the contents of said second storage location; repeating the above steps for a specified number of rounds; whereby the final transformed message that appears in said first and second storage locations is a complex function of key and message binary signal values.
Claim 11
Dependent Claim 193 words
An automatic process for enciphering or deciphering a block message consisting of, n, binary digits, under the control of a block cipher key consisting of, k, binary digits, said binary message digits being grouped into, p, digit segments, said process comprising the steps of: loading a first group of message segments into a first storage location and a second group of message segments into a second storage location; generating a plurality of transformed signals, T, as a nonlinear function of said first Group of message segments and the binary values of selected digits of said cipher key; permuting said, T, signals as a function of the binary value of selected digits of said cipher key, K,; combining the permuted, T, signals with a control signal for selectively controlling a reversible mathematical operation performed on message segments contained in said second storage location; interchanging the contents of said first storage location with the contents of said second storage location; repeating the above steps for a specified number of rounds; whereby the final transformed message that appears in said first and second storage locations is a complex function of key and message binary signal values.

References Cited (Backward Citations)

US3038028A Cited
US3170033A Cited
US3250855A Cited
US3657699A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1977-03-11 1977-09-10 1978-03-12 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1981-03-11 1981-09-10 1982-03-12 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1985-03-11 1985-09-10 1986-03-12 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag