CRYPTOGRAPHIC SYSTEM INCLUDING A MIXED RADIX NUMBER GENERATOR WITH CHOSEN STATISTICAL ARTIFACTS
First Claim
1. A cryptographic system, comprising:
- a data stream receiving means configured for receiving an input data stream;
a number generator configured for generating a first sequence of numbers contained within a Galois field GF[M];
a mixed radix accumulator electronically connected to said number generator and configured for (1) performing a first modification to a first number in said first sequence of numbers comprising summing said first number with a result of a first modulo P operation performed on a second number of said first sequence that proceeds said first number, where M is relatively prime with respect to P, (2) subsequent to said first modification, performing a second modification to said first number comprising a second modulo P operation, and (3) repeating said first and second modification for a plurality of numbers comprising said first sequence of numbers to generate a second sequence of numbers; and
an encryptor electronically connected to said data stream receiving means and said mixed radix accumulator, said encryptor configured for generating a modified data stream by incorporating or combining said second sequence of numbers with said input data stream.
1 Assignment
0 Petitions
Accused Products
Abstract
A cryptographic system (1000) is provided. The cryptographic system includes a data stream receiving means (DSRM), a number generator (NG), a mixed radix accumulator (MRA) and an encryptor. The DSRM (1002) receives a data stream (DS). The NG (702) generates a first number sequence (FNS) contained within a Galois Field GF[M]. The MRA (750) is configured to perform a first modification to a first number (FN) in FNS. The first modification involves summing the FN with a result of a modulo P operation performed on a second number in FNS that proceeds FN. The MRA is also configured to perform a second modification to FN utilizing a modulo P operation. The MRA is further configured to repeat the first and second modification for numbers in FNS to generate a second number sequence (SNS). The encryptor (1004) is configured to generate a modified data stream by combining SNS and DS.
-
Citations
25 Claims
-
1. A cryptographic system, comprising:
-
a data stream receiving means configured for receiving an input data stream; a number generator configured for generating a first sequence of numbers contained within a Galois field GF[M]; a mixed radix accumulator electronically connected to said number generator and configured for (1) performing a first modification to a first number in said first sequence of numbers comprising summing said first number with a result of a first modulo P operation performed on a second number of said first sequence that proceeds said first number, where M is relatively prime with respect to P, (2) subsequent to said first modification, performing a second modification to said first number comprising a second modulo P operation, and (3) repeating said first and second modification for a plurality of numbers comprising said first sequence of numbers to generate a second sequence of numbers; and an encryptor electronically connected to said data stream receiving means and said mixed radix accumulator, said encryptor configured for generating a modified data stream by incorporating or combining said second sequence of numbers with said input data stream. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16)
-
-
17. A cryptographic system, comprising:
-
a data stream source configured for generating an input data stream of a dynamic range M including a first sequence of numbers with a known non-uniform probability distribution; a mixed radix accumulator electronically connected to said data stream source and configured for (1) performing a first modification to a first number in said first sequence of numbers comprising summing said first number with a result of a modulo P operation performed on a second number of said first sequence that proceeds said first number, where M is relatively prime with respect to P, (2) subsequent to said first modification, performing a second modification to said first number comprising a modulo P operation, and (3) repeating said first and second modification for a plurality of numbers comprising said first sequence of numbers to generate a second sequence of numbers. - View Dependent Claims (18, 19, 20, 21)
-
-
22. A method for encrypting and decrypting an input data stream, comprising the steps of:
-
receiving an input data stream; generating a first sequence of numbers contained within a Galois field GF[M]; performing a first modification to a first number in said first sequence of numbers comprising summing said first number with a result of a first modulo P operation performed on a second number of said first sequence that proceeds said first number, where M is relatively prime with respect to P; performing a second modification subsequent to said first modification to said first number comprising a second modulo P operation; repeating said first and second modification for a plurality of numbers comprising said first sequence of numbers to generate a second sequence of numbers; and generating a modified data stream by combining said second sequence of numbers with said input data stream. - View Dependent Claims (23, 24, 25)
-
Specification