-
probability in
observation 1 of this
paper matches that of
lemma 2 from the
INDOCRYPT 2004
analysis (setting w = 128 and l = n × 128).
Saarinen also described...
- 30-Round SHACAL-2. 4th
International Conference on
Cryptology in
India (
INDOCRYPT 2003). New Delhi: Springer-Verlag. pp. 97–106.
Jongsung Kim; Guil Kim;...
-
Huseyin Demirci. New
Results on the Key
Scheduling Algorithm of RC4.
INDOCRYPT 2008,
pages 40–52, vol. 5365,
Lecture Notes in
Computer Science, Springer...
-
Vinegar Signature Scheme under Direct Attacks".
Progress in
Cryptology –
INDOCRYPT 2010.
Lecture Notes in
Computer Science. Vol. 6498. pp. 17–32. CiteSeerX 10...
- up the Wide-Pipe:
Secure and Fast Hashing".
Progress in
Cryptology -
INDOCRYPT 2010.
Lecture Notes in
Computer Science. Vol. 6498. pp. 144–162. doi:10...
-
Transmission - Possibility,
Feasibility and Optimality.
Progress in
Cryptology –
INDOCRYPT 2007, 8th
International Conference on
Cryptology in India, Chennai, India...
-
Differential Properties of Pseudo-Hadamard
Transform and
Related Mappings.
INDOCRYPT 2002, LNCS 2551, pp 48-61, 2002.[3] v t e Fast Pseudo-Hadamard Transforms...
- Johansson, Thomas; Maitra,
Subhamoy (eds.).
Progress in
Cryptology -
INDOCRYPT 2003.
Lecture Notes in
Computer Science. Vol. 2904.
Springer Berlin Heidelberg...
- in the MQV and HMQV Key
Agreement Protocols".
Progress in
Cryptology -
INDOCRYPT 2006.
Lecture Notes in
Computer Science. Vol. 4329. Springer, Berlin,...
- corrected. The
round functions used to
produce output are identical. At
Indocrypt 2007,
Gautham Sekar,
Souradyuti Paul and Bart
Preneel proposed two new...
