Cryptography Reference
In-Depth Information
[34] Biham, Eli und Adi Shamir:
Differential Cryptanalysis of the Full 16-Round DES
.In:
Advances in Cryptology - CRYPTO '92, Proceedings of the 12th Annual International
Cryptology Conference
, Band 740 der Reihe
Lecture Notes in Computer Science
,Seiten
487-496. Springer, 1993.
[35] Biryukov, Alex, Orr Dunkelman, Nathan Keller, Dmitry Khovratovich und Adi Shamir:
Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10
Rounds
. In: Gilbert, Henri (Herausgeber):
Advances in Cryptology - EUROCRYPT
2010, Proceedings of the 29th Annual International Conference on the Theory and
Applications of Cryptographic Techniques
,Band6110derReihe
Lecture Notes in
Computer Science
, Seiten 299-319. Springer, 2010.
[36] Biryukov, Alex, Dmitry Khovratovich und Ivica Nikolic:
Distinguisher and Related-Key
Attack on the Full AES-256
. In: Halevi, Shai (Herausgeber):
Advances in Cryptology -
CRYPTO 2009, Proceedings of the 29th Annual International Cryptology Conference
,
Band 5677 der Reihe
Lecture Notes in Computer Science
, Seiten 231-249. Springer,
2009.
[37] Black, John und Phillip Rogaway:
CBC MACs for Arbitrary-Length Messages: The
Three-Key Constructions
. In: Bellare, Mihir (Herausgeber):
Advances in Cryptology -
CRYPTO 2000, 20th Annual International Cryptology Conference, Proceedings
,Band
1880 der Reihe
Lecture Notes in Computer Science
, Seiten 197-215. Springer, 2000.
[38] Black, John, Phillip Rogaway und Thomas Shrimpton:
Black-Box Analysis of the
Block-Cipher-Based Hash-Function Constructions from PGV
. In: Yung, Moti
(Herausgeber):
Advances in Cryptology - CRYPTO 2002, 22nd Annual International
Cryptology Conference, Proceedings
, Band 2442 der Reihe
Lecture Notes in Computer
Science
, Seiten 320-335. Springer, 2002.
[39] Bleichenbacher, Daniel:
Chosen Ciphertext Attacks Against Protocols Based on the RSA
Encryption Standard PKCS #1
. In:
Advances in Cryptology - CRYPTO 1998, 18th
Annual Cryptology Conference. Proceedings
, Band 1462 der Reihe
Lecture Notes in
Computer Science
, Seiten 1-12. Springer, 1998.
[40] Blum, Manuel und Silvio Micali:
How to Generate Cryptographically Strong Sequences
of Pseudo-Random Bits
. SIAM Journal on Computing, 13(4):850-864, 1984.
[41] Boldyreva, Alexandra, David Cash, Marc Fischlin und Bogdan Warinschi:
Foundations
of Non-malleable Hash and One-Way Functions
. In: Matsui, Mitsuru (Herausgeber):
Advances in Cryptology - ASIACRYPT 2009, 15th International Conference on the
Theory and Application of Cryptology and Information Security, Proceedings
,Band5912
der Reihe
Lecture Notes in Computer Science
, Seiten 524-541. Springer, 2009.
[42] Boneh, Dan:
The Decision Die-Hellman Problem
. In: Buhler, Joe (Herausgeber):
Algorithmic Number Theory, Proceedings of the Third International Symposium,
ANTS-III
, Band 1423 der Reihe
Lecture Notes in Computer Science
, Seiten 48-63.
Springer, 1998.
[43] Boneh, Dan:
Twenty years of attacks on the RSA cryptosystem
. Notices of the
American Mathematical Society (AMS), 46(2):203-213, 1999.
