Cryptanalysis of two cryptosystems based on group actions

DOI10.1007/978-3-540-48000-6_6MaRDI QIDQ4502485zbMATH OpenFDO

Authors Simon R. Blackburn, Steven D. Galbraith

Publication date 12 September 2000

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

Full work available at URL https://doi.org/10.1007/978-3-540-48000-6_6

zbMATH Keywords

insecuritypublic-key cryptosystems

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Loopholes in two public key cryptosystems using the modular group
• A ``factorization algorithm for elements of a symmetric group
• Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
• Cryptography and Coding
• Public-key cryptosystems using the modular group

Cited in

(14)

• Loopholes in two public key cryptosystems using the modular group
• scientific article; zbMATH DE number 5380260 (Why is no real title available?)
• A functional cryptosystem using a group action
• Breaking the Akiyama-Goto cryptosystem
• Cryptanalysis of a 2-party key establishment based on a semigroup action problem
• Cryptography and Coding
• Cryptanalysis of a homomorphic public-key cryptosystem over a finite group
• Properties of certain semigroups and their potential as platforms for cryptosystems
• On Eulerian semigroups of multivariate transformations and their cryptographic applications
• On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
• Cryptographic group and semigroup actions
• On binary linear codes and binary pseudo-random sequences
• Cryptanalysis of a system using matrices over group rings
• Pseudoprime factorizations of integer matrices

This page was built for publication: Cryptanalysis of two cryptosystems based on group actions

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