A parallelizable enciphering mode

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

Volumn 2964, Issue , 2004, Pages 292-304

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

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

^b University of California Davis   (United States)

^c CHIANG MAI UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

BLOCK CIPHER MODES; BLOCK CIPHERS; SIMPLE MODIFICATIONS;

CRYPTOGRAPHY;

EID: 35048894821     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24660-2_23     Document Type: Article

References (21)

1. R. Anderson and E. Biham. Two practical and provably secure block ciphers: BEAR and LION. In Fast Software Encryption, Third International Workshop, volume 1039 of Lecture Notes in Computer Science, pages 113-120, 1996. www.cs.technion.ac.il/∼biham/.
2. M. Bellare, J. Kilian, and P. Rogaway. The security of the cipher block chaining message authentication code. Journal of Computer and System Sciences, 61(3):362-399, 2000. www.cs.ucdavis.edu/∼rogaway.
3. J. Black and P. Rogaway. A block-cipher mode of operation for parallelizable message authentication. In L. Knudsen, editor, Advances in Cryptology - EUROCRYPT '02, volume 2332 of Lecture Notes in Computer Science, pages 384-397. Springer-Verlag, 2002.
4. P. Crowley. Mercy: A fast large block cipher for disk sector encryption. In B. Schheier, editor, Fast Software Encryption: 7th International Workshop, volume 1978 of Lecture Notes in Computer Science, pages 49-63. Springer-Verlag, 2000. www.ciphergoth.org/crypto/mercy.
5. S. Duplichan. A primitive polynomial search program. Web document. Available at users2.evl.net/∼sduplichan/primitivepolynomials/primivitePolynomials.htm, 2003.
6. S. Halevi and P. Rogaway. A tweakable enciphering mode. In D. Boneh, editor, Advances in Cryptology - CRYPTO '03, volume 2729 of Lecture Notes in Computer Science, pages 482-499. Springer-Verlag, 2003. Full version available on the ePrint archive, http://eprint.iacr.org/2003/148/, 2003.
7. S. Halevi and P. Rogaway. A parallelizable enciphering mode. Full version available on the ePrint archive, http://eprint.iacr.org/2003/147/, 2003.
8. J. Hughes. Personal communication, 2002.
9. IEEE. Security in Storage Working Group (SISWG). Sec www.siswg.org and www.mail-archive.com/cryptography@wasabisystems.com/msg02102.html, May 2002.
10. A. Joux. Cryptanalysis of the EMD mode of operation. In Advances in Cryptology - EUROCRYPT '03, volume 2656 of Lecture Notes in Computer Science, pages 1-16. Springer-Verlag, 2003.
11. C. Jutla. Encryption modes with almost free message integrity. In Advances in Cryptography - EUROCRYPT'01, volume 2999 of Lecture Notes in Computer Science, pages 529-544. Springer-Verlag, 2001.
12. J. Kilian and P. Rogaway. How to protect DEIS against exhaustive key search. Journal of Cryptology, 14(1):17-35, 2001.
13. Earlier version in CRYPTO '96. www.cs.ucdavis.edu/∼rogaway.
14. M. Liskov, R. Rivest, and D. Wagner. Tweakable block ciphers. In Advances in Cryptology - CRYPTO '02, volume 2442 of Lecture Notes in Computer Science, pages 31-46. Springer-Verlag, 2002. www.cs.berkeley.edu/∼daw/.
15. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM J. of Computation, 17(2), April 1988.
16. M. Naor and O. Reingold. A pseudo-random encryption mode. Manuscript, available from www.wisdom.weizmann.ac.il/∼naor/.
17. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited. Journal of Cryptology, 12(1):29-66, 1999.
18. (Earlier version in STOC '97.) Available from www.wisdom.weizmann.ac.il/∼naor/.
19. P. Rogaway, M. Bellare, J. Black, and T. Krovetz. OCB: A block-cipher mode of operation for efficient authenticated encryption. In Eighth ACM Conference on Computer and Communications Security (CCS-8), pages 196-205. ACM Press, 2001.
20. R. Schroeppel. The hasty pudding cipher. AES candidate submitted to NIST. www.cs.arizona.edu/∼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.