Groups, Factoring, and Cryptography

DOI10.1080/0025570X.1996.11996400MaRDI QIDQ4886415zbMATH OpenFDO

Authors A. R. Meijer

Publication date 12 March 1997

Published in Mathematics Magazine (Search for Journal in Brave)

zbMATH Keywords

RSA public key cryptosystemRSA cipherfast factoringorder of a group element

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• A ``factorization algorithm for elements of a symmetric group
• scientific article; zbMATH DE number 1302796
• Groups and RSA cryptosystems
• A public key cryptosystem as hard as factorisation

Cited in

(7)

• Combinatorial group theory and public key cryptography
• Group theory in cryptography
• Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
• Computing sparse multiples of polynomials
• Experimental study of the hypothesis on the order of a random element of the matrix modular group
• Groups and RSA cryptosystems
• Cryptographic primitives based on groups on hidden order

This page was built for publication: Groups, Factoring, and Cryptography

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