Cryptanalysis
References
[1]
W. G. Barker. Cryptanalysis of the Hagelin Cryptograph. Aegean Park Press, Laguna Hill, CA, 1977.
[2]
R. Balasubramanian and N. Koblitz. The improbability that an elliptic curve has subexponential discrete logarithm problem under the Menezes-Okamoto-Vanstone algorithm. J. Cryptol., 11 (2):141-145, 1998.
[3]
E. F. Brickell and A. M. Odlyzko. Cryptanalysis: A survey of recent results. Proc. IEEE, 76: 578-593, May, 1988.
[4]
D. Boneh. Twenty years of attacks on the RSA cryptosystem. Amer. Math. Soc. Notices, 46:202- 213, 1999.
[5]
E. Biham and A. Shamir. Differential cryptanalysis of DES-like cryptosystems. In A. J. Menezes and S. A. Vanstone, editors, Advances in Cryptology-CRYPTO '90, Lecture Notes in Computer Science 537, pages 2-21, Springer-Verlag, Berlin, 1991.
[6]
E. Biham and A. Shamir. Differential Cryptanalysis of the Data Encryption Standard. Springer-Verlag, New York, 1993.
[7]
D. Coppersmith. Fast evaluation of logarithms in fields of characteristic two. IEEE Trans. Inform. Theory, 30:587-594, 1984.
[8]
B. Chor and R. L. Rivest. A knapsack type public key cryptosystem based on arithmetic in finite fields. In Advances in Cryptology-CRYPTO '84, pages 54-65, Springer-Verlag, Berlin, 1985.
[9]
D. E. Denning. Cryptography and Data Security. Addison-Wesley, Reading, MA, 1983.
[10]
W. Diffie and M. Hellman. New directions in cryptography. IEEE Trans. Inform. Theory, IT-22 (6):644-654, November, 1976.
[11]
W. Diffie and M. Hellman. Exhaustive cryptanalysis of the NBS data encryption standard. Computer, 10 (6):74-84, June, 1977.
[12]
C. Diem. The GHS attack in odd characteristic. J. Ramanujan Math. Soc., 18:1-32, 2004.
[13]
C. Ding, G. Xiao, and W. Shan. The Stability Theory of Stream Ciphers, Lecture Notes in Computer Science 561. Springer-Verlag, New York, 1991.
[14]
W. F. Friedman. Elements of Cryptanalysis. Aegean Park Press, Laguna Hills, CA, 1976.
[15]
Parker Hitt. Manual for the Solution of Military Ciphers, Second edition. Army Service Schools Press, Fort Leavenworth, KS, 1918.
[16]
D. Kahn. The Codebreakers. Macmillan Co., New York, 1967.
[17]
A. G. Konheim. Cryptography, A Primer. John Wiley & Sons, New York, 1981.
[18]
A. K. Lenstra and H. W. Lenstra, Jr. The Development of the Number Field Sieve. Springer-Verlag, New York, 1993.
[19]
M. Matsui. Linear cryptanalysis method for DES cipher. In A. J. Menezes and S. A. Vanstone, editors, Advances in Cryptology-EUROCRYPT '93, pages 386-397, Springer-Verlag, Berlin, 1994.
[20]
A. J. Menezes, T. Okamoto, and S. A. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Trans. Inform. Theory, 39 (5):1639-1646, 1993.
[21]
http://csrc.nist.gov/CryptoToolkit/aes/rijndael.
[22]
H. Riesel. Prime Numbers and Computer Methods for Factorization, 2nd edition. Birkhäuser, Boston, MA, 1994.
[23]
R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM, 21 (2):120-126, February, 1978.
[24]
J. A. Reeds and P. J. Weinberger. File security and the UNIX crypt command. AT&T Tech. J., 63:1673-1683, October, 1984.
[25]
C. E. Shannon. Communication theory of secrecy systems. Bell Syst. Tech. J., 28:656-715, 1949.
[26]
S. S. Wagstaff, Jr. Cryptanalysis of Number Theoretic Ciphers. Chapman & Hall/CRC Press, Boca Raton, FL, 2003.
[27]
H. C. Williams. A p + 1 method of factoring. Math. Comp., 39:225-234, 1982.
Recommendations
Impossible differential cryptanalysis of reduced-round ARIA and Camellia
This paper studies the security of the block ciphers ARIA and Camellia against impossible differential cryptanalysis. Our work improves the best impossible differential cryptanalysis of ARIA and Camellia known so far. The designers of ARIA expected no ...
Impossible Differential Cryptanalysis of CLEFIA
Fast Software EncryptionThis paper reports impossible differential cryptanalysis on the 128-bit block cipher CLEFIA that was proposed in 2007, including new 9-round impossible differentials for CLEFIA, and the result of an impossible differential attack using them. For the ...
Biclique cryptanalysis on lightweight block cipher: HIGHT and Piccolo
Advanced Computer Mathematics based Cryptography and Security TechnologiesBiclique cryptanalysis is an attack that improves the computational complexity by finding a biclique which is a kind of bipartite graph. We present a single-key full-round attack of lightweight block ciphers, HIGHT and Piccolo by using biclique ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Publisher
Chapman & Hall/CRC
Publication History
Published: 01 January 2010
Qualifiers
- Chapter
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 282Total Downloads
- Downloads (Last 12 months)79
- Downloads (Last 6 weeks)10
Reflects downloads up to 05 Feb 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in