HCTR: A variable-input-length enciphering mode

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

Volumn 3822 LNCS, Issue , 2005, Pages 175-188

  Wang, Peng ^a   Feng, Dengguo ^a,b   Wu, Wenling ^b  

^a GRADUATE SCHOOL   (China)

^b INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Blockcipher; Disk sector encryption; Modes of operation; Symmetric encryption; Tweakable blockcipher

Indexed keywords

COMPUTER CRIME; COMPUTER PRIVACY; DATA PRIVACY; SECURITY OF DATA;

BLOCKCIPHER; MODES OF OPERATION; SYMMETRIC ENCRYPTION; TWEAKABLE BLOCKCIPHER;

CRYPTOGRAPHY;

EID: 33744898820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11599548_15     Document Type: Conference Paper

References (27)

1. M. Bellare and P. Rogaway. On the construction of variable-input-length ciphers. In L. Knudsen, editor, Fast Software Encryption 1999, volume 1636 of LNCS, pages 231-244. Springer-Verlag, 1999.
2. M. Bellare and P. Rogaway. The game-playing technique. Cryptology ePrint Archive, Report 2004/331, 2004. http://eprint.iacr.org/.
3. J. Black and P. Rogaway. A block-cipher mode of operation for parallelizable message authentication. In L. R. Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of LNCS, pages 384-397. Springer-Verlag, 2002.
4. J. L. Carter and M. N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18(2):143-154, 1979.
5. P. Crowley. Mercy: A fast large block cipher for disk sector encryption. In B. Schneier, editor, Fast Software Encryption 2000, volume 1978 of LNCS, pages 49-63. Springer-Verlag, 2001.
6. FIPS-197. Federal information processing standards publication (FIPS 197). Advanced Encryption Standard (AES), 2001. http://csrc.nist. gov/publications/fips/fips197/fips-197.pdf.
7. S. R. Fluhrer. Cryptanalysis of the Mercy block cipher. In M. Matsui, editor, Fast Software Encryption 2001, volume 2355 of LNCS, pages 28-36. Springer-Verlag, 2002.
8. S. Halevi and P. Rogaway. A tweakable enciphering mode. In D. Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 482-499. Springer-Verlag, 2003.
9. S. Halevi and P, Rogaway. A parallelizable enciphering mode, In T. Okamoto, editor, The Cryptographers' Track at RSA Conference - CT-RSA 2004, volume 2964 of LNCS. Springer-Verlag, 2004.
10. J. Kilian and P. Rogaway. How to protect DES against exhaustive key search. In N. Koblitz, editor, Advances in Cryptology - CRYPTO 1996, volume 1109 of LNCS, pages 252-267. Springer-Verlag, 1996.
11. M. Liskov, R. L. Rivest, and D. Wagner. Tweakable block ciphers. In M. Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of LNCS, pages 31-46. Springer-Verlag, 2002.
12. M. Luby and C. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373-386, 1988. Special issue on cryptography.
13. D. A. McGrew and S. R. Fluhrer. The extended codebook (XCB) mode of operation. Cryptology ePrint Archive, Report 2004/278, 2004. http:// eprint.iacr.org/.
14. D. A. McGrew and J. Viega. The security and performance of the galois/counter mode (GCM) of operation. In A. Canteaut and K. Viswanathan, editors, Advances in Cryptology - INDOCRYPT 2004, volume 3348 of LNCS, pages 343-355. Springer-Verlag, 2002.
15. D. A. McGrew and J. Viega. The ABL mode of operation, 2004. http://grouper.ieee.org/groups/1619/email/pdf00004.pdf.
16. D. A. McGrew and J. Viega. The galois/counter mode of operation (GCM), 2004. http://csrc.nist.gov/CryptoToolkit/modes/proposedmodes.
17. M. Naor and O. Reingold. A pseudo-random encryption mode, http://wisdom.weizmann.ac.il/naor/.
18. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-rackoff revisited. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing (STOC '97), pages 189-199, New York, 1997. Association for Computing Machinery.
19. P1619. IEEE Security in Storage Working Group, http://wvw.siswg.org/.
20. S. Patel, Z. Ramzan, and G. S. Sundaram. Towards making Luby-Rackoff ciphers optimal and practical. In L. Knudsen, editor, Fast software encryption 1999, volume 1636 of LNCS, pages 171-185. Springer-Verlag, 1999.
21. S. Patel, Z. Ramzan, and G. S. Sundaram. Efficient constructions of variable-input-length block ciphers. In H. Handschuh and M. A. Kasan, editors, Selected Areas in Cryptography 8004, volume 3357 of LNCS, pages 326-340. Springer-Verlag, 2005.
22. P. Rogaway. Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC. In P. J. Lee, editor, Advances in Cryptology - ASI-ACRYPT 2004, volume 3329 of LNCS, pages 16-31. Springer-Verlag, 2004.
23. P. Rogaway, M. Bellare, J. Black, and T. Krovetz. OCB: a block-cipher mode of operation for efficient authenticated encryptiona. In Proceedings of the 8th ACM Conference on Computer and Communications Security, pages 196-205, 2001.
24. R. Schroeppel. The hasty pudding cipher, http://www.cs.arizona.edu/rcs/ hpc/.
25. V. Shoup. On fast and provably secure message authentication based on universal hashing. In N. Koblitz, editor, Advances in Cryptology - CRYPTO 1996, volume 1109 of LNCS, pages 313-328. Springer-Verlag, 1996.
26. V. Shoup. Sequences of games: a tool for taming complexity in security proofs. Cryptology ePrint Archive, Report 2004/332, 2004. http://eprint.iacr.org/.
27. SP-800-38A. Recommendation for block cipher modes of operation - methods and techniques. NIST Special Publication 800-38A, 2001. http://csrc.nist.gov/publications/nistpubs/800-38a/sp800-38a.pdf.