Christoph Ludwig  Home/Search
Context
Related
| iacr.org/2004/209.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2004/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We report experiments on the security of the GGH-like cryptosystem proposed by Micciancio. Based on these experiments, we conclude that the system can be securely used only in lattice dimensions ≥ 782. Further experiments on the efficiency of the system show that it requires key sizes of 1 MByte and more and that the key generation as well as the decryption take inacceptibly long. Therefore, Micciancio's cryptosystem seems currently far from being practical. (Update)
Active bibliography (related documents): More All
1.9: The Security and Efficiency of Micciancio's Cryptosystem - Ludwig (2002) (Correct)
0.9: A Faster Lattice Reduction Method Using Quantum Search - Ludwig (2003) (Correct)
0.3: Post-Quantum Signatures - Buchmann, Coronado, Döring.. (2004) (Correct)
Similar documents based on text: More All
0.3: Enhancing Classroom Lectures with Digital Sliding.. - Rößling, Trompler.. (2004) (Correct)
0.2: Piecewise Circular Approximation of Spirals and Polar.. - Taponecco, Alexa (2003) (Correct)
0.1: The Event-Triggered and Time-Triggered Medium-Access Methods - Claesson, Ekelin, Suri (2003) (Correct)
BibTeX entry: (Update)
@misc{ ludwig-security,
author = "Christoph Ludwig",
title = "The Security and Efficiency of {M}icciancio's Cryptosystem",
url = "citeseer.ist.psu.edu/article/ludwig04security.html" }
Citations (may not include all citations):258 Golub and Charles F (context) - Gene - 1996
103 Factoring polynomials with rational coe#cients (context) - Lenstra, Lenstra et al. - 1982
98 Selecting cryptographic key sizes - Lenstra, Verheul - 2001
66 On Lovasz' lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
60 Lattice basis reduction: Improved practical algorithms and s.. - Schnorr, Euchner - 1994
44 The shortest vector problem in L2 is NP -hard for randomized.. (context) - Ajtai - 1998
42 Public-key cryptosystems from lattice reduction problems - Goldreich, Goldwasser et al. - 1997
39 Attacking the Chor-Rivest cryptosystem by improved lattice r.. - Schnorr, Horner - 1995
30 The shortest vector in a lattice is hard to approximate to w.. - Micciancio - 1998
20 NTL -- a library for doing number theory (context) - Shoup - 2001
15 Another NP -complete partition problem and the complexity of.. (context) - Boas - 1981
15 Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosyste.. - Nguyen - 1999
11 Improving lattice based cryptosystems using the Hermite norm.. - Micciancio
6 Lattice reduction by random sampling and birthday methods - Schnorr - 2002
3 volume 2146 of Lecture Notes in Computer Science (context) - Silverman, Cryptography - 2001
2 The GoldreichGoldwasser -Halevi cryptosystem (context) - Goldreich, Goldwasser et al. - 1997
Documents on the same site (http://eprint.iacr.org/2004/): More
Entropic Security and the Encryption of High Entropy Messages - Dodis, Smith (2004) (Correct)
On Cheating Immune Secret Sharing - Braeken, Nikova, al. (2004) (Correct)
Non-Interactive and Information-Theoretic Secure Publicly.. - Tang, Pei, Liu, He (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC