A new mode of encryption providing a tweakable strong pseudo-random permutation

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

Volumn 4047 LNCS, Issue , 2006, Pages 293-309

  Chakraborty, Debrup ^a   Sarkar, Palash ^a  

^a INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Mode of operation; Strong pseudo random permutation; Tweakable encryption

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SOFTWARE; INFORMATION TECHNOLOGY; RANDOM PROCESSES; SAFETY DEVICES;

MODE OF OPERATION; PERMUTATION; STRONG PSEUDO-RANDOM PERMUTATION; TWEAKABLE ENCRYPTION;

ENCODING (SYMBOLS);

EID: 33746720875     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11799313_19     Document Type: Conference Paper

References (17)

1. M. Bellare and P. Rogaway, Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for efficient cryptography, Advances in Cryptology - Asiacrypt 2000, LNCS 1976, pp. 317-330, Springer, 2000.
2. D. Chakraborty and P. Sarkar, A new mode of encryption providing a tweakable strong pseudorandom permutation, eprint.iacr.org, 2006
3. S. Halevi, EME*. Extending EME to handle arbitrary-length messages with associated data. INDOCRYPT 2004, pp. 315-327, Springer 2004
4. S. Halevi and P. Rogaway. A tweakable enciphering mode, Advances in Cryptology - CRYPTO 2003, LNCS, vol. 2729, pp. 482-499, Springer, 2003.
5. S. Halevi and P. Rogaway. A parallelizable enciphering mode, Topics in Cryptology, CT-RSA 2004, LNCS, vol. 2964, pp. 292-304, Springer, 2004
6. C. S. Jutla: Encryption modes with almost free message integrity. EUROCRYPT 2001: 529-544.
7. S. Maitra, K. C. Gupta and A. Venkateswarlu. Results on multiples of primitive polynomials and their products over GF(2), Theoretical Computer Science 341(1-3): 311-343 (2005).
8. M. Liskov, R. L. Rivest and D. Wagner. Tweakable block ciphers. CRYPTO 2002: 31-46.
9. M. Luby and C. Rackoff, How to construct pseudo-random permutations and pseudo-random functions, SIAM Journal of Computing, vol. 17, pp. 373-386, 1988.
10. D. A. McGrew and J. Viega. The Security and Performance of the Galois/Counter Mode (GCM) of Operation. Proceedings of Indocrypt 2004, 343-355.
11. M. Naor and O. Reingold. On the construction of pseudo-random permutations: Luby-Rackoff revisited, J. of Cryptology, vol 12, pp. 29-66, 1999.
12. M. Naor and O. Reingold. A pseudo-random encryption mode. Manuscript available from www.wisdom.weizmann.ac.il/haor.
13. P. Rogaway. Nonce-based symmetric encryption, Fast Software Encryption (FSE) 2004, LNCS 3017, pp. 348-359, Springer, 2004.
14. P. Rogaway, M. Bellare and J. Black. OCB: A block-cipher mode of operation for efficient authenticated encryption. ACM Conference on Computer and Communication Security 2001: 196-205.
15. D. Wagner. A generalized birthday problem. CRYPTO 2002, LNCS 2442, pp. 288-303, Springer 2002.
16. M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, vol. 22, 1981, pp. 265-279.
17. P. Wang, D. Feng and W. Wu. HCTR: A variable-input-length enciphering mode. CISC 2005, LNCS 3822, pp. 175-188, 2005.