{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T19:44:53Z","timestamp":1778528693953,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,1,22]],"date-time":"2014-01-22T00:00:00Z","timestamp":1390348800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10623-014-9918-8","type":"journal-article","created":{"date-parts":[[2014,1,20]],"date-time":"2014-01-20T23:25:11Z","timestamp":1390260311000},"page":"355-368","source":"Crossref","is-referenced-by-count":14,"title":["PotLLL: a polynomial time version of LLL with deep insertions"],"prefix":"10.1007","volume":"73","author":[{"given":"Felix","family":"Fontein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Urs","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,1,22]]},"reference":[{"key":"9918_CR1","unstructured":"Chen Y., Nguyen P.Q.: BKZ 2.0: better lattice security estimates. In: Lee D.H., Wang X. (eds.) Advances in Cryptology\u2014ASIACRYPT 2011. Lecture Notes in Computer Science, vol. 7073, pp. 1\u201320. Springer, Heidelberg (2011)."},{"key":"9918_CR2","unstructured":"Cong L., Mow W.H., Howgrave-Graham N.: Reduced and fixed-complexity variants of the lll algorithm for communications. IEEE Trans. Commun. 61(3), 1040\u20131050 (2013)."},{"key":"9918_CR3","unstructured":"Fontein F., Schneider M., Wagner U.: A polynomial time version of LLL with deep insertions. In: Preproceedings of the International Workshop on Coding and Cryptography, WCC \u201913 (2013)."},{"key":"9918_CR4","unstructured":"Gama N., Nguyen P.Q.: Predicting lattice reduction. In: Smart N. (ed.) Advances in Cryptology\u2014EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008)."},{"key":"9918_CR5","unstructured":"Hanrot G., Pujol X., Stehl\u00e9 D.: Analyzing blockwise lattice algorithms using dynamical systems. In: Rogaway P. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 6841, pp. 447\u2013464. Springer, Heidelberg (2011)."},{"key":"9918_CR6","unstructured":"Lenstra A.K., Lenstra Jr H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)."},{"key":"9918_CR7","doi-asserted-by":"crossref","unstructured":"Martinet J.: Perfect lattices in Euclidean Spaces. Grundlehren der Mathematischen Wissenschaften (Fundamental Principles of Mathematical Sciences), vol. 327. Springer-Verlag, Berlin (2003).","DOI":"10.1007\/978-3-662-05167-2"},{"key":"9918_CR8","doi-asserted-by":"crossref","unstructured":"Micciancio D., Goldwasser S.: Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston (2002).","DOI":"10.1007\/978-1-4615-0897-7"},{"key":"9918_CR9","unstructured":"Micciancio D., Regev O.: Lattice-based cryptography. In: Bernstein D.J., Buchmann J., Dahmen E. (eds.) Post-quantum Cryptography, pp. 147\u2013191. Springer, Heidelberg (2008)."},{"key":"9918_CR10","unstructured":"Nguyen P.Q., Stehl\u00e9 D.: Floating-point LLL revisited. In: Cramer R. (ed.) Advances in Cryptology\u2014EUROCRYPT 2005. LNCS, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005)."},{"key":"9918_CR11","unstructured":"Nguyen P.Q., Stehl\u00e9 D.: LLL on the average. In: Hess F., Pauli S., Pohst M.E. (eds.) ANTS. Lecture Notes in Computer Science, vol. 4076, pp. 238\u2013256. Springer, Heidelberg (2006)."},{"key":"9918_CR12","doi-asserted-by":"crossref","unstructured":"Nguyen P.Q., Vall\u00e9e B.: The LLL Algorithm: Survey and Applications. Information Security and Cryptography. Springer, Heidelberg (2010).","DOI":"10.1007\/978-3-642-02295-1"},{"key":"9918_CR13","unstructured":"Novocin A., Stehl\u00e9 D., Villard G.: An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. In: STOC, pp. 403\u2013412. ACM, New York (2011)."},{"key":"9918_CR14","doi-asserted-by":"crossref","unstructured":"Schnorr C.-P., Euchner M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(2), 181\u2013199 (1994).","DOI":"10.1007\/BF01581144"},{"key":"9918_CR15","unstructured":"Schnorr C.-P.: Block reduced lattice bases and successive minima. Comb. Prob. Comput. 3, 507\u2013522 (1994)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9918-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-9918-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-9918-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:38Z","timestamp":1559231918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-9918-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,1,22]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9918"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-9918-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,22]]}}}