Access the full text.
Sign up today, get DeepDyve free for 14 days.
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.
Groups Complexity Cryptology – de Gruyter
Published: May 1, 2019
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.