Cryptography – Particular algorithmic function encoding
Reexamination Certificate
2000-05-02
2008-09-23
Vu, Kim (Department: 2135)
Cryptography
Particular algorithmic function encoding
C380S037000, C713S189000
Reexamination Certificate
active
07428305
ABSTRACT:
A method for constructing keyed integer permutations over the set ZN. where N can be factored into p and q, or N can be prime. N bits are permuted by deriving a keyed permutation of representative indices. When N is factorable into p and q, the set of indices are divided into two portions. The portions undergo iterative processing called “rounds,” and in each round, a first half-round function operates on the first portion to form a first half-round value; the first half-round value and the second portion are added together by a modulo-p adder to form a first output value; a second half-round function operates on the second portion to form a second half-round value; and the second half-round value and the first portion are added together by a modulo-q adder to form a second output value. In this manner, outputs of the rounds are reordered.If N is prime and not less than 13, then N is separated into composite values s and t, and two sets are formed with s and t elements, respectively. Each set is then permuted using the method for when N is not prime. At the end of each round, the two blocks are combined using a mixing operation.
REFERENCES:
patent: 4754482 (1988-06-01), Weiss
patent: 4850019 (1989-07-01), Shimizu et al.
patent: 4969190 (1990-11-01), Takaragi et al.
patent: 5077793 (1991-12-01), Falk et al.
patent: 5511123 (1996-04-01), Adams
patent: 6038317 (2000-03-01), Magliveras et al.
patent: 6185679 (2001-02-01), Coppersmith et al.
patent: 00/51286 (2000-08-01), None
Constructing Symmetric Ciphers Using the CAST Design Procedure, Designs, Codes and Cryptography 12(3) Nov. 1997.
Dorothy Denning, Cryptography and Data Security, Addison-Wesley 1982.
Willi Meier, On the Security of the IDEA Block Cipher.
Adina Di Porto et. al. VINO: A Block Cipher Including Variable Permutations.
R. P. Chambers, Random-number Generation, IEEE Spectrum Feb. 1967.
Y. Zheng, On the Construction of Block Ciphers Provably Secure and Not Relying on Any Un proved Hypotheses.
Shannon, Communication Theory of Secrecy Systems.
“Chinese remainder theorem—Wikipedia, the free encyclopedia”, pp. 1-4, last visited May 5, 2006.
“RSA—Wikipedia, the free encyclopedia”, pp. 1-8, last visited May 5, 2006.
Y. Zheng, On the Construction of Block Ciphers Provably Secure and Not Relying on Any Un proved Hypotheses, 1989.
Shannon, Communication Theory of Secrecy Systems, 1949.
Willi Meier, On the Security of the IDEA Block Cipher, 1998.
Adina Di Porto et. al. VINO: A Block Cipher Including Variable Permutations, 1993.
B. Schneier et al., “Unbalanced Feistel Networks and Block Cipher Design,” Fast Software Encryption. International Workshop, 1996 (pp. 121-144).
Hawkes Philip
Quick, Jr. Roy Franklin
Rose Gregory G.
Kim Won Tae C.
Macek Kyong H.
Pich Ponnoreay
Rouse Thomas R.
Vu Kim
LandOfFree
Generation of keyed integer permutations for message... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Generation of keyed integer permutations for message..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generation of keyed integer permutations for message... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3979260