• Corpus ID: 11360776

Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser

@article{Anshel2016DefeatingTB,
  title={Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser},
  author={Iris Anshel and Derek Atkins and Dorian Goldfeld and Paul E. Gunnells},
  journal={IACR Cryptol. ePrint Arch.},
  year={2016},
  volume={2016},
  pages={44}
}
The Algebraic Eraser Diffie-Hellman (AEDH) protocol was introduced in 2005 and published in 2006 by Anshel-Anshel-Goldfeld-Lemieux as a protocol suitable for use on platforms with constrained computational resources, such as FPGAs, ASICs, and wireless sensors. It is a group-theoretic cryptographic protocol that allows two users to construct a shared secret via a Diffie-Hellman-type scheme over an insecure channel. Building on the refuted 2012 permutation-based attack of Kalka-Teichner-Tsaban… 

On the Security of the Algebraic Eraser Tag Authentication Protocol

A range of attacks on this protocol that include very efficient and practical tag impersonation as well as partial, and total, tag secret key recovery are described, contrast with the 80-bit security that is claimed for the protocol.

A Practical Cryptanalysis of the Algebraic Eraser

A novel cryptanalysis of the Algebraic Eraser primitive, based on techniques from permutation groups, matrix groups and braid groups, which is proposed as an underlying technology for ISO/IEC 29167-20, intended for authentication of RFID tags.

Conjugacy Separation Problem in Braids: an Attack on the Original Colored Burau Key Agreement Protocol

This paper deeply redesigns the conjugacy separation search problem in braid groups and provides an experimental evidence that the problem can be solved for 100% of very long randomly generated instances.

POST QUANTUM GROUP THEORETIC CRYPTOGRAPHY

Evidence is presented that these protocols are not susceptible to the quantum attacks known to be effective on RSA and ECC, and it is concluded that Group Theoretic Cryptography is a viable candidate for post-quantum cryptography.

Ironwood Meta Key Agreement and Authentication Protocol

A new protocol called a Meta Key Agreement and Authentication Protocol (MKAAP) that has some characteristics of a public key solution and some of a shared-key solution is introduced and described, and it is shown how it resists quantum attacks.

A Study of Non-Abelian Public Key

  • Tzu-Chun Lin
  • Computer Science, Mathematics
    Int. J. Netw. Secur.
  • 2018
This paper presents a survey of the nonabelian group-based public key cryptosystems with the corresponding problems of security and hopes that readers can grasp the trend that is examined in this study.

Lightweight Mutual Authentication for IoT and Its Applications

This paper proposes a lightweight mutual authentication protocol based on a novel public key encryption scheme for smart city applications that takes a balance between the efficiency and communication cost without sacrificing the security.

References

SHOWING 1-5 OF 5 REFERENCES

A Practical Cryptanalysis of the Algebraic Eraser

A novel cryptanalysis of the Algebraic Eraser primitive, based on techniques from permutation groups, matrix groups and braid groups, which is proposed as an underlying technology for ISO/IEC 29167-20, intended for authentication of RFID tags.

Key agreement, the Algebraic Eraser, and lightweight cryptography, Algebraic methods in cryptography

  • Contemp. Math.,
  • 2006

Key agreement , the Algebraic Eraser TM , and lightweight cryptography , Algebraic methods in cryptography

  • 2006

Key agreement, the Algebraic Eraser TM , and lightweight cryptography, Algebraic methods in cryptography

  • Contemp. Math. Amer. Math. Soc
  • 2006