Public key cryptosystem MST₃: cryptanalysis and realization
From MaRDI portal
Publication:3068176
Recommendations
Cites work
- A note on the security of \(\text{MST} _{3}\)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A public key cryptosystem based on non-abelian finite groups
- Algebraic properties of cryptosystem PGM
- Cryptanalysis of the \(MST_{3}\) public key cryptosystem
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Cited in
(14)- Minimal logarithmic signatures for one type of classical groups
- Construction of strongly aperiodic logarithmic signatures
- Weak keys in MST\(_{1}\)
- Investigation of the cryptosystem MST\(_3\) based on a Suzuki 2-group
- Cryptanalysis of the \(MST_{3}\) public key cryptosystem
- On the security of a realization of the cryptosystem \(\text{MST}_3\)
- scientific article; zbMATH DE number 3991413 (Why is no real title available?)
- Pseudorandom number generators based on random covers for finite groups
- scientific article; zbMATH DE number 2102393 (Why is no real title available?)
- Minimal logarithmic signatures for the unitary group \(U_n(q)\)
- Logarithmic signatures for abelian groups and their factorization
- Applications of finite non-abelian simple groups to cryptography in the quantum era
- Towards a uniform description of several group based cryptographic primitives
- A note on the security of \(\text{MST} _{3}\)
This page was built for publication: Public key cryptosystem MST\(_{3}\): cryptanalysis and realization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068176)