Add to ORKGAbstract. Using a simple heuristic approach to the root problem in braid groups, we show that cryptographic parameters proposed in this context must be considered as insecure. In our experiments we can, often within seconds, extract the secret key of an authentication system based on the root problem in braid groups. 1
Abstract. After some excitement generated by recently suggested public key exchange protocols due to...
We present variants of the signature schemes of GuillouQuisquater ElGamal and Schnorr whose securi...
Wir untersuchen Darstellungsattacken auf das Zopf-Diffie-Hellman Schlüsselaustauschprotokoll via Law...
Using a simple heuristic approach to the root problem in braid groups, we show that cryptographic pa...
Abstract. Lal and Chaturvedi proposed two authentication schemes based on the difficulty of the Root...
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. Th...
Known proposals for key establishment schemes basing on combinatorial group theory are often formul...
We demonstrate that recent advances in the theory of braid groups, in particular a new invariant of ...
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric brai...
SIGLEAvailable from TIB Hannover: RR 631(2002,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
Abstract. Motivated by cryptographic applications, we study subgroups of braid groups Bn generated b...
Abstract. The braid groups are infinite non-commutative groups nat-urally arising from geometric bra...
Braid Groups have recently been considered for use in Public-Key Cryptographic Systems. The most not...
AbstractArtin's braid groups currently provide a promising background for cryptographical applicatio...
Abstract. We show that the decisional version of the Ko-Lee assumption for braid groups put forward ...
Abstract. After some excitement generated by recently suggested public key exchange protocols due to...
We present variants of the signature schemes of GuillouQuisquater ElGamal and Schnorr whose securi...
Wir untersuchen Darstellungsattacken auf das Zopf-Diffie-Hellman Schlüsselaustauschprotokoll via Law...
Using a simple heuristic approach to the root problem in braid groups, we show that cryptographic pa...
Abstract. Lal and Chaturvedi proposed two authentication schemes based on the difficulty of the Root...
Abstract. Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. Th...
Known proposals for key establishment schemes basing on combinatorial group theory are often formul...
We demonstrate that recent advances in the theory of braid groups, in particular a new invariant of ...
Abstract. The braid groups are infinite non-commutative groups naturally arising from geometric brai...
SIGLEAvailable from TIB Hannover: RR 631(2002,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - ...
Abstract. Motivated by cryptographic applications, we study subgroups of braid groups Bn generated b...
Abstract. The braid groups are infinite non-commutative groups nat-urally arising from geometric bra...
Braid Groups have recently been considered for use in Public-Key Cryptographic Systems. The most not...
AbstractArtin's braid groups currently provide a promising background for cryptographical applicatio...
Abstract. We show that the decisional version of the Ko-Lee assumption for braid groups put forward ...
Abstract. After some excitement generated by recently suggested public key exchange protocols due to...
We present variants of the signature schemes of GuillouQuisquater ElGamal and Schnorr whose securi...
Wir untersuchen Darstellungsattacken auf das Zopf-Diffie-Hellman Schlüsselaustauschprotokoll via Law...