{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:10:11Z","timestamp":1778263811335,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":31,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_471","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:53:14Z","timestamp":1319709194000},"page":"959-964","source":"Crossref","is-referenced-by-count":0,"title":["Prime Number"],"prefix":"10.1007","author":[{"given":"Anton","family":"Stiglic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"471_CR1_471","series-title":"Lecture notes in mathematics","volume-title":"Primality testing and abelian varieties over finite fields","author":"LM Adleman","year":"1992","unstructured":"Adleman LM, Huang M-DA (1992) Primality testing and abelian varieties over finite fields. Lecture notes in mathematics, vol 1512. Springer, Heidelberg"},{"key":"471_CR2_471","first-page":"173","volume":"117","author":"LM Adleman","year":"1983","unstructured":"Adleman LM, Pomerance C, Rumely RS (1983) On distinguishing prime numbers from composite numbers. Ann Math 117:173\u2013206","journal-title":"Ann Math"},{"key":"471_CR3_471","volume-title":"Prime number generation, primality testing, and primality certificates: X9.80","author":"American National Standards for Financial Services","year":"2001","unstructured":"American National Standards for Financial Services (2001) Prime number generation, primality testing, and primality certificates: X9.80"},{"issue":"4","key":"471_CR4_471","first-page":"789","volume":"11","author":"AOL Atkin","year":"1982","unstructured":"Atkin AOL, Larson RG (1982) On a primality test of Solovay and Strassen. SIAM J Comput 11(4):789\u2013791","journal-title":"SIAM J Comput"},{"key":"471_CR5_471","volume-title":"Lecture notes of a conference","author":"AOL Atkin","year":"1986","unstructured":"Atkin AOL (Aug 1986) Lecture notes of a conference, Boulder, Colorado"},{"issue":"203","key":"471_CR6_471","first-page":"29","volume":"61","author":"AOL Atkin","year":"1993","unstructured":"Atkin AOL, Morain F (Jul 1993) Elliptic curves and primality proving. Math Comput 61(203):29\u201368","journal-title":"Math Comput"},{"issue":"201","key":"471_CR7_471","first-page":"399","volume":"60","author":"AOL Atkin","year":"1992","unstructured":"Atkin AOL, Morain F (Jan 1992) Finding suitable curves for the elliptic curve method of factorization. Math Comput 60(201):399\u2013405","journal-title":"Math Comput"},{"issue":"2","key":"471_CR8_471","first-page":"781","volume":"160","author":"M Agrawal","year":"2004","unstructured":"Agrawal M, Kayal N, Saxena N (2004) PRIMES is in P. Ann Math 160(2):781\u2013793","journal-title":"Ann Math"},{"key":"471_CR9_471","first-page":"53","volume":"1","author":"P Beauchemin","year":"1998","unstructured":"Beauchemin P, Brassard C, Cr\u00e9peau C, Goutier C, Pomerance C (1998) The generation of random numbers that are probably prime. J Cryptol 1:53\u201364","journal-title":"J Cryptol"},{"key":"471_CR10_471","first-page":"1391","volume":"35","author":"RJ Baillie","year":"1980","unstructured":"Baillie RJ, Wagstaff SS Jr (1980) Lucas pseudoprimes. Math Comput 35:1391\u20131417","journal-title":"Math Comput"},{"key":"471_CR11_471","series-title":"Lecture notes in computer science","first-page":"652","volume-title":"Advances in Cryptographic - proceedings of EUROCRYPT\u201889, Houthalen, Belgium, April 10\u201313, 1989","author":"W Bosma","year":"1989","unstructured":"Bosma W, van der Hulst M-P (1989) Workshop on the theory and application of cryptographic techniques. In: Advances in Cryptographic - proceedings of EUROCRYPT\u201889, Houthalen, Belgium, April 10\u201313, 1989. Lecture notes in computer science, vol 434. Springer, Berlin, pp 652\u2013656"},{"key":"471_CR12_471","series-title":"Lecture notes in computer science","first-page":"358","volume-title":"Advances in cryptology\u00a0\u2013 CRYPTO\u201992, Santa Barbara","author":"J Brandt","year":"1993","unstructured":"Brandt J, Damg\u00e5rd I (1993) On generation of probable primes by incremental search. In: Advances in cryptology\u00a0\u2013 CRYPTO\u201992, Santa Barbara. Lecture notes in computer science, vol 740. Springer, Berlin, pp 358\u2013370"},{"issue":"151","key":"471_CR13_471","first-page":"1003","volume":"35","author":"C Pomerance","year":"1980","unstructured":"Pomerance C, Selfridge JL, Wagstaff SS Jr (Jul 1980) The pseudoprimesto $$25 \\times 1{0}^{9}$$. Math Comput 35(151):1003\u20131026","journal-title":"Math Comput"},{"issue":"177","key":"471_CR14_471","first-page":"103","volume":"48","author":"H Cohen","year":"1986","unstructured":"Cohen H, Lenstra AK (Jul 1986) Implementation of a new primality test. Math Comput 48(177):103\u2013121, S1\u2013S4","journal-title":"Math Comput"},{"issue":"165","key":"471_CR15_471","first-page":"297","volume":"42","author":"H Cohen","year":"1984","unstructured":"Cohen H, Lenstra HW Jr (Jan 1984) Primality testing and Jacobi sums. Math Comput 42(165):297\u2013330","journal-title":"Math Comput"},{"issue":"203","key":"471_CR16_471","first-page":"177","volume":"61","author":"I Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd I, Landrock P, Pomerance C (Jul 1993) Average case error estimates for the strong probable prime test. Math Comput 61(203):177\u2013194","journal-title":"Math Comput"},{"key":"471_CR17_471","first-page":"316","volume-title":"Proceedings of the 18th annual ACM symposium on theory of computing","author":"S Goldwasser","year":"1986","unstructured":"Goldwasser S, Kilian J (1986) Almost all primes can be quickly certified. In: Proceedings of the 18th annual ACM symposium on theory of computing, Berkeley, pp 316\u2013329"},{"key":"471_CR18_471","series-title":"Lecture notes in computer science","first-page":"216","volume-title":"Advances in cryptology\u00a0\u2013 proceedings of EUROCRYPT\u201984, Paris","author":"J Gordon","year":"1985","unstructured":"Gordon J (1985) Strong primes are easy to find. In: Advances in cryptology\u00a0\u2013 proceedings of EUROCRYPT\u201984, Paris. Lecture notes in computer science, vol 209. Springer, Berlin, pp 216\u2013223"},{"key":"471_CR19_471","first-page":"32","volume":"72","author":"J Grantham","year":"1998","unstructured":"Grantham J (1998) A probable prime test with high confidence. J Number Theory 72:32\u201347","journal-title":"J Number Theory"},{"key":"471_CR20_471","volume-title":"The art of computer programming \u2013 seminumerical algorithms","author":"D Knuth","year":"1981","unstructured":"Knuth D (1981) The art of computer programming\u00a0\u2013 seminumerical algorithms, vol 2, 2nd edn. Addison-Wesley, Reading"},{"issue":"3","key":"471_CR21_471","first-page":"123","volume":"8","author":"UM Maurer","year":"1995","unstructured":"Maurer UM (1995) Fast generation of prime numbers and secure public-key cryptographic parameters. J Crypto 8(3):123\u2013155","journal-title":"J Crypto"},{"key":"471_CR22_471","series-title":"Lecture notes in computer science","first-page":"636","volume-title":"Advances in cryptology\u00a0\u2013 EUROCRYPT\u201989, Houthalen","author":"UM Maurer","year":"1989","unstructured":"Maurer UM (1989) Fast generation of secure RSA-moduli with almost maximal diversity. In: Advances in cryptology\u00a0\u2013 EUROCRYPT\u201989, Houthalen. Lecture notes in computer science, vol 434. Springer, Berlin, pp 636\u2013647"},{"key":"471_CR23_471","volume-title":"Cyclotomy of rings and primality testing","author":"P Mih\u0103ilescu","year":"1997","unstructured":"Mih\u0103ilescu P (1997) Cyclotomy of rings and primality testing. Ph.D. thesis, Swiss Federal Institute of Technology Z\u00fcrich, Diss. ETH No. 12278"},{"key":"471_CR24_471","first-page":"300","volume":"13","author":"GL Miller","year":"1976","unstructured":"Miller GL (1976) Riemann\u2019s hypothesis and tests for primality. J\u00a0Comput Syst Sci 13:300\u2013317","journal-title":"J Comput Syst Sci"},{"key":"471_CR25_471","unstructured":"NIST (Feb 1993) Digital signature standard. FIPS PUB 186"},{"key":"471_CR26_471","volume-title":"Are there counter-examples to the Baillie-PSW primality test?","author":"C Pomerance","year":"1984","unstructured":"Pomerance C (1984) Are there counter-examples to the Baillie-PSW primality test?"},{"key":"471_CR27_471","first-page":"21","volume-title":"Algorithms and complexity: new directions and recent results","author":"MO Rabin","year":"1976","unstructured":"Rabin MO (1976) Probabilistic algorithms. In: Traub JF (ed) Algorithms and complexity: new directions and recent results. Academic Press, New York, pp 21\u201339"},{"key":"471_CR28_471","first-page":"128","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin MO (1980) A probabilistic algorithm for testing primality. J Number Theory 12:128\u2013138","journal-title":"J Number Theory"},{"key":"471_CR29_471","volume-title":"Are \u2018strong\u2019 primes needed for RSA?","author":"RL Rivest","year":"1998","unstructured":"Rivest RL, Silverman RD (Dec 1998) Are \u2018strong\u2019 primes needed for RSA? Technical Report. RSA Data Security, Redwood City"},{"key":"471_CR30_471","first-page":"875","volume":"22","author":"J Shawe-Taylor","year":"1986","unstructured":"Shawe-Taylor J (Jul 1986) Generating strong primes. Electron Lett 22:875\u2013877","journal-title":"Electron Lett"},{"issue":"1","key":"471_CR31_471","first-page":"84","volume":"6","author":"R Solovay","year":"1977","unstructured":"Solovay R, Strassen V (Mar 1977) A fast Monte-Carlo test for primality. SIAM J Comput 6(1):84\u201385","journal-title":"SIAM J Comput"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T17:26:57Z","timestamp":1778261217000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_471"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_471","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}