Cryptography – Communication system using cryptography – Time segment interchange
Reexamination Certificate
2000-01-06
2004-10-12
Vu, Kim (Department: 2135)
Cryptography
Communication system using cryptography
Time segment interchange
C713S194000
Reexamination Certificate
active
06804355
ABSTRACT:
BACKGROUND
1. Field
The present invention relates generally to cryptography and, more specifically, to block ciphers.
2. Description
Cryptographic ciphers can be broadly divided into stream ciphers and block ciphers. Stream ciphers encrypt a stream of data called “plaintext” into encrypted or “ciphertext” by combining the stream of plain text with a pseudo random sequence dynamically generated using a cipher key. An example of a stream cipher is the well-known RC4 cipher. Block ciphers encrypt a block of plaintext into ciphertext by applying multiple successive rounds of transformation operations to the plaintext, using a cipher key. An example of a block cipher is the well-known Data Encryption Standard (DES) cipher.
Block ciphers typically work with a small number of fixed block sizes that are convenient for hardware or software implementation. For example, the block size may be 16, 32, 48, or 64 bits. Since the size of the ciphertext is always a multiple of the block size, a single plaintext message will require at least an entire block in order for encryption and decryption to take place. While this is not a significant problem for most applications, if the cost of storing each ciphertext bit is high, a block cipher that can vary the number of bits in its block size may be useful. Additionally, performance characteristics of a block cipher may determine where the cipher may be most useful. For example, in a communications process, it may be desirable to employ a cipher with fast setup, encryption and decryption times. However, in a manufacturing process (e.g., integrated circuit manufacturing), a different cipher may be employed when a slow setup time is acceptable, encryption and decryption times are small, but the cost of storing the ciphertext is high. Existing fixed block size ciphers may not be suitable for such situations.
SUMMARY
An embodiment of the present invention is a block cipher supporting a selectable block size of bit granularity. The block cipher includes a recursive Feistal network structure having a plurality of substitution boxes (S-boxes), each S-box being generated by a message digest function used as a pseudo-random number generator and one of a plurality of keys.
Other embodiments are described and claimed.
REFERENCES:
patent: 5835600 (1998-11-01), Rivest
patent: 5949884 (1999-09-01), Adams et al.
patent: 6628786 (2003-09-01), Dole
Savard, A Cryptographic Conpendium, 1999, pp. 1-4.*
L. Knudsen, DEAL—A 128-bit Block Cipher, submitted as an AES candidate (see http://www.nist.gov/aes), http://www/ii/uib
o/~larsr/papers/deal.ps, Aug. 20-22, 1998.
M. Luby and C. Rackoff, “How to Construct Pseudorandom Permutations from Pseudorandom Functions,” SIAM J. on Computing, vol. 17, 1988, pp. 373-386.
M. Matsui, “New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis,” Fast Software Encryption III, Feb. 1996, pp. 205-218, Springer Verlag Lecture Notes in Computer Science, vol. 1039.
P. Rogaway and D. Coppersmith, “A Software-Optimized Encryption Algorithm,” Journal of Cryptography, vol. 11, No. 4, Autumn 1998, pp. 273-287.
Intel Corporation
Klimach Paula
Skabrat Steven P.
Vu Kim
LandOfFree
Block cipher for small selectable block sizes does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Block cipher for small selectable block sizes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block cipher for small selectable block sizes will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3314340