A tweakable enciphering mode

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

Volumn 2729, Issue , 2003, Pages 482-499

  Halevi, Shai ^a   Rogaway, Phillip ^b,c  

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

^b University of California   (United States)

^c CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BLOCK CIPHER MODES; BLOCK CIPHERS; NON-MALLEABILITY; NON-TRIVIAL; PSEUDORANDOM PERMUTATION; UNIVERSAL HASHING;

CRYPTOGRAPHY;

EID: 35248863065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45146-4_28     Document Type: Article

References (21)

1. ∼biham/.
2. M. Bellare, A. Desai, E. Jokipii, and P. Rogaway. A concrete security treatment of symmetric encryption: Analysis of the DES modes of operation. In Proceedings of 38th Annual Symposium on Foundations of Computer Science (FOCS 97), 1997.
3. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In H. Krawczyk, editor, Advances in Cryptology - CRYPTO '98, volume 1462 of Lecture Notes in Computer Science, pages 232-249. Springer-Verlag, 1998.
4. ∼rogaway.
5. ∼rogaway.
6. D. Bleichenbacher and A. Desai. A construction of a super-pseudorandom cipher. Manuscript, February 1999.
7. P. Crowley. Mercy: A fast large block cipher for disk sector encryption. In B. Schneier,-editor, Fast Software Encryption: 7th International Workshop, volume 1978 of Lecture Notes in Computer Science, pages 49-63, New York, USA, Apr. 2000. Springer-Verlag, www.ciphergoth.org/crypto/mercy.
8. D. Dolev, C. Dwork, and M. Naor. Non-malleable cryptography. SIAM Journal on Computing, 30(2):391-437, 2000. Earlier version in STOC 91.
9. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, 28:270-299, Apr. 1984.
10. ∼rogaway.
11. J. Hughes. Chair of the IEEE Security in Storage Working Group. Working group homepage at www.siswg.org. Call for algorithms can be found at www.mail-archive.eom/cryptography@wasabisystems.com/msg02102.html, May 2002.
12. A. Joux. Cryptanalysis of the EMD mode of operation. In Advances in Cryptology - EUROCRYPT '03, volume 2656 of Lecture Notes in Computer Science. Springer-Verlag, 2003.
13. ∼rogaway.
14. ∼daw/.
15. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. of Computation, 17(2), April 1988.
16. C. Meyer and S. Matyas. Cryptography: A new dimension in computer security. John Wiley and Sons, 1982.
17. ∼naor/.
18. ∼naor/.
19. P. Rogaway. The EMD mode of operation (a tweaked, wide-blocksize, strong PRP). Cryptology ePrint Archive, Report 2002/148, Oct. 2002. Early (buggy) version of the CMC algorithm. http://eprint.iacr.org/.
20. ∼rcs/hpc, 1999.
21. Y. Zheng, T. Matsumoto, and H. Imai. On the construction of block ciphers provably secure and not relying on any unproved hypotheses. In Advances in Cryptology - CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 461-480. Springer-Verlag, 1989.