Some effectivity questions for plane Cremona transformations in the context of symmetric key cryptography

N. I. Shepherd-Barron*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)
34 Downloads (Pure)

Abstract

An effective lower bound on the entropy of some explicit quadratic plane Cremona transformations is given. The motivation is that such transformations (Hénon maps, or Feistel ciphers) are used in symmetric key cryptography. Moreover, a hyperbolic plane Cremona transformation g is rigid, in the sense of [5], and under further explicit conditions some power of g is tight.

Original languageEnglish
Article numberPEMS18111
Pages (from-to)1-28
Number of pages28
JournalProceedings Of The Edinburgh Mathematical Society
Volume64
Issue number1
Early online date1 Mar 2021
DOIs
Publication statusE-pub ahead of print - 1 Mar 2021

Fingerprint

Dive into the research topics of 'Some effectivity questions for plane Cremona transformations in the context of symmetric key cryptography'. Together they form a unique fingerprint.

Cite this