Advances in Cryptology - CRYPTO 2003
From MaRDI portal
Publication:5428121
DOI10.1007/b11817zbMath1122.94364OpenAlexW2480001466WikidataQ56235047 ScholiaQ56235047MaRDI QIDQ5428121
Publication date: 28 November 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11817
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Braid groups; Artin groups (20F36) Data encryption (aspects in computer science) (68P25)
Related Items (23)
A nonlinear decomposition attack ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ Oblivious transfer using non-abelian groups ⋮ Affine braid groups: a better platform than braid groups for cryptology? ⋮ 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 ⋮ On the conjugacy search problem and left conjugacy closed loops ⋮ The Diffie-Hellman key exchange protocol and non-Abelian nilpotent groups ⋮ GENERAL ALGEBRAIC CRYPTOGRAPHIC KEY EXCHANGE SCHEME AND ITS CRYPTANALYSIS ⋮ Cryptanalysis of a key exchange protocol based on the endomorphisms ring \(\mathrm{End}(\mathbb Z_p\times\mathbb Z_{p^2})\) ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ A weak key test for braid based cryptography. ⋮ Attack on Kayawood protocol: uncloaking private keys ⋮ Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography ⋮ Transitive Signatures from Braid Groups ⋮ Towards generating secure keys for braid cryptography ⋮ An improved version of the AAG cryptographic protocol ⋮ An improvement of the Diffie-Hellman noncommutative protocol ⋮ Two general schemes of algebraic 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
Uses Software
This page was built for publication: Advances in Cryptology - CRYPTO 2003
