Cryptography Reference
In-Depth Information
[121] Maurer, Ueli M.:
New Approaches to Digital Evidence
. Proceedings of the IEEE,
92(6):933-947, 2004.
[122] Maurer, Ueli M. und Stefan Wolf:
The Relationship Between Breaking the Di
e-
Hellman Protocol and Computing Discrete Logarithms
. SIAM Journal on Computing,
28(5):1689-1721, 1999.
[123] Menezes, Alfred J., Paul C. van Oorschot und Scott A. Vanstone:
Handbook of applied
cryptography
. CRC Press series on discrete mathematics and its applications. CRC
Press, 1996.
[124] Merkle, Ralph C.:
One Way Hash Functions and DES
. In: Brassard, Gilles
(Herausgeber):
Advances in Cryptology - CRYPTO '89, 9th Annual International
Cryptology Conference, Proceedings
, Band 435 der Reihe
Lecture Notes in Computer
Science
, Seiten 428-446. Springer, 1989.
[125] Micciancio, Daniele und Shafi Goldwasser:
Complexity of Lattice Problems — A
Cryptographic Perspective
. Springer International Series in Engineering and Computer
Science. Springer, 2002.
[126] Miller, Gary L.:
Riemann's Hypothesis and Tests for Primality
. Journal of Computer
and System Sciences, 13(3):300-317, 1976.
[127] Miller, Victor S.:
Use of Elliptic Curves in Cryptography
. In: Williams, Hugh C.
(Herausgeber):
Advances in Cryptology - CRYPTO '85, Proceedings
, Band 218 der
Reihe
Lecture Notes in Computer Science
, Seiten 417-426. Springer, 1986.
[128] Miyaguchi, Shoji, Kazuo Ohta und Masahiko Iwata:
Confirmation that Some Hash
Functions Are Not Collision Free
. In: Damgård, Ivan (Herausgeber):
Advances
in Cryptology - EUROCRYPT '90, Workshop on the Theory and Application of
Cryptographic Techniques, Proceedings
, Band 473 der Reihe
Lecture Notes in Computer
Science
, Seiten 326-343. Springer, 1991.
[129] Naor, Moni und Moti Yung:
Universal One-Way Hash Functions and their
Cryptographic Applications
. In:
Proceedings of the Twenty-First Annual ACM
Symposium on Theory of Computing
, Seiten 33-43. ACM Press, 1989.
[130] Naor, Moni und Moti Yung:
Public-key Cryptosystems Provably Secure against Chosen
Ciphertext Attacks
. In:
Proceedings of the Twenty Second Annual ACM Symposium on
Theory of Computing (STOC 1990)
, Seiten 427-437. ACM Press, 1990.
[131] Nielsen, Michael A. und Isaac L. Chuang:
Quantum Computation and Quantum
Information
. Cambridge University Press, 2000.
[132] Odlyzko, Andrew M.:
Discrete Logarithms: The Past and the Future
. Designs, Codes,
and Cryptography, 19(2/3):129-145, 2000.
[133] Pohlig, Stephen C. und Martin E. Hellman:
An Improved Algorithm for Computing
Logarithms over GF(p) and its Cryptographic Significance
. IEEE Transactions on
Information Theory, 24(1):106-110, 1978.
[134] Pollard, John M.:
Factoring with cubic integers
. In: Lenstra, Arjen K. und Jr. Hendrik
W. Lenstra (Herausgeber):
The Development of the Number Field Sieve
, Seiten 4-10.
Springer, 1993.
