Saved in:
Bibliographic Details
Main Authors: Lin, Hanling, Han, Yu
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2601.18287
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • In this paper,we propose a modified Anshel-Anshel-Goldfeld(AAG) key exchange scheme. The hardness assumption underlying this modified construction is based on the membership problem for Mihailova subgroups of the braid group, a problem that is algorithmically unsolvable. According to the security analysis, we show that the proposed scheme is resistant to all known attacks, including quantum computational attacks.