×

Found 198 Documents (Results 1–100)

100
MathJax

Euler’s E228: primality testing and factoring via sums of squares. (English) Zbl 1391.01012

Zack, Maria (ed.) et al., Research in history and philosophy of mathematics. The CSHPM 2016 annual meeting in Calgary, Alberta, Canada, May 2016. Cham: Birkhäuser (ISBN 978-3-319-64092-1/hbk; 978-3-319-64551-3/ebook). Proceedings of the Canadian Society for History and Philosophy of Mathematics/La Société Canadienne d’Histoire et de Philosophie des Mathématiques, 97-116 (2017).
MSC:  01A50 11-03 11A51
PDF BibTeX XML Cite
Full Text: DOI

Infinitely many Carmichael numbers for a modified Miller-Rabin prime test. (English) Zbl 1364.11159

Rosenkranz, Markus (ed.), Proceedings of the 41st international symposium on symbolic and algebraic computation, ISSAC 2016, Waterloo, Canada, July 20–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4380-0). 47-54 (2016).
MSC:  11Y11 11A51
PDF BibTeX XML Cite
Full Text: DOI arXiv

Number theory. An introduction via the density of primes. 2nd edition. (English) Zbl 1419.11001

New York, NY: Birkhäuser/Springer (ISBN 978-3-319-43873-3/hbk; 978-3-319-43875-7/ebook). xiii, 413 p. (2016).
PDF BibTeX XML Cite
Full Text: DOI

Algorithmic number theory. 2nd revised and extended ed. (Algorithmische Zahlentheorie.) (German) Zbl 1304.11002

Heidelberg: Springer Spektrum (ISBN 978-3-658-06539-3/pbk; 978-3-658-06540-9/ebook). viii, 314 p. (2015).
PDF BibTeX XML Cite
Full Text: DOI

Algebraic and number-theoretic foundations for informatics. Groups, rings, fields, primality tests and coding. (Algebraische und zahlentheoretische Grundlagen für die Informatik. Gruppen, Ringe, Körper, Primzahltests, Verschlüsselung.) (German) Zbl 1325.11001

Wiesbaden: Springer Vieweg (ISBN 978-3-658-04074-1/pbk; 978-3-658-04075-8/ebook). viii, 220 p. (2014).
PDF BibTeX XML Cite
Full Text: DOI

The mathematics of encryption. An elementary introduction. (English) Zbl 1284.94001

Mathematical World 29. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-8321-1/pbk). xvii, 332 p. (2013).
PDF BibTeX XML Cite

Number theory, ancient and modern. (English) Zbl 1236.11001

Ji, Lizhen (ed.) et al., Fourth international congress of Chinese mathematicians. Proceedings of the ICCM ’07, Hangzhou, China, December 17–22, 2007. Providence, RI: American Mathematical Society (AMS); Somerville, MA: International Press (ISBN 978-0-8218-5021-3/pbk). AMS/IP Studies in Advanced Mathematics 48, 3-12 (2010).
PDF BibTeX XML Cite

Fast generation of prime numbers on portable devices: an update. (English) Zbl 1300.94067

Goubin, Louis (ed.) et al., Cryptographic hardware and embedded systems – CHES 2006. 8th international workshop, Yokohama, Japan, October 10–13, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-46559-1/pbk). Lecture Notes in Computer Science 4249, 160-173 (2006).
MSC:  94A60 11Y11
PDF BibTeX XML Cite
Full Text: DOI

Commentary on Lucas’ test. (English) Zbl 1093.11002

van der Poorten, Alf (ed.) et al., High primes and misdemeanours: lectures in honour of the 60th birthday of Hugh Cowie Williams. Selected papers from the international conference on number theory, Banff, AB, Canada, May 24–30, 2003. Providence, RI: American Mathematical Society (AMS) (ISBN 0-8218-3353-7/hbk). Fields Institute Communications 41, 103-109 (2004).
MSC:  11A51 11Y11
PDF BibTeX XML Cite

Primality and factoring. (English) Zbl 1047.11121

Bhandari, A. K. (ed.) et al., Elliptic curves, modular forms and cryptography. Proceedings of the advanced instructional workshop on algebraic number theory, Allahabad, India, November 2000. New Delhi, IN: Hindustan Book Agency (ISBN 81-85931-42-9/hbk). 303-323 (2003).
MSC:  11Y05 11A51 11Y11
PDF BibTeX XML Cite

A probable prime test with very high confidence for \(n \equiv 1 \bmod 4\). (English) Zbl 1062.11079

Boyd, Colin (ed.), Advances in cryptology - ASIACRYPT 2001. 7th international conference on the theory and application of cryptology and information security, Gold Coast, Australia, December 9–13, 2001. Proceedings. Berlin: Springer (ISBN 3-540-42987-5). Lect. Notes Comput. Sci. 2248, 87-106 (2001).
MSC:  11Y11 11R11
PDF BibTeX XML Cite
Full Text: Link

Application of the method of trigonometric sums for primality testing of integers. (English. Russian original) Zbl 1045.11088

Mosc. Univ. Math. Bull. 56, No. 5, 28-30 (2001); translation from Vestn. Mosk. Univ., Ser. I 2001, No. 5, 49-51 (2001).
MSC:  11Y11 11L03
PDF BibTeX XML Cite

Elliptic curves, modular forms, and applications. (English) Zbl 1013.11022

Conrad, Brian (ed.) et al., Arithmetic algebraic geometry. Expanded lectures delivered at the graduate summer school of the Institute for Advanced Study/Park City Mathematics Institute, Park City, UT, USA, June 20-July 10, 1999. Providence, RI: American Mathematical Society (AMS). IAS/ Park City Math. Ser. 9, 5-81 (2001).
PDF BibTeX XML Cite

On QF-pseudoprimes and second-order recurrence sequences. (English) Zbl 0962.11040

Dorninger, D. (ed.) et al., Contributions to general algebra 12. Proceedings of the 58th workshop on general algebra “58. Arbeitstagung Allgemeine Algebra”, Vienna, Austria, June 3-6, 1999. Klagenfurt: Verlag Johannes Heyn. 299-310 (2000).
MSC:  11Y11 11B39 11A51
PDF BibTeX XML Cite

Coding theory and cryptography. The essentials. 2nd ed., rev. and expanded. (English) Zbl 0955.94001

Pure and Applied Mathematics, Marcel Dekker. 234. New York, NY: Marcel Dekker. 368 p. (2000).
PDF BibTeX XML Cite

Number theory and cryptography (using Maple). (English) Zbl 0991.94032

Joyner, David (ed.), Coding theory and cryptography. From Enigma and Geheimschreiber to quantum theory. Proceedings of the conference on coding theory, cryptography, and number theory, Annapolis, MD, USA, October 25-26, 1998. Berlin: Springer. 124-143 (2000).
MSC:  94A60 11Y16
PDF BibTeX XML Cite

Finite fields: theory and computation. The meeting point of number theory, computer science, coding theory and cryptography. (English) Zbl 0967.11052

Mathematics and its Applications (Dordrecht). 477. Dordrecht: Kluwer Academic Publishers. xiv, 528 p. (1999).
PDF BibTeX XML Cite

Proving in zero-knowledge that a number is the product of two safe primes. (English) Zbl 0971.94009

Stern, Jacques (ed.), Advances in cryptology - EUROCRYPT ’99. 17th annual Eurocrypt conference, international conference on The theory and application of cryptographic techniques, Prague, Czech Republic, May 2-6, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1592, 107-122 (1999).
MSC:  94A60 11Y11 11A51
PDF BibTeX XML Cite
Full Text: DOI

Finding length-3 positive Cunningham chains and their cryptographic significance. (English) Zbl 1067.94568

Buhler, J. P. (ed.), Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21–25, 1998. Proceedings. Berlin: Springer (ISBN 3-540-64657-4). Lect. Notes Comput. Sci. 1423, 289-298 (1998).
MSC:  94A60 11Y16
PDF BibTeX XML Cite
Full Text: Link

Generating a product of three primes with an unknown factorization. (English) Zbl 0916.11066

Buhler, J. P. (ed.), Algorithmic number theory. 3rd international symposium, ANTS-III, Portland, OR, USA, June 21–25, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1423, 237-251 (1998).
MSC:  11Y05 94A60 11T71
PDF BibTeX XML Cite

Efficient generation of shared RSA keys. (Extended abstract). (English) Zbl 0882.94017

Kaliski, Burton S. jun. (ed.), Advances in Cryptology - CRYPTO ’97. 17th annual international cryptology conference. Santa Barbara, CA, USA. August 17–21, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1294, 425-439 (1997).
MSC:  94A60 11Y11
PDF BibTeX XML Cite

Filter Results by …

Document Type

Database

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

Biographic Reference

all top 3

Software