On the Chor-Rivest Cryptosystem in a Field with an Optimal Normal Basis of the Second Type
Received: 10 Oct 2026 Revised: 15 Oct 2026 Accepted: 20 Oct 2026
Published: 2026, vol. 30, issue 4, pp. 254–257
Abstract
A modification of the Shor–Rivest cryptosystem is considered, distinguished by the fact that computations in a random power basis are simulated using an optimal normal basis of type II, with acceleration achieved through fast multiplication and exponentiation.
Keywords: Shor-Rivest cryptosystem, optimal normal basis of the second type, fast multiplication, raising to a power equal to the field characteristic.
BibTeX
@article{IS-Gashkov-Sesiukalov-Frolov2026,
author = {Gashkov, Sergey Borisovich and Sesiukalov, Aleksandr Alekseevich and Frolov, Aleksandr Borisovich},
title = {{On the Chor-Rivest Cryptosystem in a Field with an Optimal Normal Basis of the Second Type}},
journal = {Intelligent Systems. Theory and Applications},
year = {2026},
volume = {30},
number = {4},
pages = {254--257},
}
AMSBIB
\Bibitem{IS-Gashkov-Sesiukalov-Frolov2026}
\by S.\,B.~Gashkov, A.\,A.~Sesiukalov, A.\,B.~Frolov
\paper On the Chor-Rivest Cryptosystem in a Field with an Optimal Normal Basis of the Second Type
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 254--257
\lang In Russian
Published under
Creative Commons Attribution 4.0 International (CC BY 4.0)
RU