{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:25:17Z","timestamp":1777091117506,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":60,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,15]],"date-time":"2018-10-15T00:00:00Z","timestamp":1539561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EPSRC","award":["EP\/P009417\/1"],"award-info":[{"award-number":["EP\/P009417\/1"]}]},{"name":"Horizon 2020","award":["700542"],"award-info":[{"award-number":["700542"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,15]]},"DOI":"10.1145\/3243734.3243787","type":"proceedings-article","created":{"date-parts":[[2018,10,16]],"date-time":"2018-10-16T12:56:36Z","timestamp":1539694596000},"page":"281-298","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Prime and Prejudice"],"prefix":"10.1145","author":[{"given":"Martin R.","family":"Albrecht","sequence":"first","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jake","family":"Massimo","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth G.","family":"Paterson","sequence":"additional","affiliation":[{"name":"Royal Holloway, University of London, Egham, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juraj","family":"Somorovsky","sequence":"additional","affiliation":[{"name":"Ruhr University Bochum, Bochum, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,15]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"PRIMES is in P. Annals of mathematics","author":"Agrawal Manindra","year":"2004","unstructured":"Manindra Agrawal , Neeraj Kayal , and Nitin Saxena . 2004. PRIMES is in P. Annals of mathematics ( 2004 ), 781--793. Manindra Agrawal, Neeraj Kayal, and Nitin Saxena. 2004. PRIMES is in P. Annals of mathematics (2004), 781--793."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1042"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-97-00836-3"},{"key":"e_1_3_2_2_4_1","volume-title":"Elliptic curves and primality proving. Mathematics of computation 61, 203","author":"Atkin A Oliver L","year":"1993","unstructured":"A Oliver L Atkin and Franccois Morain . 1993. Elliptic curves and primality proving. Mathematics of computation 61, 203 ( 1993 ), 29--68. A Oliver L Atkin and Franccois Morain. 1993. Elliptic curves and primality proving. Mathematics of computation 61, 203 (1993), 29--68."},{"key":"e_1_3_2_2_5_1","unstructured":"Robert Baillie. 2013. OEIS A217120: Lucas pseudoprimes. https:\/\/oeis.org\/A217120.  Robert Baillie. 2013. OEIS A217120: Lucas pseudoprimes. https:\/\/oeis.org\/A217120."},{"key":"e_1_3_2_2_6_1","unstructured":"Robert Baillie. 2013. OEIS A217255: Strong Lucas pseudoprimes. https:\/\/oeis.org\/A217255.  Robert Baillie. 2013. OEIS A217255: Strong Lucas pseudoprimes. https:\/\/oeis.org\/A217255."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1980-0583518-6"},{"key":"e_1_3_2_2_8_1","volume-title":"The Magma algebra system. J. Symbolic Comput. 24","author":"Bosma Wieb","year":"1997","unstructured":"Wieb Bosma , John Cannon , and Catherine Playoust . 1997. The Magma algebra system. J. Symbolic Comput. 24 ( 1997 ). Computational algebra and number theory (London , 1993). Wieb Bosma, John Cannon, and Catherine Playoust. 1997. The Magma algebra system. J. Symbolic Comput. 24 (1997). Computational algebra and number theory (London, 1993)."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978395"},{"key":"e_1_3_2_2_10_1","volume-title":"On the Practical Exploitability of Dual EC in TLS Implementations 23rd USENIX Security Symposium (USENIX Security 14)","author":"Checkoway Stephen","year":"2014","unstructured":"Stephen Checkoway , Ruben Niederhagen , Adam Everspaugh , Matthew Green , Tanja Lange , Thomas Ristenpart , Daniel J. Bernstein , Jake Maskiewicz , Hovav Shacham , and Matthew Fredrikson . 2014 . On the Practical Exploitability of Dual EC in TLS Implementations 23rd USENIX Security Symposium (USENIX Security 14) . USENIX Association, San Diego, CA, 319--335. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/checkoway Stephen Checkoway, Ruben Niederhagen, Adam Everspaugh, Matthew Green, Tanja Lange, Thomas Ristenpart, Daniel J. Bernstein, Jake Maskiewicz, Hovav Shacham, and Matthew Fredrikson. 2014. On the Practical Exploitability of Dual EC in TLS Implementations 23rd USENIX Security Symposium (USENIX Security 14). USENIX Association, San Diego, CA, 319--335. https:\/\/www.usenix.org\/conference\/usenixsecurity14\/technical-sessions\/presentation\/checkoway"},{"key":"e_1_3_2_2_11_1","unstructured":"Oracle Corporation. 2018. OpenJDK 10 Open Java Development Kit. openjdk.java.net  Oracle Corporation. 2018. OpenJDK 10 Open Java Development Kit. openjdk.java.net"},{"key":"e_1_3_2_2_12_1","first-page":"136","volume-title":"Prime numbers: a computational perspective","author":"Crandall Richard","unstructured":"Richard Crandall and Carl Pomerance . 2006. Prime numbers: a computational perspective . Vol. 182 . Springer Science & Business Media . pp. 136 -- 140 . Richard Crandall and Carl Pomerance. 2006. Prime numbers: a computational perspective. Vol. 182. Springer Science & Business Media. pp.136--140."},{"key":"e_1_3_2_2_13_1","unstructured":"Wei Dai. 2018. Crypto+. https:\/\/www.cryptopp.com\/.  Wei Dai. 2018. Crypto+. https:\/\/www.cryptopp.com\/."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1993-1189518-9"},{"key":"e_1_3_2_2_15_1","unstructured":"Tom St Denis. 2018. LibTomCrypt. http:\/\/www.libtom.net\/LibTomCrypt\/.  Tom St Denis. 2018. LibTomCrypt. http:\/\/www.libtom.net\/LibTomCrypt\/."},{"key":"e_1_3_2_2_16_1","unstructured":"Tom St Denis. 2018. LibTomMath. http:\/\/www.libtom.net\/LibTomMath\/.  Tom St Denis. 2018. LibTomMath. http:\/\/www.libtom.net\/LibTomMath\/."},{"key":"e_1_3_2_2_17_1","unstructured":"Tom St Denis. 2018. TomsFastMath. http:\/\/www.libtom.net\/TomsFastMath\/.  Tom St Denis. 2018. TomsFastMath. http:\/\/www.libtom.net\/TomsFastMath\/."},{"key":"e_1_3_2_2_18_1","unstructured":"T. Dierks and E. Rescorla. 2008. The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (Proposed Standard). 104 pages. Updated by RFCs 5746 5878 6176 7465 7507 7568 7627 7685 7905 7919.  T. Dierks and E. Rescorla. 2008. The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246 (Proposed Standard). 104 pages. Updated by RFCs 5746 5878 6176 7465 7507 7568 7627 7685 7905 7919."},{"key":"e_1_3_2_2_19_1","volume-title":"A Kilobit Hidden SNFS Discrete Logarithm Computation EUROCRYPT","author":"Fried Joshua","year":"2017","unstructured":"Joshua Fried , Pierrick Gaudry , Nadia Heninger , and Emmanuel Thom\u00e9 . 2017. A Kilobit Hidden SNFS Discrete Logarithm Computation EUROCRYPT 2017 , Part I (LNCS), , Jean-S\u00e9bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10210 . Springer , Heidelberg, 202--231. Joshua Fried, Pierrick Gaudry, Nadia Heninger, and Emmanuel Thom\u00e9. 2017. A Kilobit Hidden SNFS Discrete Logarithm Computation EUROCRYPT 2017, Part I (LNCS), , Jean-S\u00e9bastien Coron and Jesper Buus Nielsen (Eds.), Vol. 10210. Springer, Heidelberg, 202--231."},{"key":"e_1_3_2_2_20_1","unstructured":"Jeff Gilchrist. 2013. Pseudoprime Enumeration with Probabilistic Primality Tests. http:\/\/gilchrist.ca\/jeff\/factoring\/pseudoprimes.html.  Jeff Gilchrist. 2013. Pseudoprime Enumeration with Probabilistic Primality Tests. http:\/\/gilchrist.ca\/jeff\/factoring\/pseudoprimes.html."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"D. Gillmor. 2016. Negotiated Finite Field Diffie-Hellman Ephemeral Parameters for Transport Layer Security (TLS). RFC 7919 (Proposed Standard). 29 pages.  D. Gillmor. 2016. Negotiated Finite Field Diffie-Hellman Ephemeral Parameters for Transport Layer Security (TLS). RFC 7919 (Proposed Standard). 29 pages.","DOI":"10.17487\/RFC7919"},{"key":"e_1_3_2_2_22_1","unstructured":"Google. 2018. The Go Programming Language. https:\/\/golang.org.  Google. 2018. The Go Programming Language. https:\/\/golang.org."},{"key":"e_1_3_2_2_23_1","volume-title":"GNU MP: The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org.","author":"Granlund Torbjorn","year":"2018","unstructured":"Torbjorn Granlund and the GMP development team. 2018 . GNU MP: The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org. Torbjorn Granlund and the GMP development team. 2018. GNU MP: The GNU Multiple Precision Arithmetic Library. https:\/\/gmplib.org."},{"key":"e_1_3_2_2_24_1","unstructured":"Peter Gutmann. 2018. CryptLib. http:\/\/www.cryptlib.com\/.  Peter Gutmann. 2018. CryptLib. http:\/\/www.cryptlib.com\/."},{"key":"e_1_3_2_2_25_1","unstructured":"Andreas H\u00f6glund. 2016. MPZ_SPSP's under GMP 5.0.1. http:\/\/www.hoegge.dk\/gmp\/gmp501.htm. Last accessed 2016--10--31.  Andreas H\u00f6glund. 2016. MPZ_SPSP's under GMP 5.0.1. http:\/\/www.hoegge.dk\/gmp\/gmp501.htm. Last accessed 2016--10--31."},{"key":"e_1_3_2_2_26_1","unstructured":"WolfSSL Inc. 2018. Pull request - Prime Number Testing. https:\/\/github.com\/wolfSSL\/wolfssl\/pull\/1665.  WolfSSL Inc. 2018. Pull request - Prime Number Testing. https:\/\/github.com\/wolfSSL\/wolfssl\/pull\/1665."},{"key":"e_1_3_2_2_27_1","unstructured":"WolfSSL Inc. 2018. WolfSSL. https:\/\/www.wolfssl.com\/wolfSSL\/Home.html.  WolfSSL Inc. 2018. WolfSSL. https:\/\/www.wolfssl.com\/wolfSSL\/Home.html."},{"key":"e_1_3_2_2_28_1","unstructured":"Dana Jacobsen. 2015. Pseudoprime Statistics Tables and Data. http:\/\/ntheory.org\/pseudoprimes.html.  Dana Jacobsen. 2015. Pseudoprime Statistics Tables and Data. http:\/\/ntheory.org\/pseudoprimes.html."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1993-1192971-8"},{"key":"e_1_3_2_2_30_1","unstructured":"Werner Koch. 2005. GitHub - Libgcrypt changes to default primality test. https:\/\/github.com\/gpg\/libgcrypt\/commit\/78a84338cb36748f17cc444b17ab7033ce384c34#diff-96a06fc4d0080caec00d423ca08a6c86.  Werner Koch. 2005. GitHub - Libgcrypt changes to default primality test. https:\/\/github.com\/gpg\/libgcrypt\/commit\/78a84338cb36748f17cc444b17ab7033ce384c34#diff-96a06fc4d0080caec00d423ca08a6c86."},{"key":"e_1_3_2_2_31_1","unstructured":"Werner Koch. 2018. Libgcrypt. https:\/\/gnupg.org\/software\/libgcrypt\/index.html.  Werner Koch. 2018. Libgcrypt. https:\/\/gnupg.org\/software\/libgcrypt\/index.html."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"M. Lepinski and S. Kent. 2008. Additional Diffie-Hellman Groups for Use with IETF Standards. RFC 5114 (Informational). 23 pages.  M. Lepinski and S. Kent. 2008. Additional Diffie-Hellman Groups for Use with IETF Standards. RFC 5114 (Informational). 23 pages.","DOI":"10.17487\/rfc5114"},{"key":"e_1_3_2_2_33_1","unstructured":"LibTomMath. 2018. Pull request - Added Fips 186.4 compliance an additional strong Lucas-Selfridge (for BPSW). https:\/\/github.com\/libtom\/libtommath\/pull\/113.  LibTomMath. 2018. Pull request - Added Fips 186.4 compliance an additional strong Lucas-Selfridge (for BPSW). https:\/\/github.com\/libtom\/libtommath\/pull\/113."},{"key":"e_1_3_2_2_34_1","unstructured":"Dwayne C. Litzenberger. 2009. PyCrypto 2.1.0. https:\/\/pypi.python.org\/pypi\/pycrypto\/2.1.0.  Dwayne C. Litzenberger. 2009. PyCrypto 2.1.0. https:\/\/pypi.python.org\/pypi\/pycrypto\/2.1.0."},{"key":"e_1_3_2_2_35_1","unstructured":"Telegram FZ LLC. 2018. Telegram Messenger. https:\/\/telegram.org.  Telegram FZ LLC. 2018. Telegram Messenger. https:\/\/telegram.org."},{"key":"e_1_3_2_2_36_1","unstructured":"Jack Lloyd. 2018 a. Botan. https:\/\/github.com\/randombit\/botan.  Jack Lloyd. 2018 a. Botan. https:\/\/github.com\/randombit\/botan."},{"key":"e_1_3_2_2_37_1","unstructured":"Jack Lloyd. 2018 b. Botan Pull Request - Add Lucas test from FIPS 186--4. https:\/\/github.com\/randombit\/botan\/pull\/1636.  Jack Lloyd. 2018 b. Botan Pull Request - Add Lucas test from FIPS 186--4. https:\/\/github.com\/randombit\/botan\/pull\/1636."},{"key":"e_1_3_2_2_38_1","unstructured":"Marcel Martin. 2016. PRIMO--Primality Proving. https:\/\/www.ellipsa.eu  Marcel Martin. 2016. PRIMO--Primality Proving. https:\/\/www.ellipsa.eu"},{"key":"e_1_3_2_2_39_1","unstructured":"Jud McCranie. 1997. OEIS A014233: Smallest odd number for which Miller-Rabin primality test on bases less than or equal to the n-th prime does not reveal compositeness. https:\/\/oeis.org\/A014233.  Jud McCranie. 1997. OEIS A014233: Smallest odd number for which Miller-Rabin primality test on bases less than or equal to the n-th prime does not reveal compositeness. https:\/\/oeis.org\/A014233."},{"key":"e_1_3_2_2_40_1","volume-title":"Paul C Van Oorschot, and Scott A Vanstone","author":"Menezes Alfred J","year":"1996","unstructured":"Alfred J Menezes , Paul C Van Oorschot, and Scott A Vanstone . 1996 . Handbook of applied cryptography. CRC press . Alfred J Menezes, Paul C Van Oorschot, and Scott A Vanstone. 1996. Handbook of applied cryptography. CRC press."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803773"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90007-9"},{"key":"e_1_3_2_2_43_1","unstructured":"Shyam Narayanan. 2014. Improving the Speed and Accuracy of the Miller-Rabin Primality Test. MIT PRIMES-USA. https:\/\/math.mit.edu\/research\/highschool\/primes\/materials\/2014\/Narayanan.pdf  Shyam Narayanan. 2014. Improving the Speed and Accuracy of the Miller-Rabin Primality Test. MIT PRIMES-USA. https:\/\/math.mit.edu\/research\/highschool\/primes\/materials\/2014\/Narayanan.pdf"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133969"},{"key":"e_1_3_2_2_45_1","unstructured":"Thomas Nicely. 2016. GNU GMP mpz_probab_prime_p Pseudoprimes. http:\/\/www.trnicely.net\/misc\/mpzspsp.html. Last accessed 2016--10--31.  Thomas Nicely. 2016. GNU GMP mpz_probab_prime_p Pseudoprimes. http:\/\/www.trnicely.net\/misc\/mpzspsp.html. Last accessed 2016--10--31."},{"key":"e_1_3_2_2_46_1","unstructured":"Legion of the Bouncy Castle Inc.. 2018. The Bouncy Castle Crypto Package For C Sharp. https:\/\/github.com\/bcgit\/bc-csharp  Legion of the Bouncy Castle Inc.. 2018. The Bouncy Castle Crypto Package For C Sharp. https:\/\/github.com\/bcgit\/bc-csharp"},{"key":"e_1_3_2_2_47_1","unstructured":"GitHub The OpenSSL Project. 2018. Pull request - Increase number of MR tests for RSA prime generation #6075. https:\/\/github.com\/openssl\/openssl\/pull\/6075.  GitHub The OpenSSL Project. 2018. Pull request - Increase number of MR tests for RSA prime generation #6075. https:\/\/github.com\/openssl\/openssl\/pull\/6075."},{"key":"e_1_3_2_2_48_1","unstructured":"The OpenSSL Project. 2018. OpenSSL: The Open Source toolkit for SSL\/TLS. www.openssl.org.  The OpenSSL Project. 2018. OpenSSL: The Open Source toolkit for SSL\/TLS. www.openssl.org."},{"key":"e_1_3_2_2_49_1","unstructured":"Carl Pomerance. 1984. Are there counter-examples to the Baillie-PSW primality test. Dopo Le Parole aangeboden aan Dr. A. K. Lenstra..  Carl Pomerance. 1984. Are there counter-examples to the Baillie-PSW primality test. Dopo Le Parole aangeboden aan Dr. A. K. Lenstra.."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1090\/S0025-5718-1980-0572872-7","article-title":"The pseudoprimes to $25cdot 10^9$","volume":"35","author":"Pomerance Carl","year":"1980","unstructured":"Carl Pomerance , John L Selfridge , and Samuel S Wagstaff . 1980 . The pseudoprimes to $25cdot 10^9$ . Math. Comp. 35 , 151 (1980), 1003 -- 1026 . Carl Pomerance, John L Selfridge, and Samuel S Wagstaff. 1980. The pseudoprimes to $25cdot 10^9$. Math. Comp. 35, 151 (1980), 1003--1026.","journal-title":"Math. Comp."},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(80)90084-0"},{"key":"e_1_3_2_2_52_1","volume-title":"IL, 2018.","author":"Research Wolfram","year":"2018","unstructured":"Wolfram Research , Inc. . 2018 . Mathematica, Version 11.3. Champaign , IL, 2018. Wolfram Research, Inc.. 2018. Mathematica, Version 11.3. Champaign, IL, 2018."},{"key":"e_1_3_2_2_53_1","unstructured":"Gerhard Rieger. 2016. Socat security advisory 7 - Openwall oss-security mailing list. http:\/\/www.openwall.com\/lists\/oss-security\/2016\/02\/01\/4  Gerhard Rieger. 2016. Socat security advisory 7 - Openwall oss-security mailing list. http:\/\/www.openwall.com\/lists\/oss-security\/2016\/02\/01\/4"},{"key":"e_1_3_2_2_54_1","volume-title":"mbox","author":"William Stein","year":"2017","unstructured":"William Stein et al mbox .. 2017 . Sage Mathematics Software Version 8.2. The Sage Development Team . Available at http:\/\/www.sagemath.org William Stein et almbox.. 2017. Sage Mathematics Software Version 8.2. The Sage Development Team. Available at http:\/\/www.sagemath.org"},{"key":"e_1_3_2_2_55_1","volume-title":"An Analysis of OpenSSL's Random Number Generator EUROCRYPT","author":"Strenzke Falko","year":"2016","unstructured":"Falko Strenzke . 2016. An Analysis of OpenSSL's Random Number Generator EUROCRYPT 2016 , Part I (LNCS), , Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.), Vol. 9665 . Springer , Heidelberg, 644--669. Falko Strenzke. 2016. An Analysis of OpenSSL's Random Number Generator EUROCRYPT 2016, Part I (LNCS), , Marc Fischlin and Jean-S\u00e9bastien Coron (Eds.), Vol. 9665. Springer, Heidelberg, 644--669."},{"key":"e_1_3_2_2_56_1","unstructured":"SymPy. 2017. SymPy GitHub repository. Available at https:\/\/github.com\/sympy\/sympy\/commit\/9e35a94eceaff73b350794dcc70b4a412dc2f6e6#diff-e20bc128d13486b598a04fce77584900.  SymPy. 2017. SymPy GitHub repository. Available at https:\/\/github.com\/sympy\/sympy\/commit\/9e35a94eceaff73b350794dcc70b4a412dc2f6e6#diff-e20bc128d13486b598a04fce77584900."},{"key":"e_1_3_2_2_57_1","unstructured":"SymPy Development Team. 2017. SymPy: Python library for symbolic mathematics. http:\/\/www.sympy.org  SymPy Development Team. 2017. SymPy: Python library for symbolic mathematics. http:\/\/www.sympy.org"},{"key":"e_1_3_2_2_58_1","volume-title":"Measuring small subgroup attacks against Diffie-Hellman NDSS","author":"Valenta Luke","year":"2017","unstructured":"Luke Valenta , David Adrian , Antonio Sanso , Shaanan Cohney , Joshua Fried , Marcella Hastings , J. Alex Halderman , and Nadia Heninger . 2017. Measuring small subgroup attacks against Diffie-Hellman NDSS 2017 . The Internet Society . Luke Valenta, David Adrian, Antonio Sanso, Shaanan Cohney, Joshua Fried, Marcella Hastings, J. Alex Halderman, and Nadia Heninger. 2017. Measuring small subgroup attacks against Diffie-Hellman NDSS 2017. The Internet Society."},{"key":"e_1_3_2_2_59_1","unstructured":"Eric W. Weisstein. 2018. Baillie-PSW Primality Test From MathWorld- A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Baillie-PSWPrimalityTest.html.  Eric W. Weisstein. 2018. Baillie-PSW Primality Test From MathWorld- A Wolfram Web Resource. http:\/\/mathworld.wolfram.com\/Baillie-PSWPrimalityTest.html."},{"key":"e_1_3_2_2_61_1","volume-title":"JSBN: RSA and ECC in JavaScript","author":"Wu Tom","year":"2017","unstructured":"Tom Wu . 2017 . JSBN: RSA and ECC in JavaScript . http:\/\/www-cs-students.stanford.edu\/tjw\/jsbn\/. Tom Wu. 2017. JSBN: RSA and ECC in JavaScript. http:\/\/www-cs-students.stanford.edu\/tjw\/jsbn\/."}],"event":{"name":"CCS '18: 2018 ACM SIGSAC Conference on Computer and Communications Security","location":"Toronto Canada","acronym":"CCS '18","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243787","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3243734.3243787","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:08:18Z","timestamp":1750212498000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3243734.3243787"}},"subtitle":["Primality Testing Under Adversarial Conditions"],"short-title":[],"issued":{"date-parts":[[2018,10,15]]},"references-count":60,"alternative-id":["10.1145\/3243734.3243787","10.1145\/3243734"],"URL":"https:\/\/doi.org\/10.1145\/3243734.3243787","relation":{},"subject":[],"published":{"date-parts":[[2018,10,15]]},"assertion":[{"value":"2018-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}