A New Mode of Encryption Providing a Tweakable Strong Pseudo-random Permutation
暂无分享,去创建一个
[1] Charanjit S. Jutla,et al. Encryption Modes with Almost Free Message Integrity , 2001, Journal of Cryptology.
[2] Peng Wang,et al. HCTR: A Variable-Input-Length Enciphering Mode , 2005, CISC.
[3] David A. Wagner,et al. A Generalized Birthday Problem , 2002, CRYPTO.
[4] Shai Halevi,et al. EME*: Extending EME to Handle Arbitrary-Length Messages with Associated Data , 2004, INDOCRYPT.
[5] David A. Wagner,et al. Tweakable Block Ciphers , 2002, CRYPTO.
[6] Shai Halevi,et al. A Tweakable Enciphering Mode , 2003, CRYPTO.
[7] Shai Halevi,et al. A Parallelizable Enciphering Mode , 2004, CT-RSA.
[8] Ayineedi Venkateswarlu,et al. Results on multiples of primitive polynomials and their products over GF(2) , 2005, Theor. Comput. Sci..
[9] Mihir Bellare,et al. Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography , 2000, ASIACRYPT.
[10] John Viega,et al. The Security and Performance of the Galois/Counter Mode (GCM) of Operation , 2004, INDOCRYPT.
[11] Moni Naor,et al. On the construction of pseudo-random permutations: Luby-Rackoff revisited (extended abstract) , 1997, STOC '97.
[12] Phillip Rogaway,et al. Nonce-Based Symmetric Encryption , 2004, FSE.
[13] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.
[14] Larry Carter,et al. New Hash Functions and Their Use in Authentication and Set Equality , 1981, J. Comput. Syst. Sci..
[15] Mihir Bellare,et al. OCB: a block-cipher mode of operation for efficient authenticated encryption , 2001, CCS '01.