Detail publikace

A note on tame polynomial automorphisms and the security of TTM cryptosystem

Originální název

A note on tame polynomial automorphisms and the security of TTM cryptosystem

Anglický název

A note on tame polynomial automorphisms and the security of TTM cryptosystem

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@article{BUT50936,
  author="Jaroslav {Hrdina} and Miroslav {Kureš} and Petr {Vašík}",
  title="A note on tame polynomial automorphisms and the security of TTM cryptosystem",
  annote="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.",
  chapter="50936",
  journal="Applied and computational mathematics",
  number="2",
  volume="9",
  year="2010",
  month="december",
  pages="226--233",
  type="journal article in Web of Science"
}