{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T06:56:59Z","timestamp":1767164219832,"version":"build-2238731810"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Secur. Privacy"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1109\/msp.2016.120","type":"journal-article","created":{"date-parts":[[2016,12,14]],"date-time":"2016-12-14T14:45:07Z","timestamp":1481726707000},"page":"34-42","source":"Crossref","is-referenced-by-count":28,"title":["A Riddle Wrapped in an Enigma"],"prefix":"10.1109","volume":"14","author":[{"given":"Neal","family":"Koblitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Menezes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","article-title":"The Case for Elliptic Curve Cryptography","year":"2005"},{"key":"ref3","article-title":"A Riddle Wrapped in anEnigma","author":"koblitz","year":"2015","journal-title":"Cryptology ePrint Archive"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900052"},{"key":"ref6","article-title":"Secret Contract Tied NSA and Security Industry Pioneer","author":"menn","year":"2013"},{"key":"ref11","article-title":"NSA Seeks to Build Quantum Computer that Could Crack Most Types of Encryption","author":"rich","year":"2014","journal-title":"Washington Post"},{"key":"ref5","article-title":"Fact Sheet NSA Suite B Cryptography","year":"2010"},{"key":"ref12","article-title":"Cybersecurity in an Era with Quantum Computers: Will We Be Safe?","author":"mosca","year":"2015","journal-title":"Cryptology ePrint Archive"},{"key":"ref8","first-page":"81","article-title":"Fermat Quotients and the Polynomial Time Discrete Log Algorithm for Anomalous Elliptic Curves","volume":"47","author":"satoh","year":"1998","journal-title":"Commentarii Mathematici Universitatis Sancti Pauli"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.259647"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-98-00887-4"},{"key":"ref1","year":"2015","journal-title":"Cryptography Today"}],"container-title":["IEEE Security &amp; Privacy"],"original-title":[],"link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/8013\/7782693\/07782697.pdf?arnumber=7782697","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:58:27Z","timestamp":1641988707000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/ieeexplore.ieee.org\/document\/7782697\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":12,"aliases":["10.1109\/msp.2017.265092653"],"journal-issue":{"issue":"6"},"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1109\/msp.2016.120","relation":{},"ISSN":["1540-7993"],"issn-type":[{"value":"1540-7993","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}