Cryptography – Particular algorithmic function encoding
Patent
1996-10-22
2000-01-11
Swann, Tod R.
Cryptography
Particular algorithmic function encoding
380 42, 380 43, H04L 920, H04K 106
Patent
active
060144459
ABSTRACT:
An enciphering apparatus embodying this invention comprises chaos generation means for generating a real-valued sequence along a chaotic orbit in accordance with a predetermined number of first common keys and a predetermined nonlinear map, bit generation means for performing predetermined binarization on each real value in the generated real-valued sequence based on a predetermined number of second common keys to generate a binary sequence, and logic operation means for executing a predetermined logic operation on a binary sequence of an input plaintext and the generated keystream sequence bit by bit to generate a binary sequence of a ciphertext. For example, the first common keys are an initial seed of a nonlinear map and a value of a parameter k, and the bit generation means acquires plural pieces of binary data for each real value in the real-valued sequence using values indicated by a plurality of second keys as thresholds and obtains exclusive OR of those binary data.
REFERENCES:
patent: 4606039 (1986-08-01), Nicolas et al.
patent: 5454039 (1995-09-01), Coppersmith et al.
patent: 5696826 (1997-12-01), Gao
patent: 5703952 (1997-12-01), Taylor
patent: 5796836 (1998-08-01), Markham
patent: 5850481 (1998-12-01), Rhoads
patent: 5872864 (1999-02-01), Imade et al.
C.E. Shannon, "Communication Theory of Secrecy Systems", Bell Syst. Tech. J., 28 656-715, 1945.
H.J. Beker and F.C. Piper, "Communications Security, A Survey of Cryptography", IEE Proc., 129, Pt. A, No. 6, 357-376, Aug. 1982.
D.E.R. Denning, "Cryptography and Data Security", (Chp. 2--Encryption Algorithms and Chp. 3--Cryptographic Techniques (pp. 59-190)), Addison-Wesley Publishing, 1982.
James L. Massey, "An Introduction to Contemporary Cryptology", Proc. IEEE, 76-5, pp. 533-549, May 1988.
K. Zeng, C.H. Yang, D.Y. Wei and T.R.N. Rao, "Pseudorandom Bit Generators in Stream-Cipher Cryptography", IEEE Computer, -2, 8-17, 1991.
H. Niederreiter, "Quasi-Monte Carlo Methods and Pseudo-Random Numbers", Bull. Am. Math. Soc., 84, 957-1041, 1978.
D. Knuth, "The Art of Computer Programming", vol. 2 Seminumerical Algorithms, 2nd Ed. (Chapter 3-Random Numbers (pp. 1-160)) (Addison-Wesley, Reading, Mass, 1981).
A. Yao, "Theory and Applications of Trapdoor Functions", Proc. the 23rd Annual Sympo. Foundations of Computer Science, 80-91, 1982.
M. Blum and S. Micali, "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits", SIAM J. Comput., 13, 850-864, Nov. 1984.
L. Blum, M. Blum and M. Shub, "A Simple Unpredictable Pseudo-Random Number Generator", SIAM J. Comput., 15, 364-383, May 1986.
L. Levin, "One-Way Functions and Pseudorandom Generators", Proc. the 17th Annual ACM Sympo. on Theory of Computing, 363-365, 1985.
O. Goldreich, S. Goldwasser and S. Micali, "How to Construct Random Functions", J. ACM, 33, 792-807, Oct. 1986.
T. Habutsu, Y. Nishio, I. Sasase, and S. Mori, "A Secret Key Cryptosystem by Iterating a Chaotic Map", Proc. Eurocrypt '91, 127-140, 1991.
L.M. Pecora and T.L. Carroll, "Synchronization in Chaotic Systems", Physical Review Letters, 64, 821-824, Feb. 1990.
K.M. Cuomo and A.V. Oppenheim, "Circuit Implementation of Synchronized Chaos with Applications to Communications", Physical Review Letters, 71, 65-68, Jul. 1993.
U. Parlitz and S. Ergezinger, "Robust Communication based on Chaotic Spreading Sequences", Physics Letters A, 188, 146-150, 1994.
E. Biham, "Cryptanalysis of the Chaotic Map Cryptosystem Suggested at EUROCRYPT '91", Eurocrypt '91, 532-534, 1991.
Th. Beth, D.E. Lazic and A. Mathias, "Cryptanalysis of Cryptosystems based on Remote Chaos Replication", Proc. Crypt '94, 318-331, 1994.
S.L. Ulam and J. von Neumann, "On Combination of Stochastic and Deterministic Processes", Bull. Math. Soc., 53, p. 1120, Nov. 1947.
D.S. Ornstein, "Ergodic Theory, Randomness and `Chaos`", Science 243, pp. 182-186, 1989.
T. Kohda and A. Tsuneda, "Pseudonoise Sequence by Chaotic Nonlinear Maps and Their Correlation Properties", IEICE Trans. on Communications, E76-B, 855-862, Aug. 1993.
T. Kohda and A. Tsuneda, "Explicit Evaluations of Correlation Functions of Chebyshev Binary and Bit Sequences Based on Perron-Frobenius Operator", IEICE Trans. on Fundamentals of Electronics, Communications and Computer Sciences, E77-A, 1794-1800, Nov. 1994.
E. Atlee Jackson, "Perspectives of Nonlinear Dynamics", (Chapter 4-Models based on first order difference equations (pp. 142-225)), Cambridge Univ. Press, 1989.
A. Lasota and M.C. Mackey, "Chaos, Fractals and Noise" (Chapter 1-Introduction (pp. 1-15) and Chapter 6-The Behavior of Transformations on Intervals and Manifolds (pp. 139-188)), Springer-Verlag, 1994.
S. Oishi and H. Inoue, "Pseudo-Random Number Generators and Chaos", Trans. IEICE Japan, E65, pp. 534-541, Sep. 1982.
L.O. Chua, Y. Yao and Q. Yang, "Generating Randomness from Chaos and Constructing Chaos with Desired Randomness", Int. J. Circuit and Applications, 18, pp. 215-240, 1990.
A.R. Murch and R.H.T. Bates, "Colored Noise Generation Through Deterministic Chaos", IEEE Trans. on Circuits and Systems, 37, 5, pp. 608-613, May 1990.
G.M. Bernstein and M.A. Lieberman, "Secure Random Generation Using Chaotic Circuits", IEEE Trans. Circuits and Systems, 37-9, pp. 1157-1164, Sep. 1990.
R.L. Adler and T.J. Rivlin, "Ergodic and Mixing Properties of Chebyshev Polynomials", Proc. Amer. Math. Soc., 15, pp. 794-796, 1964.
T.J. Rivlin, "Chebyshev Polynomials--From Approximation Theory to Algebra and Number Theory", (Chapter4--Iterative Properties and Some Remarks About the Graphs of the Tn (pp. 192-216)), A Wiley-Interscience Publication, (1990).
S. Grossman and S. Thomae, "Invariant Distributions and Stationary Correlation Functions of One-Dimensional Discrete Processes", Z. Naturforsch. 32a, pp. 1353-1363, 1977.
T. Kohda and A. Tsuneda, "Auto-/Cross-Correlation Functions of Chaotic Binary/Bit Sequences", Proc. of International Conference on Dynamical Systems and Chaos, vol. 1, pp. 331-334, 1994.
T. Kohda and A. Tsuneda, "Statistics of Chaotic Binary Sequences", IEEE Trans. Information Theory, Jan. 1997 (submitted 1995).
Ross Anderson, "Fast Software Encryption", Lecture Notes in Computer Science, No. 809, (Stream Ciphers, pp. 41-63), Springer-Verlag, 1994.
M. Kac, "Statistical Independence in Probability, Analysis and Number Theory", The Carus Mathematical Monographs, No. 12, The Mathematical Association of America, 1959.
P. Billingsley, "Probability and Measure", (Chapter 1-Borel's Normal Number Theorem (pp. 1-17)), John Wiley and Sons, 1995.
C.M. Goldie and R.G.E. Pinch, Communication Theory, (Chapter 2.1--Introduction: Probability (pp. 34-37)), London Mathematical Soc. Student Texts, 20, Cambridge Univ. Press, 1991.
A. McGrail, "Randomness Properties of Two Chaotic Mappings", Cryptography and Coding III, edited by M.J. Ganley, Clarendon Press, Oxford, pp. 265-295, 1993.
A. Boyarsky and M. Scarowsky, "On A Class of Transformations Which Have Unique Absolutely Continuous Invariant Measures", Tran. Am. Math. Soc., vol. 255, pp. 243-262, Nov. 1979.
Smith, J.L., "High-Speed One-Bit Cipher Feedback Arrangement," in IBM Technical Disclosure Bulletin, vol. 26, pp. 2813-2816, Nov. 1983.
Vizirani, U.V. et al., "Efficient and Secure Pseudo-Random Number Generation," in 25th Annual IEEE Symposium on Foundations of Computer Science, pp. 458-463, Oct. 1984.
Dawson, E. in "Number Theory and Cryptography," Loxton, J.H. ed., Cambridge University Press, pp. 106-119, Mar. 1990.
Promise, J., "How Secure Is Encrypted Data?," in PC Magazine, vol. 13, No. 18, pp. 291-293, Oct. 1994.
Microsoft Press, "Computer Dictionary," 2nd Ed., p. 330, Mar. 1994.
Kohda Tohru
Tsuneda Akio
Darrow Justin T.
Kabushiki Kaisha Toshiba
Swann Tod R.
LandOfFree
Enciphering/deciphering apparatus and method incorporating rando does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Enciphering/deciphering apparatus and method incorporating rando, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Enciphering/deciphering apparatus and method incorporating rando will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1468082