Paper 2006/378 Original: eprint.iacr.org/2006/378 ↗
A New Key Exchange Primitive Based on the Triple Decomposition Problem
Abstract
We present a new key exchange primitive based on the decomposition problem over non-commutative groups. Different from the key establishment schemes that rely on the decomposition problem where the problem is decomposing an element into three parts where the middle piece is known, our scheme relies on decomposing an element into three parts, all unknown. We call this problem "Triple Decomposition Problem". This seems to be a harder problem because it requires quadratic systems to be solved instead of linear systems. We discuss the new primitive over two different protocols. The underlying problems in the two protocols differ slightly. We discuss the system and the underlying problems in one of the protocols in detail over braid groups. We manage to provide a setting which resists against linear algebra attacks and length based attacks.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2006-11-03: last updated
- 2006-11-03: published
- Short URL
- https://ia.cr/2006/378
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/378,
author = {Yesem Kurt},
title = {A New Key Exchange Primitive Based on the Triple Decomposition Problem},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/378},
year = {2006},
url = {https://eprint.iacr.org/2006/378}
}