@string{LNCS = "Lecture Notes in Computer Science"} @Article{Bach:1988:HGF, author = "Eric Bach", title = "How to generate factored random numbers", journal = "SIAM Journal on Computing", volume = "17", number = "2", pages = "179--193", month = apr, year = "1988", CODEN = "SMJCAT", ISSN = "0097-5397 (print), 1095-7111 (electronic)", MRclass = "11Y16 (11Y11 68Q25)", MRnumber = "89e:11082", mrreviewer = "Claus-Peter Schnorr", bibdate = "Thu Apr 09 08:30:16 1998", note = "Special issue on cryptography.", acknowledgement = ack-nhfb, } @Article{Bach:1997:sppr, author = {Eric Bach}, title = {Comments on Search Procedures for Primitive Roots}, journal = {Mathematics of Computation}, year = 1997, volume = 66, number = 220, pages = "1719--1727", month = oct, } @Book{Bach:1996:ANTEA, author = "Eric Bach and Jeffrey Shallit", title = "Algorithmic Number Theory: Efficient Algorithms", year =1996, publisher = "MIT press", URL = "http://www.math.uwaterloo.ca/~shallit/anterrata.html (Errata \& Addenda)", } @Article{Blum:1984:BMSSPR, author = "Manuel Blum and Silvio Micali", title = "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits", journal = "{SIAM Journal on Computing}", volume = "13", annote = "Introduction of cryptographically secure pseudorandom generators. Also (according to \cite{NaoRei97} introduced notion of random self-reducibility (and randomized reduction). Journal version of a paper which appeared in \cite{FOCS82}, pp. 112--117.", year = "1984", pages = "850--864", number = "4", month = nov, added-at = "Thu Jan 18 10:39:28 2001", } @misc{Cameron:2003:lambdaroots, author="Peter J. Cameron and D. A. Preece", title = "Notes on primitive $\lambda-$roots", year = 2003, month = mar, note = "\url{http://www.maths.qmul.ac.uk/~pjc/csgnotes/}\url{lambda.pdf}", } @book{Crandall:2001:PNaCP, author="Richard Crandall and Carl Pomerance", title="Prime Numbers, a computational perspective", year = 2001, isbn=0387947779, publisher="Springer", } @InProceedings{Davenport:1992:PTR, author = "J. H. Davenport", title = "Primality testing revisited", editor = "Paul S. Wang", booktitle = "Proceedings of {ISSAC} '92. International Symposium on Symbolic and Algebraic Computation", publisher = "ACM Press", address = "New York, NY 10036, USA", ISBN = "0-89791-489-9 (soft cover), 0-89791-490-2 (hardcover)", pages = "123--129", year = "1992", bibdate = "Thu Mar 12 08:39:32 MST 1998", URL = "http://www.acm.org:80/pubs/citations/proceedings/issac/143242/p123-davenport/", acknowledgement = ack-nhfb, keywords = "algorithms", } @article{Diffie:1976:NDC, author = "Whitfield Diffie and Martin E. Hellman", title = "New Directions in Cryptography", journal = "IEEE Transactions on Information Theory", volume = "IT-22", number = "6", pages = "644--654", year = "1976", url = "citeseer.nj.nec.com/diffie76new.html" } @article{Elliott:1997:ALPR, author = "Peter D. T. A. Elliott and Murata, Leo", title = "On the average of the least primitive root modulo p", journal = "Journal of The london Mathematical Society", volume = 56, number = 2, pages ="435--454", year = 1997, language = "{English}", } @article{Erdos:1991:CLF, author="Paul Erd{\"o}s and Carl Pomerance and Eric Schmutz", title ="Carmichael's lambda function", journal = "Acta Arithmetica", volume = 58, year = 1991, pages = "363--385", } @Article{Friedlander:2001:PPG, author = "John B. Friedlander and Carl Pomerance and Igor Shparlinski", title = "Period of the power generator and small values of {Carmichael}'s function", journal = "Mathematics of Computation", volume = "70", number = "236", pages = "1591--1605", month = oct, year = "2001", CODEN = "MCMPAF", ISSN = "0025-5718 (paper), 1088-6842 (electronic)", bibdate = "Mon Jul 16 07:53:14 MDT 2001", note = "See corrigendum \cite{Friedlander:2002:CPP}.", URL = "http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01282-5/S0025-5718-00-01282-5.pdf", acknowledgement = ack-nhfb, } note = "See \cite{Friedlander:2001:PPG}.", URL = "http://www.ams.org/mcom/2002-71-240/S0025-5718-02-01519-3/S0025-5718-02-01519-3.pdf", acknowledgement = ack-nhfb, } note = "See corrigendum \cite{Friedlander:2002:CPP}.", URL = "http://www.ams.org/mcom/2001-70-236/S0025-5718-00-01282-5/S0025-5718-00-01282-5.pdf", acknowledgement = ack-nhfb, } @Article{Friedlander:2002:CPP, author = "John B. Friedlander and Carl Pomerance and Igor Shparlinski", title = "Corrigendum to {``Period of the power generator and small values of Carmichael's function''}", journal = "Mathematics of Computation", volume = "71", number = "240", pages = "1803--1806", month = oct, year = "2002", CODEN = "MCMPAF", ISSN = "0025-5718", bibdate = "Fri Nov 22 10:22:25 MST 2002", note = "See \cite{Friedlander:2001:PPG}.", URL = "http://www.ams.org/mcom/2002-71-240/S0025-5718-02-01519-3/S0025-5718-02-01519-3.pdf", acknowledgement = ack-nhfb, } @Article{VonzurGathen:1998:OGP, author ="Joachim {von zur} Gathen and Igor Shparlinski", title = "Orders of {Gauss} Periods in Finite Fields", journal ="Applicable Algebra in Engineering, Communication and Computing", volume = "9", year = "1998", pages = "15-24", reviews = "Zbl. 0931.11057", } @Book{Hardy:1979:ITN, author = "Godfrey Harold Hardy and E. Maitland Wright", title = "An Introduction to the Theory of Numbers", publisher = "Oxford University Press", year = "1979", edition = "Fifth", keywords = "reference, number theory", } @techreport{Itoh:2001:PPR, author = "Itoh, Toshiya and Tsujii, Shigeo", title = "How to Generate a Primitive Root Modulo a Prime", year = 2001, number = "009-002", institution = "IPSJ SIGNotes ALgorithms Abstract", } @Book{Knuth:1997:TAoCPSA, author = "Donald E. Knuth", title = "Seminumerical Algorithms", volume = "2", publisher = "Ad{\-d}i{\-s}on-Wes{\-l}ey", address = "Reading, MA, USA", edition = "$2^{nd}$", year = "1997", ISBN = "0-201-89684-2", LCCN = "QA76.6 .K64 1997", series = "The Art of Computer Programming", } @Book{Koblitz:1987:CNT, author = "Neal Koblitz", title = "A course in number theory and cryptography", volume = "114", publisher = "Spring{\-}er-Ver{\-}lag", address = "Berlin, Germany~/ Heidelberg, Germany~/ London, UK~/, etc.", year = "1987", ISBN = "0-387-96576-9", LCCN = "QA241 .K6721 1987", bibdate = "Sat Oct 17 16:25:07 MDT 1998", price = "US\$29.80", series = "Graduate texts in mathematics", acknowledgement = ack-nhfb, keywords = "cryptography; number theory", } @InProceedings{Miller:1975:Riemann, title = "Riemann's Hypothesis and Tests for Primality", author = "Gary L. Miller", pages = "234--239", booktitle = "Conference Record of Seventh Annual {ACM} Symposium on Theory of Computation", month = may, day = "5--7", year = "1975", address = "Albuquerque, New Mexico", } @article{Muller:2004:lambdaroots, author = "Thomas W. M{\"u}ller and Jan-Christof Schlage-Puchta", title = "On the number of primitive $\lambda-$roots", journal = "Acta Arithmetica", year = 2004, volume = 115, number = 3, pages = "217--223", } @Article{OGorman:1996:FTC, author = "T. J. O'Gorman and J. M. Ross and A. H. Taber and J. F. Ziegler and H. P. Muhlfeld and C. J. Montrose and H. W. Curtis and J. L. Walsh", title = "Field testing for cosmic ray soft errors in semiconductor memories", journal = "IBM Journal of Research and Development", volume = "40", number = "1", pages = "41--50", month = jan, year = "1996", CODEN = "IBMJAE", ISSN = "0018-8646", bibdate = "Tue Mar 25 14:26:59 MST 1997", URL = "http://www.almaden.ibm.com/journal/rd40-1.html#four", abstract = "This paper presents a review of experiments performed by IBM to investigate the causes of soft errors in semiconductor memory chips under field test conditions. The effects of alpha-particles and cosmic rays are separated by comparing multiple measurements of the soft-error rate (SER) of samples of memory chips deep underground and at various altitudes above the earth. The results of case studies on four different memory chips show that cosmic rays are an important source of the ionizing radiation that causes soft errors. The results of field testing are used to confirm the accuracy of the modeling and the accelerated testing of chips.", acknowledgement = ack-nhfb, classcodes = "B1265D (Memory circuits); B0170E (Production facilities and engineering); B2570 (Semiconductor integrated circuits); B0170N (Reliability)", corpsource = "IBM Corp., Essex Junction, VT, USA", keywords = "accelerated testing; alpha-particle effects; circuit reliability; cosmic ray interactions; cosmic ray soft errors; field; IBM; integrated; integrated circuit testing; ionizing radiation; life testing; memory circuits; semiconductor memories; soft-error rate; test conditions", treatment = "P Practical; X Experimental", xxlibnote = "Issue missing from UofUtah Marriott Library", } @Article{Pomerance:2002:SOC, author = "Carl Pomerance and Igor E. Shparlinski", title = "Smooth Orders and Cryptographic Applications", journal = LNCS, volume = "2369", pages = "338--348", year = "2002", CODEN = "LNCSD9", ISSN = "0302-9743", bibdate = "Tue Sep 10 19:09:55 MDT 2002", URL = "http://link.springer-ny.com/link/service/series/0558/papers/2369/23690338.pdf", acknowledgement = ack-nhfb, note = "ANTS-V: 5th International Algorithmic Number Theory Symposium", } @Article{Pratt:1975:EPSC, author = "Vaughan R. Pratt", title = "Every Prime has a Succinct Certificate", journal = "SIAM Journal on Computing", volume = "4", number = "3", pages = "214--220", year = "1975", } @article{Robin:1983:omega, author = "Guy Robin", title = "Estimation de la fonction de {Tchebycheff} $\theta$ sur le k-i\`eme nombre premier et grandes valeurs de la fonction $\omega(n)$ nombre de diviseurs premiers de $n$", journal = "Acta Arithmetica", volume = "XLII", pages = "367--389", year = 1983, } @Article{Shoup:1992:SPR, author = "Victor Shoup", title = "Searching for Primitive Roots in Finite Fields", journal = "Mathematics of Computation", volume = "58", number = "197", pages = "369--380", month = jan, year = "1992", coden = "MCMPAF", ISSN = "0025-5718", mrclass = "11T06 (11Y16)", mrnumber = "92e:11140", mrreviewer = "Rudolf Lidl", bibdate = "Tue Oct 13 08:06:19 MDT 1998", acknowledgement = ack-nhfb, } @book{Wagstaff:2003:CNTC, author="Wagstaff, Jr., Samuel S.", title ="Cryptanalysis of number theoretic ciphers", publisher = "Chapman-Hall / CRC", year = 2003, }