Ciphers with arbitrary finite domains

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

Volumn 2271, Issue , 2002, Pages 114-130

  Black, John ^a   Rogaway, Phillip ^b  

^a University of Nevada   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Ciphers; Modes of operation; Provable security; Symmetric eoncryption

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOCK CIPHERS; CIPHERS; FINITE DOMAINS; HIGHER-LEVEL PROTOCOLS; MESSAGE SPACE; MODES OF OPERATION; PROVABLE SECURITY; SYMMETRIC EONCRYPTION;

CRYPTOGRAPHY;

EID: 84944886613     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45760-7_9     Document Type: Conference Paper

References (14)

1. Anderson, R., and Biham, E. Two practical and provably secure block ciphers: BEAR and LION. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag, pp. 114–120.
2. Bellare, M., Kilian, J., and Rogaway, P. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences 61, 3 (2000), 362–399. Earlier version in CRYPTO’94. See www.cs.ucdavis.edu/˜rogaway.
3. Bellare, M., and Rogaway, P. On the construction of variable-input-length ciphers. In Fast Software Encryption (1999), vol. 1636 of Lecture Notes in Computer Science, Springer-Verlag. See www.cs.ucdavis.edu/˜rogaway.
4. Bellovin, S., and Merritt, M. Encrypted key exchange: password-based protocols secure against dictionary attacks. In 1992 IEEE Computer Society Symposium on Research in Security and Privacy (1992), IEEE Computer Society Press, pp. 72–84.
5. Certicom Research. Standards for efficient cryptography, SEC1: Elliptic curve cryptography, version 1, Sept. 2000. Available on-line at www.secg.org.
6. Goldreich, O., Goldwasser, S., and Micali, S. How to construct random functions. Journal of the ACM 33, 4 (1986), 210–217.
7. Goldwasser, S., Micali, S., and Rivest, R. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of Computing 17, 2 (Apr. 1988), 281–308.
8. Luby, M. Pseudorandomness and cryptographic applications. Princeton University Press, Princeton, New Jersey, 1996.
9. Luby, M., and Rackoff, C. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal of Computing 17, 2 (Apr. 1988).
10. Lucks, S. Faster Luby-Rackoff ciphers. In Fast Software Encryption (1996), vol. 1039 of Lecture Notes in Computer Science, Springer-Verlag.
11. Naor, M., and Reingold, O. On the construction of pseudorandom permutations: Luby-Rackoff revisited. Journal of Cryptology 12, 1 (1999), 29–66.
12. Patel, S., Ramzan, Z., and Sundaram, G. Towards making Luby-Rackoff ciphers optimal and practical. In Fast Software Encryption (1999), vol. 1636 of Lecture Notes in Computer Science, Springer-Verlag.
13. Schroeppel, R., and Orman, H. Introduction to the hasty pudding cipher. In Proceedings from the First Advanced Encryption Standard Candidate Conference, National Institute of Standards and Technology, Aug. 1998. See http://www.cs.arizona.edu/˜rcs/hpc/.
14. Smith, J. L. The design of Lucifer: A cryptographic device for data communications. Tech. Rep. IBM Research Report RC 3326, IBM T.J. Watson Research Center, Yorktown Heights, N.Y., 10598, U.S.A., Apr. 1971.