Pseudorandomness from braid groups

DOI10.1007/3-540-44647-8_29MaRDI QIDQ4783742zbMATH OpenFDO

Authors Eon-Kyung Lee, Sang-Jin Lee, Sang Geun Hahn

Publication date 8 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2139/21390486

zbMATH Keywords

braid groupspseudorandomness

Mathematics Subject Classification ID

Braid groups; Artin groups (20F36) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 2086695
• New public-key cryptosystem using braid groups
• Towards generating secure keys for braid cryptography
• A Practical Attack on Some Braid Group Based Cryptographic Primitives
• scientific article; zbMATH DE number 2144676

Cited in

(8)

• New approaches to designing public key cryptosystems using one-way functions and trapdoors in finite groups
• A linear time matrix key agreement protocol over small finite fields
• Conjugacy search in braid groups. From a braid-based cryptogrphy point of view
• Entity authentication schemes using braid word reduction
• A new approach to the conjugacy problem in Garside groups.
• scientific article; zbMATH DE number 2086695 (Why is no real title available?)
• Pseudorandom Generators Based on Subcovers for Finite Groups
• Transitive Signatures from Braid Groups

This page was built for publication: Pseudorandomness from braid groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783742)