Hartung, Rupert J.; Schnorr, Claus-Peter Identification and signatures based on NP-hard problems of indefinite quadratic forms. (English) Zbl 1163.11027 J. Math. Cryptol. 2, No. 4, 327-341 (2008). Reviewer: Guillermo Morales-Luna (Mexico) MSC: 11E20 94A60 68W30 11D09 11R29 PDFBibTeX XMLCite \textit{R. J. Hartung} and \textit{C.-P. Schnorr}, J. Math. Cryptol. 2, No. 4, 327--341 (2008; Zbl 1163.11027) Full Text: DOI
Schnorr, Claus Peter Fast LLL-type lattice reduction. (English) Zbl 1108.11090 Inf. Comput. 204, No. 1, 1-25 (2006). MSC: 11Y16 11H06 68Q25 68W30 PDFBibTeX XMLCite \textit{C. P. Schnorr}, Inf. Comput. 204, No. 1, 1--25 (2006; Zbl 1108.11090) Full Text: DOI Link
Rössner, Carsten; Schnorr, Claus P. An optimal, stable continued fraction algorithm for arbitrary dimension. (English) Zbl 1415.90066 Cunningham, W. H. (ed.) et al., Integer programming and combinatorial optimization. 5th international IPCO conference, Vancouver, Canada, June 3–5, 1996. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1084, 31-43 (1996). MSC: 90C10 PDFBibTeX XMLCite \textit{C. Rössner} and \textit{C. P. Schnorr}, Lect. Notes Comput. Sci. 1084, 31--43 (1996; Zbl 1415.90066) Full Text: DOI Link
Schnorr, C. P. Block reduced lattice bases and successive minima. (English) Zbl 0845.11025 Comb. Probab. Comput. 3, No. 4, 507-522 (1994). MSC: 11H55 11Y16 90C10 PDFBibTeX XMLCite \textit{C. P. Schnorr}, Comb. Probab. Comput. 3, No. 4, 507--522 (1994; Zbl 0845.11025) Full Text: DOI
Schnorr, C. P.; Euchner, M. Lattice basis reduction: Improved practical algorithms and solving subset sum problems. (English) Zbl 0829.90099 Math. Program. 66, No. 2 (A), 181-199 (1994). Reviewer: R.Euler (Brest) MSC: 90C10 90C27 11Y16 PDFBibTeX XMLCite \textit{C. P. Schnorr} and \textit{M. Euchner}, Math. Program. 66, No. 2 (A), 181--199 (1994; Zbl 0829.90099) Full Text: DOI
Coster, Matthijs J.; Joux, Antoine; LaMacchia, Brian A.; Odlyzko, Andrew M.; Schnorr, Claus-Peter; Stern, Jacques Improved low-density subset sum algorithms. (English) Zbl 0768.11049 Comput. Complexity 2, No. 2, 111-128 (1992). Reviewer: M.Pohst (Düsseldorf) MSC: 11Y16 PDFBibTeX XMLCite \textit{M. J. Coster} et al., Comput. Complexity 2, No. 2, 111--128 (1992; Zbl 0768.11049) Full Text: DOI
Schnorr, C. P. A hierarchy of polynomial time lattice basis reduction algorithms. (English) Zbl 0642.10030 Theor. Comput. Sci. 53, 201-224 (1987). MSC: 11H55 68Q25 11H06 PDFBibTeX XMLCite \textit{C. P. Schnorr}, Theor. Comput. Sci. 53, 201--224 (1987; Zbl 0642.10030) Full Text: DOI
Ong, H.; Schnorr, C. P. Signatures through approximate representations by quadratic forms. (English) Zbl 1486.94155 Chaum, David (ed.), Advances in cryptology. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (Crypto ’83) held at the University of California, Santa Barbara, Calif., August 22–24, 1983. New York-London: Plenum Press. 117-131 (1984). MSC: 94A62 PDFBibTeX XMLCite \textit{H. Ong} and \textit{C. P. Schnorr}, in: Advances in cryptology. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques (Crypto '83) held at the University of California, Santa Barbara, Calif., August 22--24, 1983. New York-London: Plenum Press. 117--131 (1984; Zbl 1486.94155) Full Text: DOI