New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups

DOI10.1007/s00145-001-0018-3zbMath1020.94010OpenAlexW2087377210MaRDI QIDQ1865128

Tran van Trung, Spyros S. Magliveras, Douglas R. Stinson

Publication date: 25 March 2003

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-001-0018-3

zbMATH Keywords

finite groupspublic key cryptosystemsgroup factorizationstrapdoor one-way functions

Mathematics Subject Classification ID

Cryptography (94A60) Structure and classification of infinite or finite groups (20E99)

Related Items (38)

Minimal logarithmic signatures for one type of classical groups ⋮ Novel Digital Signature Scheme with Multiple Private Keys on Non-commutative Division Semirings ⋮ On Minimal Length Factorizations of Finite Groups ⋮ Attacking a public key cryptosystem based on tree replacement ⋮ Discrete logarithms for finite groups ⋮ On the size of complete decompositions of finite cyclic groups ⋮ Construction of strongly aperiodic logarithmic signatures ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ Tame logarithmic signatures of abelian groups ⋮ Complete factorizations of finite abelian groups ⋮ The existence of minimal logarithmic signatures for the sporadic Suzuki and simple Suzuki groups ⋮ Complete decomposition of the generalized quaternion groups ⋮ A construction of encryption protocols over some semidirect products ⋮ Pseudorandom number generators based on random covers for finite groups ⋮ Nonassociative algebraic structures in cryptography and coding ⋮ On the arithmetic of the endomorphisms ring \(\text{End}(\mathbb Z_p\times\mathbb Z_{p^2})\). ⋮ On the distribution of the elements of a finite group generated by covers ⋮ Minimal logarithmic signatures for the unitary group \(U_n(q)\) ⋮ Cryptanalysis of the MST 3 public key cryptosystem ⋮ LOGARITHMIC SIGNATURES FOR ABELIAN GROUPS AND THEIR FACTORIZATION ⋮ The Existence of Minimal Logarithmic Signatures for Some Finite Simple Groups ⋮ Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity ⋮ An extension of the noncommutative Bergman's ring with a large number of noninvertible elements ⋮ Complete decompositions of finite abelian groups ⋮ Minimal logarithmic signatures for finite groups of Lie type ⋮ A note on the security of \(\text{MST} _{3}\) ⋮ Weak keys in MST\(_{1}\) ⋮ The round functions of cryptosystem PGM generate the symmetric group ⋮ Graph Design for Secure Multiparty Computation over Non-Abelian Groups ⋮ Public key cryptosystem MST3: cryptanalysis and realization ⋮ Transitive Signatures from Braid Groups ⋮ All exceptional groups of Lie type have minimal logarithmic signatures ⋮ The existence of minimal logarithmic signatures for some finite simple unitary groups ⋮ A public key cryptosystem based on non-abelian finite groups ⋮ Unnamed Item ⋮ Conjugacy systems based on nonabelian factorization problems and their applications in cryptography ⋮ Signature scheme using the root extraction problem on quaternions ⋮ New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups

Cites Work

• Applied cryptography and network security. 6th international conference, ACNS 2008, New York, NY, USA, June 3--6, 2008. Proceedings
• Towards generating secure keys for braid cryptography
• Modifications to the number field sieve
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Conjugacy problem for braid groups and Garside groups.
• An algebraic method for public-key cryptography
• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• The quantum query complexity of the abelian hidden subgroup problem
• A weak key test for braid based cryptography.
• A new approach to the conjugacy problem in Garside groups.
• Finding conjugate stabilizer subgroups in PSL(2; q) and related groups
• Hidden translation and orbit coset in quantum computing
• Optimal measurements for the dihedral hidden subgroup problem
• ALGORITHMS FOR POSITIVE BRAIDS
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Advances in Cryptology - CRYPTO 2003
• A Practical Attack on a Braid Group Based Cryptographic Protocol
• Transitive Signatures from Braid Groups
• An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups