Transitive Signatures from Braid Groups
From MaRDI portal
Recommendations
Cites work
- A linear algebraic attack on the AAFG1 braid group cryptosystem
- A modification of Warshall's algorithm for the transitive closure of binary relations
- A new approach to the conjugacy problem in Garside groups.
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- Advances in Cryptology - CRYPTO 2003
- ALGORITHMS FOR POSITIVE BRAIDS
- An algebraic method for public-key cryptography
- Conjugacy problem for braid groups and Garside groups.
- Directed Transitive Signature Scheme
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 2079931 (Why is no real title available?)
- scientific article; zbMATH DE number 2081063 (Why is no real title available?)
- scientific article; zbMATH DE number 2144676 (Why is no real title available?)
- scientific article; zbMATH DE number 2209669 (Why is no real title available?)
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- New key agreement protocols in braid group cryptography
- New public-key cryptosystem using braid groups
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Pseudorandomness from braid groups
- Security in Communication Networks
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Towards generating secure keys for braid cryptography
- Transitive signatures based on factoring and RSA
- Transitive Signatures: New Schemes and Proofs
Cited in
(3)
This page was built for publication: Transitive Signatures from Braid Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458209)