Advances in Cryptology - CRYPTO 2003
From MaRDI portal
(Redirected from Advances in Cryptology - CRYPTO 2003)
Advances in Cryptology - CRYPTO 2003 (scientific article; zbMATH DE number 5215177)
Advances in Cryptology - CRYPTO 2003 (scientific article; zbMATH DE number 5215177)
Recommendations
Cited in
(25)- Towards generating secure keys for braid cryptography
- New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
- Attack on Kayawood protocol: uncloaking private keys
- An improvement of the Diffie-Hellman noncommutative protocol
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- An improved version of the AAG cryptographic protocol
- Two general schemes of algebraic cryptography
- Signature scheme using the root extraction problem on quaternions
- Algebraic generalization of Diffie-Hellman key exchange
- Gröbner basis cryptosystems
- Representation attacks on the Braid Diffie-Hellman public key encryption
- Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
- A weak key test for braid based cryptography.
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- A nonlinear decomposition attack
- Affine braid groups: a better platform than braid groups for cryptology?
- GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS
- Transitive Signatures from Braid Groups
- Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
- Oblivious transfer using non-abelian groups
- The group factorization problem in finite groups of Lie type
- Cryptanalysis of a key exchange protocol based on the endomorphisms ring \(\mathrm{End}(\mathbb Z_p\times\mathbb Z_{p^2})\)
- An analytic study of a novel algebraic public key encryption scheme based on polynomials over noncommutative matrix ring
- On the conjugacy search problem and left conjugacy closed loops
- The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups
This page was built for publication: Advances in Cryptology - CRYPTO 2003
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428121)