Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Groups, Factoring, and Cryptography

From MaRDI portal
Publication:4886415
Jump to:navigation, search

DOI10.1080/0025570X.1996.11996400zbMATH Open0857.94013MaRDI QIDQ4886415FDOQ4886415


Authors: A. R. Meijer Edit this on Wikidata


Publication date: 12 March 1997

Published in: Mathematics Magazine (Search for Journal in Brave)





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


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)



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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4886415&oldid=19258172"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 05:12. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki