|
Algebra and Discrete Mathematics, 2015, Volume 20, Issue 1, Pages 152–170
(Mi adm537)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
RESEARCH ARTICLE
On algebraic graph theory and non-bijective multivariate maps in cryptography
Vasyl Ustimenko Maria Curie-Sklodowska University, Lublin
Abstract:
Special family of non-bijective multivariate maps Fn of Zmn into itself is constructed for n=2,3,… and composite m. The map Fn is injective on Ωn={x|x1+x2+…xn∈Zm∗} and solution of the equation Fn(x)=b,x∈Ωn can be reduced to the solution of equation zr=α, z∈Zm∗, (r,ϕ(m))=1. The “hidden RSA cryptosystem” is proposed.
Similar construction is suggested for the case Ωn=Zm∗n.
Keywords:
multivariate cryptography, linguistic graphs, hidden Eulerian equation, hidden discrete logarithm problem.
Received: 30.09.2015 Revised: 30.09.2015
Citation:
Vasyl Ustimenko, “On algebraic graph theory and non-bijective multivariate maps in cryptography”, Algebra Discrete Math., 20:1 (2015), 152–170
Linking options:
https://www.mathnet.ru/eng/adm537 https://www.mathnet.ru/eng/adm/v20/i1/p152
|
Statistics & downloads: |
Abstract page: | 366 | Full-text PDF : | 180 | References: | 94 |
|