On the conjugacy search problem and left conjugacy closed loops

DOI10.1007/S00200-008-0066-0zbMath1147.94012OpenAlexW2051562318MaRDI QIDQ939174

Juha Partala, Tapio Seppänen

Publication date: 21 August 2008

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-008-0066-0

zbMATH Keywords

cryptographykey exchangeconjugacy search problemleft conjugacy closed loops

Mathematics Subject Classification ID

Cryptography (94A60) Loops, quasigroups (20N05)

Related Items (1)

Algebraic generalization of Diffie-Hellman key exchange

Cites Work

• On extraspecial left conjugacy closed loops.
• On left conjugacy closed loops in which the left multiplication group is normal.
• An algebraic method for public-key cryptography
• Combinatorial group theory and public key cryptography
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• The conjugacy search problem in public key cryptography: unnecessary and insufficient
• A new approach to the conjugacy problem in Garside groups.
• Towards Provably Secure Group Key Agreement Building on Group Theory
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• The structure of conjugacy closed loops
• Advances in Cryptology - CRYPTO 2003
• 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: On the conjugacy search problem and left conjugacy closed loops