Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

An improved version of the AAG cryptographic protocol

An improved version of the AAG cryptographic protocol AbstractAn improved version of the Anshel–Anshel–Goldfeld (AAG) algebraic cryptographickey-exchange scheme, that is in particular resistant against the Tsaban linear span cryptanalysis, is established.Unlike the original version, that is based on the intractability of the simultaneous conjugacy search problem for the platform group, the proposed version is based on harder simultaneous membership-conjugacy search problems, and the membership problem needs to be solved for a subset of the platform group that can be easily and efficiently built to be very complicated and without any good structure.A number of other hard problemsneed to be solved first before start solving the simultaneousmembership-conjugacy search problem to obtain the exchanged key. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

An improved version of the AAG cryptographic protocol

Groups Complexity Cryptology , Volume 11 (1): 7 – May 1, 2019

Loading next page...
 
/lp/de-gruyter/an-improved-version-of-the-aag-cryptographic-protocol-REPDSDWsDb
Publisher
de Gruyter
Copyright
© 2019 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2019-2003
Publisher site
See Article on Publisher Site

Abstract

AbstractAn improved version of the Anshel–Anshel–Goldfeld (AAG) algebraic cryptographickey-exchange scheme, that is in particular resistant against the Tsaban linear span cryptanalysis, is established.Unlike the original version, that is based on the intractability of the simultaneous conjugacy search problem for the platform group, the proposed version is based on harder simultaneous membership-conjugacy search problems, and the membership problem needs to be solved for a subset of the platform group that can be easily and efficiently built to be very complicated and without any good structure.A number of other hard problemsneed to be solved first before start solving the simultaneousmembership-conjugacy search problem to obtain the exchanged key.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2019

References