HOMOMORPHISMS OF FINITE GROUPS OF VECTORS AND CHOOSING THE PARAMETERS OF CRYPTOSCHEMES BASED ON THEM
There are considered attacks on cryptoschemes based on the recently proposed hard computational problem called hidden conjugacy search problem (HCSP). It is shown that in some cases the HCSP can be reduced to two independent problems, discrete logarithm and conjugacy search problem. Such attacks use homomorphisms of the multiplicative subgroup of finite rings of vectors into multiplicative group of the finite field. To prevent the attacks two variants for choosing the parameters of cryptoschemes have been proposed.
Authors: A. N. Berezin, D. U. Guriyanov, D. N. Moldovyan
Direction: Informatics, management and Computer Technology
Keywords: Vector multiplicative groups, homomorphism, hidden conjugacy search problem, cryptography, public-key cryptoschemes
View full article