-
1
-
-
85025594757
-
-
http://csrc.nist.gov/CryptoToolkit/modes/.
-
-
-
-
2
-
-
33746720875
-
A new mode of operation providing a tweakable strong pseudorandom permutation
-
volume, of Lecture Notes in Computer Science, pages,. Springer
-
Debrup Chakraborty and Palash Sarkar. A new mode of operation providing a tweakable strong pseudorandom permutation. In Fast Software Encryption, volume 4047 of Lecture Notes in Computer Science, pages 293–309. Springer, 2006.
-
(2006)
Fast Software Encryption
, vol.4047
, pp. 293-309
-
-
Chakraborty, D.1
Sarkar, P.2
-
3
-
-
33646717921
-
Extending EME to handle arbitrary-length messages with associated data
-
volume, of Lecture Notes in Computer Science, pages,. Springer
-
Shai Halevi.: Extending EME to handle arbitrary-length messages with associated data. In Anne Canteaut and Kapalee Viswanathan, editors, IN-DOCRYPT, volume 3348 of Lecture Notes in Computer Science, pages 315–327. Springer, 2004.
-
(2004)
Anne Canteaut and Kapalee Viswanathan, Editors, IN-DOCRYPT
, vol.3348
, pp. 315-327
-
-
Halevi, S.1
-
4
-
-
35248863065
-
A tweakable enciphering mode
-
Dan Boneh, editor,, volume, of Lecture Notes in Computer Science, pages,. Springer
-
Shai Halevi and Phillip Rogaway. A tweakable enciphering mode. In Dan Boneh, editor, CRYPTO, volume 2729 of Lecture Notes in Computer Science, pages 482– 499. Springer, 2003.
-
(2003)
CRYPTO
, vol.2729
-
-
Halevi, S.1
Rogaway, P.2
-
5
-
-
35048894821
-
A parallelizable enciphering mode
-
Tatsuaki Okamoto, editor, volume, of Lecture Notes in Computer Science, pages,. Springer
-
Shai Halevi and Phillip Rogaway. A parallelizable enciphering mode. In Tatsuaki Okamoto, editor, CT-RSA, volume 2964 of Lecture Notes in Computer Science, pages 292–304. Springer, 2004.
-
(2004)
CT-RSA
, vol.2964
, pp. 292-304
-
-
Halevi, S.1
Rogaway, P.2
-
6
-
-
84937407660
-
Tweakable block ciphers
-
Moti Yung, editor, volume, of Lecture Notes in Computer Science, pages,. Springer
-
Moses Liskov, Ronald L. Rivest, and David Wagner. Tweakable block ciphers. In Moti Yung, editor, CRYPTO, volume 2442 of Lecture Notes in Computer Science, pages 31–46. Springer, 2002.
-
(2002)
CRYPTO
, vol.2442
, pp. 31-46
-
-
Liskov, M.1
Rivest, R.L.2
Wagner, D.3
-
7
-
-
35048832999
-
A pseudo-random encryption mode
-
available from
-
M. Naor and O. Reingold. A pseudo-random encryption mode. Manuscript available from www.wisdom.weizmann.ac.il/ñaor.
-
Manuscript
-
-
Naor, M.1
Reingold, O.2
-
8
-
-
0003064824
-
On the construction of pseudorandom permutations: Luby-Rackoff revisited
-
Moni Naor and Omer Reingold. On the construction of pseudorandom permutations: Luby-Rackoff revisited. J. Cryptology, 12(1):29–66, 1999.
-
(1999)
J. Cryptology
, vol.12
, Issue.1
, pp. 29-66
-
-
Naor, M.1
Reingold, O.2
-
9
-
-
33744898820
-
A variable-input-length enciphering mode
-
Dengguo Feng, Dongdai Lin, and Moti Yung, editors, volume, of Lecture Notes in Computer Science, pages,. Springer
-
Peng Wang, Dengguo Feng, and Wenling Wu. HCTR: A variable-input-length enciphering mode. In Dengguo Feng, Dongdai Lin, and Moti Yung, editors, CISC, volume 3822 of Lecture Notes in Computer Science, pages 175–188. Springer, 2005.
-
(2005)
CISC
, vol.3822
, pp. 175-188
-
-
Wang, P.1
Feng, D.2
Wenling, W.H.C.T.R.3
-
10
-
-
0019572642
-
New hash functions and their use in authentication and set equality
-
Mark N. Wegman and Larry Carter. New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci., 22(3):265–279, 1981.
-
(1981)
J. Comput. Syst. Sci.
, vol.22
, Issue.3
, pp. 265-279
-
-
Wegman, M.N.1
Carter, L.2
|