Number theory and cryptography (using Maple)

MaRDI QIDQ4495298zbMATH OpenFDO

Authors John B. Cosgrave

Publication date 24 August 2002

zbMATH Keywords

cryptographydigital signaturePollard factorization methodsprimality testingRSA

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Cryptography (94A60)

Review text

This paper contains a description of Pohling-Hellman and Rivest-Shamir-Adleman (RSA) cryptographic methods and corresponding protocols for communications and digital signatures. The paper also contains a nice detailed description of number theoretic theorems for primality testing (Lucas, Lucas-Kraitchik-Lehmer, Lucas-Kraitchik-Lehmer-Selfridge, Pocklington, Proth). His experience in teaching Pollard factorization methods with examples in MAPLE is presented. For the entire collection see [Zbl 0930.00088].

Recommendations

• Introduction to cryptography with Maple
• Number theory and applications in cryptography
• scientific article; zbMATH DE number 707175
• Number theory and cryptography
• scientific article; zbMATH DE number 1786488
• Computational Number Theory and Cryptography

Cited in

(6)

• Primality testing of large numbers in Maple
• A Cryptographic Scavenger Hunt
• scientific article; zbMATH DE number 177272 (Why is no real title available?)
• scientific article; zbMATH DE number 1782886 (Why is no real title available?)
• Teaching cryptography in a wireless environment using maplets
• scientific article; zbMATH DE number 5041295 (Why is no real title available?)

Describes a project that uses

Uses Software

• Maple

This page was built for publication: Number theory and cryptography (using Maple)

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