Dynamic substitution combiner and extractor

• US 4,979,832 A
• Filed: 11/01/1989
• Issued: 12/25/1990
• Est. Priority Date: 11/01/1989
• Status: Expired due to Term

• Current Assignee: Terry F. Ritter
• Original Assignee: Terry F. Ritter
• Inventors: Ritter, Terry F.
• Primary Examiner(s): Tarcza, Thomas H.
• Assistant Examiner(s): CAIN, DAVID C
• Application Number:
  US07/431,016
• Time in Patent Office: 419 Days
• Field of Search: 380/42, 380/28, 380/56, 380/57, 380/58, 380/46, 380/49
• US Class Current: 380/28
• CPC Class Codes: H04L 9/002 Countermeasures against attacks on cryptographic mechanisms network architectures or network communication protocols for protection against malicious traffic H04L63/1441
• CPC Class Codes: H04L 9/0656 Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher

Abstract

A first data source and a second data source are combined into a complex intermediate form or result; the first data source can be extracted from the intermediate form using the second data source. The combining mechanism can provide an alternative to the exclusive-OR combiner commonly used in stream ciphers.

Each data value from the first data source is transformed by substitution using one of potentially multiple translation tables (12). The translations within each table can be changed after each substitution operation using a changes controller (18). Commonly, the just-used table is re-arranged or permuted; permutation retains invertibility, so that the ciphertext may be deciphered. As a particular design, the just-used substitution element may be exchanged with some element within the same table, as selected by the second data source, after every translation.

The combiner substitution tables (12) can easily be forced to be invertible, and when they are, extraction is possible by substitution through inverse tables (24). Valid inverse tables can be maintained provided that the same second data is used by both mechanisms. This is the normal situation in stream ciphers.

The combiner can also be used to combine two pseudo-random confusion streams into a more-complex confusion stream. In this case, exctraction may be unnecessary and so the combiner substitution tables need not be invertible. Thus, the translation changes need not be limited to permutations.

Claims

1. A mechanism for combining a first data source and a second data source into result data, including:

(a) substitution means for translating values from said first data source into said result data or substitute values, and

(b) change means, at least responsive to some aspect of said second data source, for permuting or re-arranging a plurality of the translations or substitute values within said substitution means, potentially after every substitution operation.

2. The combining mechanism of claim 1 wherein said substitution means is initialized to contain at most one occurrence of any particular translation.

3. The combining mechanism of claim 1 wherein the translations in said substitution means are held in a plurality of translation tables or lists.

4. The combining mechanism of claim 3 wherein each translations table in said substitution means is initialized to contain at most one occurrence of any particular translation.

5. The combining mechanism of claim 3 wherein some aspect of said second data source is used to select a particular translation table to be used for substitution and permutation.

6. The combining mechanism of claim 3 wherein every just-used translation in a translation table is exchanged with some translation in the same table.

7. The combining mechanism of claim 1 wherein those translations in said substitution means which are permuted by said change means include each translation which has been selected by said first data source subsequent to a previous permutation of that translation.

8. The combining mechanism of claim 1 wherein every just-used translation in said substitution means is exchanged with some translation in said substitution means.

9. A mechanism for extracting original data from a first data source using a second data source, including:

(a) first substitution means for inverse translating values from said first data source into said original data or resulting data values,

(b) second substitution means for translating values from said second data source into translated second data source values,

(c) second change means, at least responsive to some aspect of said resulting data values, for permuting or re-arranging a plurality of the translations within said second substitution means, and

(d) first change means, at least responsive to some aspect of said translated second data values, for permuting or re-arranging a plurality of the translations within said first substitution means.

10. The extracting mechanism of claim 9 wherein the translations in said first substitution means and said second substitution means are held in a plurality of translation tables.

11. The extracting mechanism of claim 10 wherein some aspect of said second data source is used to select the translation tables used for substitution and

12. The extracting mechanism of claim 10 wherein every just-used translation in a table is exchanged with some translation in the same table.

13. The extracting mechanism of claim 9 wherein said resulting data and said second data source are used to select two elements in said second substitution means, and said second change means acts to exchange the values of the selected elements.

14. The extracting mechanism of claim 9 wherein said first data source and said translated second data source are used to select two elements in said first substitution means, and said first change means acts to exchange the values of the selected elements.

15. A two-input one-circuit logic mechanism or design, which combines a first input value with a second input value, including:

(a) substitution means, potentially including a plurality of storage means, for saving substitute values and translating said first input value into an output value, and

(b) change means, at least responsive to some aspect of said second input value, for redefining a plurality and proper subset of the substitute values within said storage means, potentially after every substitution operation.

16. The logic mechanism of claim 15 wherein each storage means in said substitution means is initialized to contain at most one occurrence of each substitute value.

17. The logic mechanism of claim 15 wherein said change means alters substitute values in said substitution means only by permutation or re-arrangement within individual storage means.

18. The logic mechanism of claim 15 wherein said change means alters substitute values in said substitution mans by the exchange of substitute values.

19. The logic mechanism of claim 15, further including:

(c) another instance of the logic mechanism of claim 15,

wherein the two instances of the mechanism together extract a result data value from a first data value using a second data value, by placing said first data value on said first input value input of the first mechanism, and using said output value from the first mechanism as said result data value, and connecting said result data value to said second input value input of the second mechanism, and placing said second data value on said first input value input of the second mechanism, and connecting said output value of the second mechanism to said second input value of the first mechanism.