Gitter und Kryptographie - Goethe-Universität
Gitter und Kryptographie - Goethe-Universität
Gitter und Kryptographie - Goethe-Universität
Erfolgreiche ePaper selbst erstellen
Machen Sie aus Ihren PDF Publikationen ein blätterbares Flipbook mit unserer einzigartigen Google optimierten e-Paper Software.
Literaturverzeichnis<br />
[Aj98]<br />
[Aj03]<br />
M. Ajtai, The Shortest Vector Problem in L 2 is NP-hard for Randomized Reductions.<br />
Proc. 30th STOC, pp. 10–19, 1998.<br />
M. Ajtai, The Worst-case Behavior of Schnorr’s Algorithm Approximating the Shortest<br />
Nonzero Vector in a Lattice. Proc. 35th STOC, pp. 396–406 2003.<br />
[AKS01] M. Ajtai, R. Kumar, and D. Sivakumar, A Sieve Algorithm for the Shortest Lattice<br />
Vector Problem. Proc. 33th STOC, pp. 601–610, 2001.<br />
[Ak02] A. Akhavi, Random Lattices, Threshold Phenomena and Efficient Reduction Algorithms.<br />
Theoret. Comput. Sci., 287, pp. 359–385, 2002.<br />
[Ba86]<br />
L. Babai , On Lovász’ Lattice Reduction and the nearest Lattice Point Problem, Combinatorica,<br />
Band 6, Seiten 1–13, 1986.<br />
[Bar59] E.S. Barnes , The Contruction of perfect and extreme Forms II, Acta Arithmetica, Band<br />
5, Seiten 205-222, 1959.<br />
[BaKa84] A. Bachem <strong>und</strong> R. Kannan , Lattices and the Basis Reduction Algorithm, Technischer<br />
Report, Carnegie-Mellon-<strong>Universität</strong> (USA), (1984).<br />
[BeWe93] Th. Becker <strong>und</strong> V. Weispfennig, Gröbner Bases — a computational Approach to<br />
commutative Algebra, Graduate Texts in Mathematics, Band 141, Springer-Verlag, Berlin/Heidelberg,<br />
1993.<br />
[Bli14] H.F. Blichfeldt, A new Principle in the Geometry of Numbers with some Applications,<br />
Transaction of the American Mathematical Society, Band 15, Seiten 227–235, 1914.<br />
[Bli29] H.F. Blichfeldt , The Minimum Value of quadratic Forms and the closet Packing of Sphere,<br />
Mathematische Annalen, Band 101, Seiten 366-389, 1929.<br />
[Bli35] H.F. Blichfeldt, The minimum Value of positive Quadratic Forms in six, seven and eight<br />
Variables, Mathematische Zeitschrift, Band 39, Seiten 1–15, 1935.<br />
[Be80]<br />
G. Bergman, Notes on Ferguson and Forcade’s Generalized Euclidean Algorithm. TR.<br />
Dep. of Mathematics, University of Berkeley, CA, 1980.<br />
[BM03] J. Blömer and A. May New Partial Key Exposure Attacks on RSA. Proc. Crypto’2003,<br />
Lecture Notes in Comp.Sci., 2729, Springer, New York, pp. 27 - 43, 2003.<br />
[BS99] J. Blömer and J.P. Seifert, On the Complexity of Computing Short Linearly Independent<br />
Vectors and Short Bases in a Lattice. Proc. 31th STOC, pp. 711–720, 1999.<br />
[Bo00]<br />
D. Boneh, Finding Smooth Integers in Small Intervals Using CRT Decoding. Proc. 32th<br />
STOC, pp. 265-272, 2000.<br />
107
Change language