Show Summary Details
More options …

# Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year

CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

Online
ISSN
1869-6104
See all formats and pricing
More options …
Volume 9, Issue 1 (May 2017)

# Cryptography from the tropical Hessian pencil

Jean-Marie Chauvet
/ Eric Mahé
Published Online: 2017-04-19 | DOI: https://doi.org/10.1515/gcc-2017-0002

## Abstract

Recent work by Grigoriev and Shpilrain [8] suggests looking at the tropical semiring for cryptographic schemes. In this contribution we explore the tropical analogue of the Hessian pencil of plane cubic curves as a source of group-based cryptography. Using elementary tropical geometry on the tropical Hessian curves, we derive the addition and doubling formulas induced from their Jacobian and investigate the discrete logarithm problem in this group. We show that the DLP is solvable when restricted to integral points on the tropical Hesse curve, and hence inadequate for cryptographic applications. Consideration of point duplication, however, provides instances of solvable chaotic maps producing random sequences and thus a source of fast keyed hash functions.

MSC 2010: 14H40; 14H52; 14K25; 37E05; 37F10

## 1 Introduction

In the projective plane ${ℙ}^{2}\left(ℂ\right)$ the Hessian pencil is given by the equation

$\lambda \left({x}^{3}+{y}^{3}+{z}^{3}\right)+\mu xyz=0,\lambda ,\mu \in {ℙ}^{1}\left(ℂ\right).$

Its properties are well known (see [1] for an extensive review) and Hesse curves, which constitute the Hessian pencil, have recently been popular among number theorists in relation to applied elliptic curve cryptography [17, 9]. Hessian parametrization of elliptic curves in particular has been shown to improve resistance to side-channel attacks [9].

Following [8], the replacement of the field $ℂ$ with the tropical semiring $𝕋=ℝ\cup \left\{-\mathrm{\infty }\right\}$, equipped with the addition $x+y:=max\left(x,y\right)$ and multiplication $xy:=x+y$ (together with the natural conventions to handle the special value $-\mathrm{\infty }$), provides an original source of cryptographic schemes with very fast implementations [3] in some cases. In addition these implementations remain practical in a parameter space well beyond the original values suggested in [8] and analyzed in [11]. As an alternative to the tropical matrix algebra used there, we turn to tropical geometry in the projective space ${ℙ}^{2}\left(𝕋\right)$ and investigate the tropical analogue of the Hessian pencil.

## Tropical polynomials and tropical curves

A tropical polynomial in n variables ${x}_{1}\mathrm{\dots }{x}_{n}$ is a tropical sum of monomials:

$\sum _{i=1}^{m}{a}_{i}{x}_{1}^{{i}_{1}}\mathrm{\dots }{x}_{n}^{{i}_{n}}:=\underset{1⩽i⩽m}{\mathrm{max}}\left({a}_{i}+{i}_{1}{x}_{1}+\mathrm{\dots }+{i}_{n}{x}_{n}\right).$

Then to every tropical polynomial f we can associate its hypersurface ${V}_{f}\subset {𝕋}^{n}$ defined as the set of points where the maximum is attained at least twice. A tropical hypersurface in ${𝕋}^{n}$ is a union of convex polyhedra of dimension $n-1$, each one having integer slope i.e. being parallel to a hyperplane in ${ℝ}^{n}$ defined over $ℤ$. For every facet P, there are two monomials in f that are equal and greater than any other monomial of f over P (see [13, 12]). When f is homogeneous its hypersurface can be considered as a tropical projective variety in ${ℙ}^{n-1}\left(𝕋\right)$.

For $n=2$ the tropical hypersurface simplifies to a plane tropical curve in ${𝕋}^{2}$ and its facets are just affine segments. An unbounded segment is also called a tentacle.

## Tropical lines

The tropical lines are defined by the polynomials $aX+bY+c:=\mathrm{max}\left(a+X,b+Y,c\right)$. A tropical line is uniquely defined by the juncture of its three tentacles, the root point such that $a+X=b+Y=c$. As in euclidean geometry, two points in a general configuration define a unique tropical line, as shown in Figure 1. (It is still true in the specific configuration where the two points lie on the same tentacle, provided we fix the appropriate one as the root.)

Figure 1

Tropical lines. First row: In the general configuration, two points in ${𝕋}^{2}$ define a unique tropical line passing through them both. Second row: When both points lie on the same tentacle, fixing the appropriate one as the root also defines a unique tropical line.

## Tropical Hesse curves

The direct tropicalization of the Hessian pencil equation yields the tropical polynomial:

$f\left(x,y,z;\lambda ,\mu \right)=\mathrm{max}\left(\lambda +3x,\lambda +3y,\lambda +3z,\mu +x+y+z\right),x,y,z,\lambda ,\mu \in 𝕋$

The tropical Hesse curve is the set of points where the maximum is reached more than once. Introducing the inhomogeneous coordinates in the projective plane $\left(X=z-x,Y=z-y\right)$ and $K=\mu -\lambda$, we designate the tropical Hesse curve given by the tropical polynomial ${F}_{K}\left(X,Y\right)=\mathrm{max}\left(3X,3Y,0,K+X+Y\right)$ by ${H}_{K}$ (Figure 2). The tropical Hesse curves has three tentacles originating in the three vertices of coordinates $\left(K,K\right)$, which we pick as O the origin, $\left(-K,0\right)$ and $\left(0,-K\right)$, respectively. It has three facets: the line segments joining any pair of these vertices with slopes $\left(2,1\right)$, $\left(1,-1\right)$ and $\left(1,2\right)$, respectively (counterclockwise); the curve is symmetric around the axis $X=Y$.

Figure 2

Left: The tropical Hesse curve ${H}_{K}$. Right: The regular subdivision of the tropical Hesse curve, with the scaled tropical Hesse curve (red) showing mapping between crossing segments of the curve and its regular subdivision: tentacles cross boundary edges of the subdivision; internal segments cross internal edges of the subdivision.

## Tropical intersections and tropical elliptic curves

We use basic facts in tropical intersection theory [13] to adapt the geometrical presentation of tropical elliptic curve group law from [4] to the case of the tropical Hesse curve. Let $A\subset \left\{i,j,k\in ℕ:i+j+k=d\right\}$ be called the support of the polynomial

$f\left(x,y,z\right)=\sum _{\left(i,j,k\right)\in A}{a}_{ijk}{x}^{i}{y}^{j}{z}^{k}$

defining a plane tropical curve. The convex hull of points $\left(i,j,k,{a}_{ijk}\right)$ is a 3-dimensional polytope, the lower faces of which project bijectively, under omission of the last coordinate, onto the planar convex hull of A, thus defining a regular subdivision Δ of A. The segments of ${V}_{f}$ arise from the interior edges of Δ, and the tentacles arise from its boundary edges [16]. Figure 2, right, shows the regular subdivision of the tropical Hesse curve. The weight of a facet of the tropical curve is the lattice length of its dual edge in the regular subdivision(i.e. the number of lattice points on the edge, including extremities, minus 1). The degree of the curve is d as defined in the support of its polynomial.

Then the balancing condition holds: for any vertex V in the tropical curve ${V}_{f}$ with adjacent edges ${E}_{1},\mathrm{\dots },{E}_{p}$, let ${w}_{i},{v}_{i}$ be the weight and unit vectors of edge ${E}_{i}$; then ${w}_{1}{v}_{1}+\mathrm{\dots }+{w}_{n}{v}_{n}=0$, where $0=\left(0,0\right)$ of ${ℙ}^{2}\left(𝕋\right)$. For a vertex having exactly three adjacent edges, the multiplicity is defined as the common quantity

${w}_{2}{w}_{3}|det\left({v}_{2},{v}_{3}\right)|={w}_{3}{w}_{1}|det\left({v}_{3},{v}_{1}\right)|={w}_{1}{w}_{2}|det\left({v}_{1},{v}_{2}\right)|$

and following [4] a tropical curve is called smooth if all its vertices are 3-valent and have multiplicity 1, and a tropical elliptic curve is a smooth tropical curve of degree 3 and genus 1 (number of cycles). More generally, the intersection of two segments of a plane tropical curves, with respective weight ${w}_{1},{w}_{2}$ and unit vectors ${v}_{1},{v}_{2}$, has multiplicity ${w}_{1}{w}_{2}|det\left({v}_{1},{v}_{2}\right)|$ (see [16]).

Inspection of Figure 2 (right) show that the weight of the Hesse curve’s tentacles are 3, and the weight of the bounded segments are 1 and the balancing condition checks for all three vertices. The degree is 3 and its genus is 1. All vertices are 3-valent, their multiplicity, however, is e.g. for the origin O:

${m}_{O}=1×1×||\begin{array}{cc}\hfill -2\hfill & \hfill -1\hfill \\ \hfill -1\hfill & \hfill -2\hfill \end{array}||=3$

and the tropical Hesse curve is not smooth. The cycle ${C}_{K}$ of the tropical curve ${H}_{K}$ is obtained simply by removing the three tentacles, its equation is given by $\mathrm{max}\left(3X,3Y,0\right)=K+X+Y$.

## Geometrical presentation of the group law

On a tropical elliptic curve the group law introduced in [4], by analogy with the traditional group law on elliptic curves, has a geometrical presentation. We restrict our attention to the cycle C of the tropical elliptic curve, see Figure 3, with $O\in C$ an origin: addition of $P,Q\in C$ is computed by finding first the intersection S of the tropical line defined by $P,Q$ with the cycle C, and then defining $P+Q$ as the intersection of the tropical line defined by $S,O$ with C. Doubling of $P\in C$ is computed by finding first the intersection S of the tropical line intersecting C with multiplicity 2 at P, with C, and then defining $2P$ as the intersection of the tropical line defined by $S,O$ with C.

For a general point P, a tropical line intersecting C at P with multiplicity 2 does not necessarily exist. On the tropical Hesse curve, however, intersection of the tropical line rooted in any $P\in {C}_{K}$ and ${C}_{K}$ has multiplicity 2, hence doubling is well defined over ${C}_{K}$ even though the curve is not smooth.

Figure 3

Left: Point addition in the tropical Hesse curve group law; a first step determines S from P and Q, a second step yields $P+Q$ from S and the origin O. Right: Point doubling in the tropical Hesse curve group law; a first step determines S from P,a second step yields $2P$ from S and the origin O.

#### Proof.

Computations of determinants for each case of P lying on the three edges of ${C}_{K}$, and remembering that weights of edges on a tropical line are 1 as are weights of the bounded segments of the tropical Hesse curve, yield

$1×1×||\begin{array}{cc}\hfill 2\hfill & \hfill 0\hfill \\ \hfill 1\hfill & \hfill 1\hfill \end{array}||=2,1×1×||\begin{array}{cc}\hfill 1\hfill & \hfill 1\hfill \\ \hfill 2\hfill & \hfill 0\hfill \end{array}||=2,1×1×||\begin{array}{cc}\hfill 1\hfill & \hfill 1\hfill \\ \hfill -1\hfill & \hfill 1\hfill \end{array}||=2$

when P lies on the upper segment emanating from O, the lower segment emanating from O, the segment opposed to O, respectively. ∎

In [10, 15] Kajiwara and Nobe derive duplication and addition formula for the group law on the tropical Hesse curve using the process of ultradiscretization of the level-three theta functions on the (non-tropical) Hesse cubic curve. Here instead we calculate coordinates of points directly from the geometrical presentation above to obtain short formulas amenable to fast implementations. Let us divide the cycle ${C}_{K}$ and its interior into six faces, respectively:

${F}_{1}:=\left\{X,Y\in \overline{{C}_{K}}:X\ge 0,Y\ge X\right\},$${F}_{2}:=\left\{X,Y\in \overline{{C}_{K}}:X\le 0,Y\ge X,Y\ge 0\right\},$${F}_{3}:=\left\{X,Y\in \overline{{C}_{K}}:X\le 0,Y\ge X,Y\le 0\right\},$${F}_{4}:=\left\{X,Y\in \overline{{C}_{K}}:X\le 0,Y\le X,Y\le 0\right\},$${F}_{5}:=\left\{X,Y\in \overline{{C}_{K}}:X\ge 0,Y\ge X,Y\le 0\right\},$${F}_{6}:=\left\{X,Y\in \overline{{C}_{K}}:X\ge 0,Y\le X,Y\ge 0\right\}.$

In the first step of the addition, the intersection of ${C}_{K}$ and the tropical line determined by $P,Q\in {C}_{K}$ is determined. To do so we distinguish six cases according to which face the root of the tropical line lies in, as shown on Figure 4. In each of these configurations, for a root on a given face, the two points to add could be any pair combination of the three intersection points. We then produce in Table 1 three formulas for each configuration giving the third point from the coordinates of the two others, naming them by convention A on the unbounded north-east ray of the tropical line, B on the horizontal ray and C on the vertical one. This third point and the origin O then determine the second tropical line which intersects again ${C}_{K}$ at the sought for addition point, which we also call A, B, or C according to the first step.

Figure 4

The six configurations of the group addition on the tropical Hesse curve according to the face the root of the tropical line $P,Q$ lies in: Face 1 to 6, left to right, top to bottom.

Table 1

Given P and Q on ${C}_{K}$ defining a tropical line with root r, P being one of $A,B,C$, and Q being one of $A,B,C$ on this tropical line, the table provides coordinates of $P+Q$ according to which face r lies in.

## Doubling formulas

In order to produce the doubling formulas, we consider the tropical line to be rooted on the point in ${C}_{K}$ to be doubled and using the same partition of the curve in six faces as above to derive the formulas.

Table 2

Formulas for doubling of P and alternate preimage Q of the double of P.

Note that exactly two points on the tropical Hesse curve have the same image by doubling, with the exception of the origin O. Table 2 displays formulas for the doubling of point P and for Q the other point in the preimage of $\left[2\right]P$. Let us denote by ${\left[\frac{1}{2}\right]}_{0}P$ and ${\left[\frac{1}{2}\right]}_{1}P$ the preimages of P by the group law doubling; then ${\left[\frac{1}{2}\right]}_{0}P$ and ${\left[\frac{1}{2}\right]}_{1}P$ lie on opposite faces of the tropical Hesse curve in the following pairings $\left({F}_{1},{F}_{4}\right),\left({F}_{2},{F}_{5}\right),\left({F}_{3},{F}_{6}\right)$.

The formulas coincide with the ones obtained through ultradiscretization in [10, 14, 15] but involve a smaller number of elementary computations (additions and comparisons). Hence their implementation over either $ℝ$ with standard floating point precision or over $ℤ$ with large integers can be made very efficient. Experiments with unoptimized Python implementation of the double-and-add algorithm for elliptic point multiplications using the above tables show that, over a range of exponent’s length from 10 bits to 1.024 bits, point multiplication costs in average 2.3 integral multiplications and 0.7 integral comparisons per exponent’s bit which obviously compare favorably with analogues on the non-tropical Hesse cubic [6, 9].

## 3.1 Metrics on the tropical Hesse curve

The tropical Hesse curve’s cycle ${C}_{K}$ is obviously homeomorphic to the circle ${S}^{1}$ as a topological space. Furthermore, calling ${V}_{1},{V}_{2}$ the vertices starting from the origin O counterclockwise, and ${E}_{0},{E}_{1},{E}_{2}$ the successive edges, these may be assigned a length defined by $\frac{|{E}_{i}|}{|{v}_{i}|}$, where vertical bars denote the Euclidean metric and ${v}_{i}$ is the primitive integer vector along the considered edge. The total length of the cycle is then

$\mathrm{\ell }\left({C}_{k}\right)=\frac{\sqrt{5}×K}{\sqrt{5}}+\frac{\sqrt{2}×K}{\sqrt{2}}+\frac{\sqrt{5}×K}{\sqrt{5}}=3K$

The explicitation of the homomorphism for tropical elliptic curves in [4] to the case of the tropical Hesse curve is

$\lambda :{C}_{K}\to ℝ/ℤ\sim {S}^{1},\lambda \left(O\right)=0,\lambda \left({V}_{1}\right)=0+\frac{\mathrm{\ell }\left({E}_{0}\right)}{\mathrm{\ell }\left({C}_{K}\right)}=\frac{1}{3},\lambda \left({V}_{2}\right)=\lambda \left({V}_{1}\right)+\frac{\mathrm{\ell }\left({E}_{1}\right)}{\mathrm{\ell }\left({C}_{K}\right)}=\frac{2}{3},$

where it is enough to specify the images of the vertices. Even though the tropical Hesse curve is not a tropical elliptic curve – it is not smooth –, the proofs in [4] are still valid for λ as defined above. We can define a signed distance on ${C}_{K}$, namely $d\left(P,Q\right)=\mathrm{\ell }\left({C}_{K}\right)×\left(\lambda \left(P\right)-\lambda \left(Q\right)\right)$ which verifies

$d\left(P,Q\right)+d\left(Q,R\right)=d\left(P,R\right)$$\text{for all}P,Q,R\in {C}_{K},$$d\left(O,P+Q\right)=d\left(O,P\right)+d\left(O,Q\right)$$\text{for all}P,Q\in {C}_{K},$$\lambda \left(P+Q\right)=\lambda \left(P\right)+\lambda \left(Q\right)$$\text{for all}P,Q\in {C}_{K},$

where $+$ denotes the group law addition.

## 3.2 DLP on integral points

Let us now consider the standard cryptographic setting in ECC where Alice and Bob agree on a public elliptic curve, here an integral point $\left({X}_{\mathrm{pub}},{Y}_{\mathrm{pub}}\right)$ or equivalently the uniquely associated tropical Hesse curve such that $\left({X}_{\mathrm{pub}},{Y}_{\mathrm{pub}}\right)\in {C}_{K}$, and a public integral point $P\in {C}_{K}$ on this curve’s cycle – which could simply be $\left({X}_{\mathrm{pub}},{Y}_{\mathrm{pub}}\right)$. Alice and Bob choose a random secret $a,b$, respectively, and Alice sends Bob $\left[a\right]P$, Bob sends Alice $\left[b\right]P$ so that both can compute the shared secret $\left[ab\right]P=\left[ba\right]P$ using the group law on the curve. The shared secret is evidently compromised if Eve is able to recover a from $\left[a\right]P$ and P, or to recover $\left[ab\right]P$ from $P,\left[a\right]P,\left[b\right]P$.

The explicit homomorphism and the signed distance defined in the previous section afford simple analysis of this cryptographic setting on the tropical Hesse curve. Starting with ${P}_{0}=O$, let us enumerate all integral points on the cycle ${C}_{K}$ counterclockwise ${P}_{0},{P}_{1},\mathrm{\dots },{P}_{3K-1}$. There are $3K$ such points on the cycle and the formulas for λ and d show that the group law addition reduces to a counterclockwise shift modulo $3K$. There is one point, O, or order 1, two points ${V}_{1}$ and ${V}_{2}$ of order 3, and the order of all other points divide K. The metric leads to the relation ${P}_{nm\left(\mathrm{mod}3K\right)}=\left[n\right]{P}_{m}$ which given public knowledge of ${P}_{m}$ and interception of ${P}_{j}=\left[n\right]{P}_{m}$, allows derivation of $n=j{m}^{-1}\left(\mathrm{mod}3K\right)$.

## 3.3 Doubling leads to chaos

Although the previous analysis shows that the standard group law is inadequate for cryptographic purposes, the doubling operation shows sensitivity to initial conditions and ergodicity [10]. Although the discretized doubling on integral points of the tropical Hesse curve is a permutation and thus cannot be chaotic, we can extend it to a larger subset of points with coordinates in $ℚ$, namely the set F of points which coordinates are fractions with denominator of the form ${2}^{n}$ for $n\in ℕ$. The set F is stable under the doubling point of the group law and, more importantly, under the halving operation yielding the two halves ${\left[{2}^{-1}\right]}_{0}M$ and ${\left[{2}^{-1}\right]}_{1}M$.

The algebraic entropy [2] of the doubling map, a quantity measuring the complexity of the map defined by ${lim}_{n\to \mathrm{\infty }}\mathrm{log}\left({d}_{n}\right)/n$, where ${d}_{n}$ is the degree of the rational map of the n-th iterate, is here $\mathrm{log}\left(2\right)$ and positive. Figure 5 shows that the cycle ${C}_{K}$ is filled with points in the halving orbit of P, a point not a vertex.

Figure 5

Left: On the cycle ${C}_{22+101/128}$ of the tropical Hesse curve, 256 iterations of the halving map, showing almost equal distribution on all faces, respectively 42, 43, 43, 42, 43, and 43 points on faces 1 to 6. Right: x coordinates of the first1,000 doubling iterations of point $\left(8+1/128,15+51/128\right)$.

## 4.1 The tropical Hesse chaotic map

For a cryptographic application of the conjunction of both algebraic group properties and chaotic characteristics of the tropical Hessian pencil reviewed in the previous sections, we fix a tropical Hesse curve ${C}_{K}$ and consider the following map on its cycle:

${P}_{i+1}={\left[{2}^{-1}\right]}_{k}{P}_{i},k=0,1,$

which sends a point ${P}_{i}$ of the cycle to one of its two halves according to the key bit k. The ${P}_{i}$ points coordinates are dyadic rationals, and together with the tropical elliptic addition constitute a group. Lyapunov exponent calculations show, in Figure 6, that the map behavior is chaotic in the early iterations and then stabilizes much like a random time series.

Figure 6

Left diagram: Evolution of the (log) stretching factor in the early iterations of the tropical Hessian doubling/halving chaotic map. Right diagram: Comparative evolutions of the tropical Hessian map, black circles, and a random timeseries, blue triangles. (Graphs generated in R using the lyap_k function of the tseriesChaos package from $2,000$ halvingsof ${C}_{170,370/131,072}$.)

We consider the iteration of this chaotic map according to successive bits ${k}_{0}{k}_{1}\mathrm{\dots }{k}_{n-1}$ of a secret key k, and define

${P}_{n}={f}_{k}\left({P}_{0}\right),$

where ${P}_{i+1}={\left[{2}^{-1}\right]}_{{k}_{i}}{P}_{i}$, as our keyed chaotic map.

## 4.2 A keyed cipher construction

The construction proposed is iterative and leverages the group structure on the tropical Hesse curve cycle. The message block M and the secret key S have the same bit size n. Note that M and S are mapped each to a point on the upper edge of the public ${C}_{K}$ tropical Hesse curve (K a dyadic rational), which we denote by ${M}_{0}$ and ${S}_{0}$, respectively.

The cipher round

${M}_{j+1}={f}_{{S}_{j}}\left({M}_{j}+{S}_{j}\right),{S}_{j+1}={f}_{{S}_{j}}\left({S}_{j}\right)$

is iterated r times, with r a public parameter of the cipher, to produce the ciphertext ${M}_{r}$. The addition is the group addition on the tropical elliptic curve. In the rest of this section we denote this cipher construction by $\mathrm{THC}\left(K,r\right)$.

## 4.3 Correlation and diffusion properties

The $\mathrm{THC}\left(K,r\right)$ cipher construction operates on a single block of the message and can be used in other block cipher architectures chaining successive message blocks and secret keys. We ran measuring experiments of this single step, however, in order to assess the diffusion properties within a single message block. At each round a secret key is mixed in the message before applying the keyed chaotic map, a step which is similar to the Single-Key Even-Mansour Scheme described by Dunkelman, Keller and Shamir [5].

As seen in Figure 7, for typical values of the parameters, the cipher construction shows good decorrelation between plaintext bits and ciphertext bits. Bits 0 to 127 of the 128-bit long messages are along the horizontal axis, and the number of times the said message bit is changed after ten rounds over 1,000 runs on random messages is plotted on the vertical axis. The closer the score is to half of the runs, here 500, the closer to random is the correlation between plaintext and ciphertext.

Figure 7

Boxplot graph of individual bit correlations between plaintext and ciphertext for THC(${2}^{128}+1$,10): horizontal axis,bit position in ciphertext; vertical axis, cumulated bit differences over 1000 runs; the closer to half, here 500 the better. Thedisplay shows artifacts on a few of the high bits and few mid-bits as a result of the choice of mapping of messages and keysto the tropical Hesse Curve.

In order to study the diffusion properties, we run the cipher construction on messages that differ on a single bit only while keeping the same secret key. We then compute the Hamming distance, the number of different bits, of the ciphertexts of these single-bit differing plaintexts.

Figure 8

Boxplot graph of Hamming distances, in bits, between plaintext and ciphertext showing how bit by bit changes are propagated from plaintext to ciphertext according to position: left, 16-bit keys and plaintexts; right, 32-bit keys and plaintexts.

Figure 8 shows the results of running five rounds on 16-bit and 32-bit long messages, and comparing the ciphertext with the sixteen others obtained by changing one bit at each position in the original message. Each round produces an output ciphertext larger than the input message: here ciphertexts are 543-bit long of which an average of 28.67 % are changed when a single bit of the message is switched. Note that the diffusion is larger when the bit changed is higher in the message (most significant bits). By construction the diffusion stays local and with larger key sizes, the ciphertexts are longer, hence the ratio of changed bits decreases: it is 16,4 % for a 32-bit key size yielding 1,055-bit long ciphertexts from 32-bit long plaintext messages.

## 5 Conclusions

Properties of elliptic curve geometry naturally carry over to tropical geometry where tropical variety analogues can be defined for notions of degrees, intersections, Jacobians, metrics and group law. Looking at the specific instance of the Hesse cubic curve, a well-studied form of elliptic curve with interesting properties for cryptographic usage, it appears that these properties are lost in the linearization of the group law induced by the tropicalization of the Hessian pencil.

The tropical Hesse group law doubling map $P\to \left[{2}^{n}\right]P$, however, and more generally the maps $P\to \left[{p}^{n}\right]P$, $p\in ℤ$, give rise to piecewise linear discrete dynamical systems exhibiting solvable chaos [7] behavior. These maps are good candidates components for S-box implementations with the added benefit of very fast formula implementations since they reduce to few basic additions and comparisons in the tropical semiring.

## References

• [1]

M. Artebani and I. Dolgachev, The Hesse pencil of plane cubic curves, preprint (2006), https://arxiv.org/abs/math/0611590.

• [2]

P. M. Bellon and C.-M. Viallet, Algebraic entropy, Comm. Math. Phys. 204 (1999), no. 2, 425–437.  Google Scholar

• [3]

J. Chauvet and E. Mahe, Key agreement under tropical parallels, Groups Complex. Cryptol. 7 (2015), no. 2, 195–198.  Google Scholar

• [4]

M. Dehli Vigeland, The group law on a tropical elliptic curve, preprint (2004), https://arxiv.org/abs/math/0411485.

• [5]

O. Dunkelman, N. Keller and A. Shamir, Minimalism in cryptography: The even-mansour scheme revisited, Technical Report 2011/541, IACR Cryptology ePrint Archive, 2011, http://dblp.org/rec/journals/iacr/DunkelmanKS11a.

• [6]

R. R. Farashahi and M. Joye, Efficient arithmetic on Hessian curves, Public Key Cryptography, Lecture Notes in Comput. Sci. 6056, Springer, Berlin (2010), 243–260.  Google Scholar

• [7]

B. Grammaticos, A. Ramani and C. Viallet, Solvable chaos, Phys. Lett. A 336 (2005), no. 2–3, 152–158.  Google Scholar

• [8]

D. Grigoriev and V. Shpilrain, Tropical cryptography, Comm. Algebra 42 (2014), no. 6, 2624–2632.  Google Scholar

• [9]

M. Joye and J.-J. Quisquater, Hessian elliptic curves and side-channel attacks, Proceedings of Cryptographic Hardware and Embedded Systems – CHES 2001, Lecture Notes in Comput. Sci. 2162, Springer, Berlin (2001), 402–410.  Google Scholar

• [10]

K. Kajiwara, M. Kaneko, A. Nobe and T. Tsuda, Ultradiscretization of a solvable two-dimensional chaotic map associated with the hesse cubic curve, Kyushu J. Math. 63 (2009), no. 2, 315–338.  Google Scholar

• [11]

M. Kotov and A. Ushakov, Analysis of a key exchange protocol based on tropical matrix algebra, Technical Report 2015/852, Cryptology ePrint Archive, 2015, http://eprint.iacr.org/.

• [12]

D. Maclagan and B. Sturmfels, Introduction to Tropical Geometry, Grad. Stud. Math. 161, American Mathematical Society, Providence, 2015.  Google Scholar

• [13]

G. Mikhalkin, Tropical geometry and its applications, preprint (2006), https://arxiv.org/abs/math/0601041.

• [14]

A. Nobe, A tropical analogue of the Hessian group, preprint (2011), https://arxiv.org/abs/1104.0999.

• [15]

A. Nobe, The group law on the tropical Hesse pencil, preprint (2011), http://arxiv.org/abs/1111.0131.

• [16]

J. Richter-Gebert, B. Sturmfels and T. Theobald, First steps in tropical geometry, preprint (2003), https://arxiv.org/abs/math/0306366.

• [17]

N. Smart, The Hessian form of an elliptic curve, Cryptographic Hardware and Embedded Systems – CHES 2001, Lecture Notes in Comput. Sci. 2162, Springer, Berlin (2001), 118–125.  Google Scholar

Published Online: 2017-04-19

Published in Print: 2017-05-01

Citation Information: Groups Complexity Cryptology, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144,

Export Citation

© 2017 Walter de Gruyter GmbH, Berlin/Boston.