{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T14:47:05Z","timestamp":1772808425695,"version":"3.50.1"},"reference-count":13,"publisher":"American Institute of Mathematical Sciences (AIMS)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AMC"],"published-print":{"date-parts":[[2017]]},"DOI":"10.3934\/amc.2017059","type":"journal-article","created":{"date-parts":[[2017,11,30]],"date-time":"2017-11-30T01:01:24Z","timestamp":1512003684000},"page":"805-811","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of Hidden Number Problem with Hidden Multiplier"],"prefix":"10.3934","volume":"11","author":[{"given":"Santanu","family":"Sarkar","sequence":"first","affiliation":[]}],"member":"2321","reference":[{"key":"key-10.3934\/amc.2017059-1"},{"key":"key-10.3934\/amc.2017059-2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68697-5_11"},{"key":"key-10.3934\/amc.2017059-3","unstructured":"D. Boneh and R. Venkatesan, Rounding in lattices and its cryptographic applications, <i>Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (New Orleans, LA, 1997)<\/i>, ACM, New York, (1997), 675\u2013681."},{"key":"key-10.3934\/amc.2017059-4","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011214926272"},{"key":"key-10.3934\/amc.2017059-5","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-03-01495-9"},{"key":"key-10.3934\/amc.2017059-6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.12.3.415"},{"key":"key-10.3934\/amc.2017059-7","doi-asserted-by":"crossref","unstructured":"T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thom\u00e9, J. W. Bos, P. Gaudry, A. Kruppa, P. L. Montgomery, D. A. Osvik, H. J. J. te Riele, A. Timofeev and P. Zimmermann, Factorization of a 768-bit RSA modulus, In <i>Crypto 2010, LNCS<\/i>, <b>6223<\/b> (2010), 333\u2013350.","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"key-10.3934\/amc.2017059-8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"key-10.3934\/amc.2017059-9"},{"key":"key-10.3934\/amc.2017059-10","unstructured":"O. Regev, Lattices in computer science (lecture notes), New York University, Available at <a href=\"http:\/\/www.cims.nyu.edu\/regev\/teaching\/lattices_fall_2004\/index.html\" target=\"_blank\">http:\/\/www.cims.nyu.edu\/regev\/teaching\/lattices_fall_2004\/index.html<\/a>."},{"key":"key-10.3934\/amc.2017059-11","unstructured":"R. L. Rivest, A. Shamir and D. A. Wagner, Time lock puzzles and timed release cryptography, Technical report, MIT\/LCS\/TR-684."},{"key":"key-10.3934\/amc.2017059-12"},{"key":"key-10.3934\/amc.2017059-13"}],"container-title":["Advances in Mathematics of Communications"],"original-title":[],"link":[{"URL":"https:\/\/aimsciences.org\/download\/files\/1930-5346_2017_4_805.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T10:05:32Z","timestamp":1772791532000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.aimsciences.org\/\/article\/doi\/10.3934\/amc.2017059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.3934\/amc.2017059","relation":{},"ISSN":["1930-5346","1930-5338"],"issn-type":[{"value":"1930-5346","type":"print"},{"value":"1930-5338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}