Idempotent factorizations in the cryptography classroom

DOI10.1080/07468342.2020.1724495MaRDI QIDQ5856125zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 4139669
• RSA and Carmichael numbers
• scientific article; zbMATH DE number 5590087
• scientific article; zbMATH DE number 1845044
• scientific article; zbMATH DE number 4055553

Cites work

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

Cited in

(3)

• scientific article; zbMATH DE number 4139669 (Why is no real title available?)
• An Idempotent Cryptarithm
• Minimal idempotency, partial idempotency, search heuristics and constructive algorithms for idempotent integers

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Idempotent factorizations in the cryptography classroom

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5856125)