{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T12:33:56Z","timestamp":1768826036954,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,11,17]],"date-time":"2014-11-17T00:00:00Z","timestamp":1416182400000},"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":["J Cryptogr Eng"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s13389-014-0090-x","type":"journal-article","created":{"date-parts":[[2014,11,21]],"date-time":"2014-11-21T11:17:16Z","timestamp":1416568636000},"page":"141-151","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":53,"title":["Fast prime field elliptic-curve cryptography with 256-bit primes"],"prefix":"10.1007","volume":"5","author":[{"given":"Shay","family":"Gueron","sequence":"first","affiliation":[]},{"given":"Vlad","family":"Krasnov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,17]]},"reference":[{"key":"90_CR1","doi-asserted-by":"crossref","unstructured":"Acii\u00e7mez, O., Gueron, S., Seifert, J.P.: New branch prediction vulnerabilities in open SSL and necessary software countermeasures. In: Galbarith, S.D (ed.) Cryptography and Coding. LNCS, vol. 4887, pp. 185\u2013203. Springer, Heidelberg (2007)","DOI":"10.1007\/978-3-540-77272-9_12"},{"key":"90_CR2","unstructured":"Barker, E., Roginsky, A.: Transitions: recommendation for transitioning the use of cryptographic algorithms and key lengths. NIST Special Publication 800\u2013131A, NIST (2011). http:\/\/csrc.nist.gov\/publications\/nistpubs\/800-131A\/sp800-131A.pdf"},{"key":"90_CR3","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Curve25519: new Diffie\u2013Hellman speed records. In: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24\u201326, 2006. Proceedings, pp. 24\u201326. Springer, Heidleberg (2006)","DOI":"10.1007\/11745853_14"},{"key":"90_CR4","doi-asserted-by":"crossref","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4(2), 236\u2013240. Oxford University Press, Oxford (1951)","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"90_CR5","unstructured":"China Cryptography Administration: SM2 Elliptic curve recommended parameters (in Chinese). http:\/\/www.oscca.gov.cn\/UpFile\/2010122214836668.pdf"},{"key":"90_CR6","unstructured":"China Cryptography Administration: State Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves (2010, in Chinese). http:\/\/www.oscca.gov.cn\/UpFile\/2010122214822692.pdf"},{"key":"90_CR7","unstructured":"Dierks, T., Rescorla, E.: The transport layer security (TLS) protocol version 1.2. IETF RFC5246. IETF (2008). http:\/\/tools.ietf.org\/html\/rfc5246"},{"key":"90_CR8","unstructured":"Gueron, S., Krasnov, V.: [PATCH] Efficient and side channel analysis resistant 1024-bit and 2048-bit modular exponentiation, optimizing RSA, DSA and DH of compatible sizes, for AVX2 capable x86\\_64 platforms. OpenSSL patch (2013). http:\/\/rt.openssl.org\/Ticket\/Display.html?id=3054&user=guest&pass=guest"},{"key":"90_CR9","doi-asserted-by":"crossref","unstructured":"Gueron, S.: Efficient software implementations of modular exponentiation. J. Cryptograph. Eng. 2, 31\u201343. Springer, Heidelberg (2012)","DOI":"10.1007\/s13389-012-0031-5"},{"key":"90_CR10","unstructured":"Gueron, S., Krasnov, V.: [PATCH] Fast and side channel protected implementation of the NIST P-256 elliptic curve, for x86\u201364 platforms. OpenSSL patch (2013). http:\/\/rt.openssl.org\/Ticket\/Display.html?id=3149&user=guest&pass=guest"},{"key":"90_CR11","unstructured":"Greenwald, G., MacAskill, E.: NSA prism program taps in to user data of Apple, Google and others. In: The Guardian (June 2013). http:\/\/www.theguardian.com\/world\/2013\/jun\/06\/us-tech-giants-nsa-data"},{"key":"90_CR12","unstructured":"Intel: Intel R architecture instruction set extensions programming reference (2013). http:\/\/download-software.intel.com\/sites\/default\/files\/319433-015.pdf"},{"key":"90_CR13","doi-asserted-by":"crossref","unstructured":"K\u00e4sper, E.: Fast Elliptic Curve Cryptography in OpenSSL. In: Danezis, G., Dietrich, S., Sako, K. (eds.) Financial Cryptography and Data Security. LNCS, vol. 7126, pp. 27\u201339. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-29889-9_4"},{"key":"90_CR14","unstructured":"Langley, A.: Protecting data for the long term with forward secrecy. In: Google Online Security Blog (2011). http:\/\/googleonlinesecurity.blogspot.co.il\/2011\/11\/protecting-data-for-long-term-with.html"},{"key":"90_CR15","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"PL Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44, 519\u2013521 (1985)","journal-title":"Math. Comput."},{"key":"90_CR16","unstructured":"NIST: Mathematical routines for the NIST prime elliptic curves (2010). http:\/\/www.nsa.gov\/ia\/_files\/nist-routines.pdf"},{"key":"90_CR17","unstructured":"NSS, Mozilla. https:\/\/developer.mozilla.org\/en\/docs\/NSS"},{"key":"90_CR18","unstructured":"OpenSSL git repository. http:\/\/git.openssl.org\/gitweb\/"},{"key":"90_CR19","unstructured":"Renfro, S.: Secure browsing by default. In: Facebook, Facebook Engineering. https:\/\/www.facebook.com\/notes\/facebook-engineering\/secure-browsing-by-default\/10151590414803920"},{"key":"90_CR20","unstructured":"Satler, M., Housley, R.: Suite B Profile for Transport Layer Security (TLS). IETF RFC6460. IETF (2012). http:\/\/tools.ietf.org\/html\/rfc6460"},{"key":"90_CR21","unstructured":"Solinas, J.A.: Generalized Mersenne numbers. Center for Applied Cryptographic Research. University of Waterloo,Technical Report (1999)"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-014-0090-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-014-0090-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-014-0090-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,17]],"date-time":"2019-08-17T17:19:21Z","timestamp":1566062361000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-014-0090-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,17]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["90"],"URL":"https:\/\/doi.org\/10.1007\/s13389-014-0090-x","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,17]]}}}