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

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.