FourQ

Uses your system voice; voice and rate in settings.

Snapshot

≈ 3 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In cryptography, FourQ is an elliptic curve developed by Microsoft Research. It is designed for key agreements schemes (elliptic-curve Diffie–Hellman) and digital signatures (Schnorr), and offers about 128 bits of security. It is equipped with a reference implementation made by the authors of the original paper. The open source implementation is called FourQlib and runs on Windows and Linux and is available for x86, x64, and ARM. It is licensed under the MIT License and the source code is available on GitHub. Its name is derived from the four dimensional Gallant–Lambert–Vanstone scalar multiplication, which allows high performance calculations. The curve is defined over a two dimensional extension of the prime field defined by the Mersenne prime 2^{127} - 1 .

In cryptography, FourQ is an elliptic curve developed by Microsoft Research. It is designed for key agreements schemes (elliptic-curve Diffie–Hellman) and digital signatures (Schnorr), and offers about 128 bits of security. It is equipped with a reference implementation made by the authors of the original paper. The open source implementation is called FourQlib and runs on Windows and Linux and is available for x86, x64, and ARM. It is licensed under the MIT License and the source code is available on GitHub. Its name is derived from the four dimensional Gallant–Lambert–Vanstone scalar multiplication, which allows high performance calculations. The curve is defined over a two dimensional extension of the prime field defined by the Mersenne prime 2^{127} - 1 . -x^2 + y^2 = 1 + d x^2 y^2 d is a non-square in \mathbb{F}_{p^2} , where p is the Mersenne prime 2^{127}-1 . In order to avoid small subgroup attacks, all points are verified to lie in an N-torsion subgroup of the elliptic curve, where N is specified as a 246-bit prime dividing the order of the group. The curve is equipped with two nontrivial endomorphisms: \psi related to the p -power Frobenius map, and \phi , a low degree efficiently computable endomorphism (see complex multiplication). Since we look at a prime order cyclic subgroup, one can write scalars \lambda_\psi, \lambda_\phi such that \psi(P) = [\lambda_\psi]P and \phi(P) = [\lambda_\phi]P for every point P in the N-torsion subgroup. Hence, for a given k we may write k = a_1 + a_2 \lambda_\phi + a_3 \lambda_\psi + a_4 \lambda_\phi\lambda_\psi \pmod N If we find small a_i , we may compute [k]P quickly by utilizing the implied equation [k]P = [a_1]P + [a_2] \phi(P) + [a_3] \psi(P) + [a_4] \phi(\psi(P)) Babai rounding technique is used to find small a_i . For FourQ it turns that one can guarantee an efficiently computable solution with a_i . Moreover, as the characteristic of the field is a Mersenne prime, modulations can be carried efficiently. Both properties (four dimensional decomposition and Mersenne prime characteristic), alongside usage of fast multiplication formulae (extended twisted Edwards coordinates), make FourQ the currently fastest elliptic curve for the 128 bit security level.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1163912595 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

6 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.