{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:17:02Z","timestamp":1758043022329,"version":"3.44.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030590123"},{"type":"electronic","value":"9783030590130"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-59013-0_11","type":"book-chapter","created":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T10:03:03Z","timestamp":1599904983000},"page":"209-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fooling Primality Tests on Smartcards"],"prefix":"10.1007","author":[{"given":"Vladimir","family":"Sedlacek","sequence":"first","affiliation":[]},{"given":"Jan","family":"Jancar","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Svenda","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,13]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., Massimo, J., Paterson, K.G., Somorovsky, J.: Prime and prejudice: primality testing under adversarial conditions. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 281\u2013298. ACM, New York (2018). https:\/\/doi.org\/10.1145\/3243734.3243787","DOI":"10.1145\/3243734.3243787"},{"key":"11_CR2","unstructured":"American National Standard X9.62-1998, Public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA). Preliminary draft, Accredited Standards Committee X9 (1998)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/jsco","volume":"20","author":"F Arnault","year":"1995","unstructured":"Arnault, F.: Constructing Carmichael numbers which are strong pseudoprimes to several bases. J. Symb. Comput. 20(2), 151\u2013161 (1995). https:\/\/doi.org\/10.1006\/jsco","journal-title":"J. Symb. Comput."},{"issue":"209","key":"11_CR4","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1090\/S0025-5718-1995-1260124-2","volume":"64","author":"F Arnault","year":"1995","unstructured":"Arnault, F.: Rabin-Miller primality test: composite numbers which pass it. Math. Comput. 64(209), 355\u2013361 (1995). https:\/\/doi.org\/10.1090\/S0025-5718-1995-1260124-2","journal-title":"Math. Comput."},{"key":"11_CR5","unstructured":"Bernstein, D.J., Lange, T.: SafeCurves: choosing safe curves for elliptic-curve cryptography (2017). https:\/\/safecurves.cr.yp.to\/"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-33481-8_9","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2012","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Lange, T., Schwabe, P.: The security impact of a new cryptographic library. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol. 7533, pp. 159\u2013176. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33481-8_9"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44598-6_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Biehl","year":"2000","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 131\u2013146. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_8"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Blake-Wilson, S., Bolyard, N., Gupta, V., Hawk, C., Moeller, B.: Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS). RFC 4492, pp. 1\u201335. RFC Editor (2006)","DOI":"10.17487\/rfc4492"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-540-30580-4_2","volume-title":"Public Key Cryptography - PKC 2005","author":"D Bleichenbacher","year":"2005","unstructured":"Bleichenbacher, D.: Breaking a cryptographic protocol with pseudoprimes. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 9\u201315. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_2"},{"key":"11_CR10","unstructured":"Br\u00f6ker, R.: Constructing elliptic curves of prescribed order. Thomas Stieltjes Institute for Mathematics (2006)"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Checkoway, S., et al.: A systematic analysis of the juniper dual EC incident. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 468\u2013479 (2016). https:\/\/doi.org\/10.1145\/2976749.2978395","DOI":"10.1145\/2976749.2978395"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Dorey, K., Chang-Fong, N., Essex, A.: Indiscreet Logs: Persistent Diffie-Hellman Backdoors in TLS (2016). https:\/\/eprint.iacr.org\/2016\/999","DOI":"10.14722\/ndss.2017.23006"},{"key":"11_CR13","unstructured":"EnigmaBridge: Curated list of JavaCard applications (2019). https:\/\/github.com\/EnigmaBridge\/javacard-curated-list. Accessed 17 Mar 2020"},{"key":"11_CR14","unstructured":"Federal Information Processing Standards Publication 186-4 Digital Signature Standard (DSS). Standard, National Institute for Standards and Technology (2013)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-56620-7_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"J Fried","year":"2017","unstructured":"Fried, J., Gaudry, P., Heninger, N., Thom\u00e9, E.: A kilobit hidden SNFS discrete logarithm computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 202\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_8"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-030-17259-6_13","volume-title":"Public-Key Cryptography \u2013 PKC 2019","author":"SD Galbraith","year":"2019","unstructured":"Galbraith, S.D., Massimo, J., Paterson, K.G.: Safety in numbers: on the need for robust Diffie-Hellman parameter validation. In: Lin, D., Sako, K. (eds.) PKC 2019. LNCS, vol. 11443, pp. 379\u2013407. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_13"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Harkins, D.: Synthetic Initialization Vector (SIV) Authenticated Encryption Using the Advanced Encryption Standard (AES). RFC 5297, pp. 1\u201326. RFC Editor (2008)","DOI":"10.17487\/rfc5297"},{"key":"11_CR18","unstructured":"Doc 9303 - Machine Readable Travel Documents. Document, International Civil Aviation Organization (2015)"},{"key":"11_CR19","unstructured":"IEEE Standard - Specifications for Public-Key Cryptography. Standard, IEEE Std 1363-2000 Working Group (2000)"},{"key":"11_CR20","unstructured":"Jancar, J.: ecgen (2019). https:\/\/github.com\/J08nY\/ecgen"},{"key":"11_CR21","unstructured":"Jancar, J., Svenda, P.: ECTester (2019). https:\/\/crocs-muni.github.io\/ECTester\/"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Massimo, J., Paterson, K.G.: A Performant, Misuse-Resistant API for Primality Testing (2020). https:\/\/eprint.iacr.org\/2020\/065","DOI":"10.1145\/3372297.3417264"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Miller, G.L.: Riemann\u2019s hypothesis and tests for primality. In: Proceedings of the Seventh Annual ACM Symposium on Theory of Computing, STOC 1975, Albuquerque, New Mexico, USA, pp. 234\u2013239. ACM (1975). https:\/\/doi.org\/10.1145\/800116.803773","DOI":"10.1145\/800116.803773"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(80)90007-9","volume":"12","author":"L Monier","year":"1980","unstructured":"Monier, L.: Evaluation and comparison of two efficient probabilistic primality testing algorithms. Theor. Comput. Sci. 12(1), 97\u2013108 (1980). https:\/\/doi.org\/10.1016\/0304-3975(80)90007-9","journal-title":"Theor. Comput. Sci."},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Nemec, M., Sys, M., Svenda, P., Klinec, D., Matyas, V.: The return of coppersmith\u2019s attack: practical factorization of widely used RSA moduli. In: 24th ACM Conference on Computer and Communications Security (CCS 2017), pp. 1631\u20131648. ACM, New York (2017). https:\/\/doi.org\/10.1145\/3133956.3133969","DOI":"10.1145\/3133956.3133969"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Nir, Y., Josefsson, S., Pegourie-Gonnard, M.: Elliptic Curve Cryptography (ECC) Cipher Suites for Transport Layer Security (TLS) Versions 1.2 and Earlier. RFC 8422, pp. 1\u201334. RFC Editor (2018)","DOI":"10.17487\/RFC8422"},{"key":"11_CR27","unstructured":"Special Publication 800-89: Recommendation for Obtaining Assurances for Digital Signature Applications. Standard, National Institute for Standards and Technology (2006)"},{"key":"11_CR28","unstructured":"NSA: Windows CryptoAPI Spoofing Vulnerability (CVE-2020-0601) (2020). https:\/\/nvd.nist.gov\/vuln\/detail\/CVE-2020-0601. Accessed 17 Mar 2020"},{"key":"11_CR29","unstructured":"Oracle: Java Card API 3.0.5, Classic Edition (2019). https:\/\/docs.oracle.com\/javacard\/3.0.5\/api\/index.html. Accessed 17 Mar 2020"},{"issue":"1","key":"11_CR30","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S Pohlig","year":"1978","unstructured":"Pohlig, S., Hellman, M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory 24(1), 106\u2013110 (1978). https:\/\/doi.org\/10.1109\/TIT.1978.1055817","journal-title":"IEEE Trans. Inf. Theory"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Polk, T., Housley, R., Bassham, L.: Algorithms and Identifiers for the Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3279, pp. 1\u201327. RFC Editor (2002)","DOI":"10.17487\/rfc3280"},{"key":"11_CR32","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. J. Number Theory 12, 128\u2013138 (1980). https:\/\/doi.org\/10.1016\/0022-314X(80)90084-0","journal-title":"J. Number Theory"},{"key":"11_CR33","unstructured":"Svenda, P.: JCAlgTest: detailed analysis of cryptographic smart cards running with Java- Card platform (2019). https:\/\/www.fi.muni.cz\/xsvenda\/jcalgtest\/. Accessed 17 Mar 2020"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Takahashi, A., Tibouchi, M.: Degenerate Fault Attacks on Elliptic Curve Parameters in OpenSSL (2019). https:\/\/eprint.iacr.org\/2019\/400","DOI":"10.1109\/EuroSP.2019.00035"},{"key":"11_CR35","unstructured":"The CADO-NFS Development Team: CADO-NFS, An Implementation of the Number Field Sieve Algorithm. Release 2.3.0. (2017). http:\/\/cado-nfs.gforge.inria.fr"},{"key":"11_CR36","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 8.9) (2019). https:\/\/www.sagemath.org"},{"key":"11_CR37","doi-asserted-by":"publisher","DOI":"10.1201\/9781420071474","volume-title":"Elliptic Curves: Number Theory and Cryptography","author":"LC Washington","year":"2008","unstructured":"Washington, L.C.: Elliptic Curves: Number Theory and Cryptography, 2nd edn. Chapman & Hall\/CRC, Boca Raton (2008)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59013-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:04:32Z","timestamp":1757628272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59013-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590123","9783030590130"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59013-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"13 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guildford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/esorics2020.sccs.surrey.ac.uk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"366","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":"72","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":"20% - 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,16","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":"9,1","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":"The conference was held virtually due to the COVID-10 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}