A software-optimized encryption algorithm

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 809 LNCS, Issue , 1994, Pages 56-63

  Rogaway, Phillip ^a   Coppersmith, Don ^b  

^a IBM   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

32-BIT PROCESSORS; COMPUTATIONAL COSTS; ELEMENTARY MACHINES; ENCRYPTION ALGORITHMS; ONE TIME PADS; PSEUDO RANDOM; PSEUDO-RANDOM FUNCTIONS;

CRYPTOGRAPHY;

EID: 84994869893     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58108-1_8     Document Type: Conference Paper

References (7)

1. E. Biham and A. Shamir, Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, 1993.
2. O. Goldreich, S. Goldwasser and S. Micali, “How to construct random functions.” Journal of the ACM, Vol. 33, No. 4, 210-217. 1986.
3. R. Merkle, “Fast software encryption functions.” Proceedings of CRYPTO ‘91, Springer-Verlag. Also U.S. patent 5,003, 597. March 1991.
4. National Bureau of Standards, “Data Encryption Standard.” Federal Information Processing Standards Publication 46. January 1977.
5. National Institute of Standards, FIPS Publication 180, “Secure Hash Standard.” May 1993.
6. RSA Data Security, Inc., Promotional materials and personal communications. Redwood City, California.
7. A. Shimizu and S. Miyaguchi, “Fast Data Encryption Algorithm FEAL.” Eurocrypt ‘87.