{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:07Z","timestamp":1742913967052,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030305291"},{"type":"electronic","value":"9783030305307"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30530-7_1","type":"book-chapter","created":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T13:03:55Z","timestamp":1568034235000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum LLL with an Application to Mersenne Number Cryptosystems"],"prefix":"10.1007","author":[{"given":"Marcel","family":"Tiepelt","sequence":"first","affiliation":[]},{"given":"Alan","family":"Szepieniec","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-319-96878-0_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"D Aggarwal","year":"2018","unstructured":"Aggarwal, D., Joux, A., Prakash, A., Santha, M.: A new public-key cryptosystem via mersenne numbers. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10993, pp. 459\u2013482. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96878-0_16"},{"issue":"5","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997). https:\/\/doi.org\/10.1137\/S0097539796300933","journal-title":"SIAM J. Comput."},{"key":"1_CR3","first-page":"522","volume":"2017","author":"M Beunardeau","year":"2017","unstructured":"Beunardeau, M., Connolly, A., G\u00e9raud, R., Naccache, D.: On the hardness of the Mersenne low hamming ratio assumption. IACR Cryptology ePrint Arch. 2017, 522 (2017)","journal-title":"IACR Cryptology ePrint Arch."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-79063-3_5","volume-title":"Post-Quantum Cryptography","author":"K de Boer","year":"2018","unstructured":"de Boer, K., Ducas, L., Jeffery, S., de Wolf, R.: Attacks on the AJPS Mersenne-based cryptosystem. In: Lange, T., Steinwandt, R. (eds.) PQCrypto 2018. LNCS, vol. 10786, pp. 101\u2013120. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-79063-3_5"},{"key":"1_CR5","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv. arXiv:quant-ph\/0410184 (2004)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/2629525","volume":"11","author":"T Duc Nguyen","year":"2013","unstructured":"Duc Nguyen, T., Van Meter, R.: A space-efficient design for reversible floating point adder in quantum computing. ACM J. Emerg. Technol. Comput. Syst. 11, 3 (2013). https:\/\/doi.org\/10.1145\/2629525","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"032324","DOI":"10.1103\/PhysRevA.86.032324","volume":"86","author":"AG Fowler","year":"2012","unstructured":"Fowler, A.G., Mariantoni, M., Martinis, J.M., Cleland, A.N.: Surface codes: towards practical large-scale quantum computation. Phys. Rev. A 86, 032324 (2012). https:\/\/doi.org\/10.1103\/PhysRevA.86.032324","journal-title":"Phys. Rev. A"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"N Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 31\u201351. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_3"},{"key":"1_CR9","unstructured":"Gidney, C.: Windowed quantum arithmetic. arXiv:1905.07682 (2019)"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: ACM STOC, pp. 212\u2013219. STOC 1996. ACM, New York (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989). https:\/\/doi.org\/10.1137\/0218053","journal-title":"SIAM J. Comput."},{"key":"1_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/9781420070033","volume-title":"Algorithmic Cryptanalysis","author":"A Joux","year":"2009","unstructured":"Joux, A.: Algorithmic Cryptanalysis, 1st edn. Chapman & Hall\/CRC, Boca Raton (2009)","edition":"1"},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Math. Ann."},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Nachtigal, M., Thapliyal, H., Ranganathan, N.: Design of a reversible single precision floating point multiplier based on operand decomposition. In: 10th IEEE International Conference on Nanotechnology, pp. 233\u2013237 (August 2010). https:\/\/doi.org\/10.1109\/NANO.2010.5697746","DOI":"10.1109\/NANO.2010.5697746"},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Nachtigal, M., Thapliyal, H., Ranganathan, N.: Design of a reversible floating-point adder architecture. In: 2011 11th IEEE International Conference on Nanotechnology, pp. 451\u2013456 (August 2011). https:\/\/doi.org\/10.1109\/NANO.2011.6144358","DOI":"10.1109\/NANO.2011.6144358"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11426639_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"PQ Ngu\u00ean","year":"2005","unstructured":"Ngu\u00ean, P.Q., Stehl\u00e9, D.: Floating-point LLL revisited. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 215\u2013233. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_13"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11792086_18","volume-title":"Algorithmic Number Theory","author":"PQ Nguyen","year":"2006","unstructured":"Nguyen, P.Q., Stehl\u00e9, D.: LLL on the average. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 238\u2013256. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_18"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02295-1","volume-title":"The LLL Algorithm: Survey and Applications","author":"PQ Nguyen","year":"2009","unstructured":"Nguyen, P.Q., Valle, B.: The LLL Algorithm: Survey and Applications, 1st edn. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-02295-1","edition":"1"},{"key":"1_CR19","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information, 10th edn. Cambridge University Press, New York (2011)","edition":"10"},{"key":"1_CR20","unstructured":"Rines, R., Chuang, I.: High performance quantum modular multipliers. arXiv arXiv:1801.01081 (2018)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-70697-9_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"M Roetteler","year":"2017","unstructured":"Roetteler, M., Naehrig, M., Svore, K.M., Lauter, K.: Quantum resource estimates for computing elliptic curve discrete logarithms. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10625, pp. 241\u2013270. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70697-9_9"},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0196-6774(88)90004-1","volume":"9","author":"CP Schnorr","year":"1988","unstructured":"Schnorr, C.P.: A more efficient algorithm for lattice basis reduction. J. Algorithms 9(1), 47\u201362 (1988). https:\/\/doi.org\/10.1016\/0196-6774(88)90004-1","journal-title":"J. Algorithms"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"042302","DOI":"10.1103\/PhysRevA.87.042302","volume":"87","author":"P Selinger","year":"2013","unstructured":"Selinger, P.: Quantum circuits of $$t$$-depth one. Phys. Rev. A 87, 042302 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.042302","journal-title":"Phys. Rev. A"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: FOCS, pp. 124\u2013134. SFCS 1994. IEEE Computer Society, Washington, D.C. (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365700","DOI":"10.1109\/SFCS.1994.365700"},{"key":"1_CR25","unstructured":"Szepieniec, A.: Ramstake. NIST Submission (2017) https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography\/Round-1-Submissions"},{"issue":"9","key":"1_CR26","doi-asserted-by":"publisher","first-page":"093041","DOI":"10.1088\/1367-2630\/15\/9\/093041","volume":"15","author":"N Wiebe","year":"2013","unstructured":"Wiebe, N., Kliuchnikov, V.: Floating point representations in quantum circuit synthesis. New J. Phys. 15(9), 093041 (2013). https:\/\/doi.org\/10.1088\/1367-2630\/15\/9\/093041","journal-title":"New J. Phys."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30530-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T00:02:37Z","timestamp":1721692957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-30530-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030305291","9783030305307"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30530-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santiago de Chile","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latincrypt2019.cryptojedi.org\/index.shtml","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"WebSubRev","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.35","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}