{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:40:48Z","timestamp":1742931648134,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236953"},{"type":"electronic","value":"9783030236960"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23696-0_3","type":"book-chapter","created":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T23:23:13Z","timestamp":1562023393000},"page":"41-55","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Mersenne Low Hamming Combination Search Problem Can Be Reduced to an ILP Problem"],"prefix":"10.1007","author":[{"given":"Alessandro","family":"Budroni","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Tenti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"3_CR1","unstructured":"Aggarwal, D., Joux, A., Prakash, A., Santha, M.: A new public-key cryptosystem via mersenne numbers. Cryptology ePrint Archive, Report 2017\/481, version:20170530.072202 (2017)"},{"key":"3_CR2","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"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/trsc.3.1.53","volume":"3","author":"L Appelgren","year":"1969","unstructured":"Appelgren, L.: A column generation algorithm for a ship scheduling problem. Transp. Sci. 3, 53\u201368 (1969). https:\/\/doi.org\/10.1287\/trsc.3.1.53","journal-title":"Transp. Sci."},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.2466\/pms.1998.86.1.207","volume":"86","author":"KJ Berry","year":"1998","unstructured":"Berry, K.J., Mielke Jr., P.W.: The negative hypergeometric probability distribution: sampling without replacement from a finite population. Percept. Motor Skills 86(1), 207\u2013210 (1998). https:\/\/doi.org\/10.2466\/pms.1998.86.1.207","journal-title":"Percept. Motor Skills"},{"key":"3_CR5","volume-title":"Optimization Over Integers","author":"D Bertsimas","year":"2005","unstructured":"Bertsimas, D., Weismantel, R.: Optimization Over Integers. Dynamic Ideas, Belmont (2005)"},{"key":"3_CR6","unstructured":"Beunardeau, M., Connolly, A., Graud, R., Naccache, D.: On the hardness of the mersenne low hamming ratio assumption. Cryptology ePrint Archive, Report 2017\/522 (2017)"},{"key":"3_CR7","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":"3_CR8","volume-title":"Statistical inference","author":"G Casella","year":"2002","unstructured":"Casella, G., Berger, R.L.: Statistical inference, vol. 2. Duxbury Pacific Grove, CA (2002)"},{"key":"3_CR9","unstructured":"CPLEX Optimizer, I.: IBM ILOG CPLEX optimization studio (2018)"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Manag. Sci. 27(1), 1\u201318 (1981). https:\/\/doi.org\/10.1287\/mnsc.27.1.1","journal-title":"Manag. Sci."},{"key":"3_CR11","unstructured":"Gurobi Optimization, L.: Gurobi optimizer reference manual (2018)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054868"},{"issue":"4","key":"3_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. Mathematische Annalen 261(4), 515\u2013534 (1982). https:\/\/doi.org\/10.1007\/BF01457454","journal-title":"Mathematische Annalen"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr., H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983). https:\/\/doi.org\/10.1287\/moor.8.4.538","journal-title":"Math. Oper. Res."},{"issue":"1\u20133","key":"3_CR15","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H Marchand","year":"2002","unstructured":"Marchand, H., Martin, A., Weismantel, R., Wolsey, L.: Cutting planes in integer and mixed integer programming. Discrete Appl. Math. 123(1\u20133), 397\u2013446 (2002). https:\/\/doi.org\/10.1016\/S0166-218X(01)00348-1","journal-title":"Discrete Appl. Math."},{"issue":"C","key":"3_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch and bound algorithms. Discret. Optim. 19(C), 79\u2013102 (2016). https:\/\/doi.org\/10.1016\/j.disopt.2016.01.005","journal-title":"Discret. Optim."},{"issue":"4","key":"3_CR17","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"CH Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H.: On the complexity of integer programming. J. ACM 28(4), 765\u2013768 (1981). https:\/\/doi.org\/10.1145\/322276.322287","journal-title":"J. ACM"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230200608","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986). https:\/\/doi.org\/10.1002\/net.3230200608"},{"key":"3_CR19","doi-asserted-by":"publisher","unstructured":"Wang, P.S.: A p-adic algorithm for univariate partial fractions. In: Proceedings of the Fourth ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1981, pp. 212\u2013217. ACM, New York (1981). https:\/\/doi.org\/10.1145\/800206.806398","DOI":"10.1145\/800206.806398"},{"key":"3_CR20","series-title":"Wiley Series in Discrete Mathematics and Optimization","volume-title":"Integer Programming","author":"L Wolsey","year":"1998","unstructured":"Wolsey, L.: Integer Programming. Wiley Series in Discrete Mathematics and Optimization. Wiley, New York (1998)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 AFRICACRYPT 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23696-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:23:54Z","timestamp":1710260634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23696-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236953","9783030236960"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23696-0_3","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":"29 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rabat","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"9 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/africacrypt2019.aui.ma\/index.php","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"22","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":"42% - 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.5","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":"4.5","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)"}}]}}