Idempotent Factorizations in the Cryptography Classroom

DOI10.1080/07468342.2020.1724495zbMath1459.97019OpenAlexW3017646533WikidataQ114100219 ScholiaQ114100219MaRDI QIDQ5856125

Barry S. Fagin

Publication date: 24 March 2021

Published in: The College Mathematics Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07468342.2020.1724495

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Congruences; primitive roots; residue systems (11A07) Factorization; primality (11A51) Primality (11Y11) Number theory (educational aspects) (97F60) Physics, astronomy, technology, engineering (aspects of mathematics education) (97M50) Discrete mathematics (educational aspects) (97N70)

Uses Software

• OEIS

Cites Work

• Probabilistic algorithm for testing primality
• There are infinitely many Carmichael numbers
• Cryptanalysis of RSA and Its Variants
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Idempotent Factorizations in the Cryptography Classroom