Browse by author
Lookup NU author(s): Kelechi Emerole, Professor Said Boussakta
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Multivariate cryptosystem employs affine isomorphism to hide the structure of quadratic forms that make up the central polynomial. However, the ease of inverting the affine isomorphism and consequently finding the rank of the quadratic form of the core map has made such cryptosystem susceptible to key recovery attacks. Also, the density of the affine matrix has led to increase in the secret key size with its attendant overhead. In this paper, we study and apply the kernel function of the New Mersenne number transform to hide the structure of the core map(central polynomial) to limit the interpolation of the rank of the quadratic form by an adversary. Also, a modified Montgomery reduction is applied to carry out modulo reduction of the polynomial in degree extension field. Finally, we compare the impact of the kernel function of the New Mersenne Number Transform and the Affine transform on the key size of the HFEv signature scheme. From the result, it can be seen that their is an average of 69% reduction of secret key size using the proposed method.
Author(s): Emerole KC, Boussakta S
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: ICC 2022-IEEE International Conference on Communications
Year of Conference: 2022
Online publication date: 11/08/2022
Acceptance date: 21/03/2022
ISSN: 1938-1883
URL: https://doi.org/10.1109/ICC45855.2022.9838751
DOI: 10.1109/ICC45855.2022.9838751
Library holdings: Search Newcastle University Library for this item
ISBN: 9781538683477
