Cryptology ePrint Archive: Report 2017/712

On desynchronised El Gamal algorithm

Vasyl Ustimenko

Abstract: Families of stable cyclic groups of nonlinear polynomial transformations of affine spaces $K^n$ over general commutative ring $K$ of increasing with $n$ order can be used in the key exchange protocols and related to them El Gamal multivariate cryptosystems. We suggest to use high degree of noncommutativity of affine Cremona group and modify multivariate El Gamal algorithm via the usage of conjugations for two polynomials of kind $g^k$ and $g^{-1}$ given by key holder (Alice) or giving them as elements of different transformation groups. We present key exchange protocols based on twisted discrete logarithms problem which uses noncommutativity of semigroup. Recent results on the existence of families of stable transformations of prescribed degree and density and exponential order over finite fields can be used for the implementation of schemes as above with feasible computational complexity. We introduce an example of a new implemented quadratic multivariate cryptosystem based on the above mentioned ideas.

Category / Keywords: Multivariate Cryptography, stable transformations, shifted multivariate El Gamal algorithm, desyncronisation diagram

Date: received 23 Jul 2017, last revised 27 Jul 2017

Contact author: vasyl at hektor umcs lublin pl

Available format(s): PDF | BibTeX Citation

Note: Part of paper content were presented at CECC2016 and CECC2017

Version: 20170727:180807 (All versions of this report)

Short URL: ia.cr/2017/712

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]