Weakness of a public-key cryptosystem based on factorizations of finite groups

DOI10.1007/3-540-48285-7_5MaRDI QIDQ4934728zbMATH OpenFDO

Authors Simon R. Blackburn, Sean Murphy, Jacques Stern

Publication date 1 February 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48285-7_5

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the security of a public-key cryptosystem
• Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
• A ``factorization algorithm for elements of a symmetric group
• scientific article; zbMATH DE number 1842507
• The cryptanalysis of a public-key implementation of finite group mappings

Cited in

(12)

• Factorizations in the elementary abelian \(p\)-group and their cryptographic significance
• A ``factorization algorithm for elements of a symmetric group
• The cryptanalysis of a public-key implementation of finite group mappings
• scientific article; zbMATH DE number 1618049 (Why is no real title available?)
• Cryptoanalysis of cryptosystems based on the quadratic residue problem
• Cryptosystems involving one-factorizations of graphs
• scientific article; zbMATH DE number 5177768 (Why is no real title available?)
• Merkle-Hellman revisited: a cryptanalysis of the Qu-Vanstone cryptosystem based on group factorizations
• scientific article; zbMATH DE number 2102393 (Why is no real title available?)
• Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
• Algorithmic Number Theory
• Towards a uniform description of several group based cryptographic primitives

This page was built for publication: Weakness of a public-key cryptosystem based on factorizations of finite groups

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