A note on tame polynomial automorphisms and the security of TTM cryptosystem
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F10%3APU90056" target="_blank" >RIV/00216305:26210/10:PU90056 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A note on tame polynomial automorphisms and the security of TTM cryptosystem
Original language description
In this paper we discuss two basic ways of TTM cryptosystem modifications. We suggest to add one more polynomial transformation into the coding process, and we discuss the properties of Frobenius automorphism as a possible tool to prevent the so-called Patarin attack. As TTM is based on polynomial automorphisms of finite field F, we also study automorphisms over specific fields, namely certain field extensions.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
APPLIED AND COMPUTATIONAL MATHEMATICS
ISSN
1683-3511
e-ISSN
—
Volume of the periodical
9
Issue of the periodical within the volume
2
Country of publishing house
AZ - AZERBAIJAN
Number of pages
8
Pages from-to
—
UT code for WoS article
000285855700006
EID of the result in the Scopus database
—