Software:FourQ
| Developer(s) | Microsoft Research |
|---|---|
| Initial release | 2015 |
| Stable release | v3.1
|
| Repository | github |
| Written in | C |
| Operating system | Windows 10, Linux |
| Platform | IA-32, x86-64, ARM32, ARM64 |
| Type | Elliptic-curve cryptographic library |
| License | MIT License |
| Website | www |
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.[1] 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.[2] It is licensed under the MIT License and the source code is available on GitHub.[3]
Its name is derived from the four dimensional Gallant–Lambert–Vanstone scalar multiplication, which allows high performance calculations.[4] The curve is defined over a two dimensional extension of the prime field defined by the Mersenne prime [math]\displaystyle{ 2^{127} - 1 }[/math].
History
The curve was published in 2015 by Craig Costello and Patrick Longa from Microsoft Research on ePrint.[1]
The paper was presented in Asiacrypt in 2015 in Auckland, New Zealand, and consequently a reference implementation was published on Microsoft's website.[2]
There were some efforts to standardize usage of the curve under IETF; these efforts were withdrawn in late 2017.[5]
Mathematical properties
The curve is defined by a twisted Edwards equation
- [math]\displaystyle{ -x^2 + y^2 = 1 + d x^2 y^2 }[/math]
[math]\displaystyle{ d }[/math] is a non-square in [math]\displaystyle{ \mathbb{F}_{p^2} }[/math], where [math]\displaystyle{ p }[/math] is the Mersenne prime [math]\displaystyle{ 2^{127}-1 }[/math].
In order to avoid small subgroup attacks,[6] 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: [math]\displaystyle{ \psi }[/math] related to the [math]\displaystyle{ p }[/math]-power Frobenius map, and [math]\displaystyle{ \phi }[/math], a low degree efficiently computable endomorphism (see complex multiplication).
Cryptographic properties
Security
The currently best known discrete logarithm attack is the generic Pollard's rho algorithm, requiring about [math]\displaystyle{ 2^{122.5} }[/math] group operations on average. Therefore, it typically belongs to the 128 bit security level.
In order to prevent timing attacks, all group operations are done in constant time, i.e. without disclosing information about key material.[1]
Efficiency
Most cryptographic primitives, and most notably ECDH, require fast computation of scalar multiplication, i.e. [math]\displaystyle{ [k]P }[/math] for a point [math]\displaystyle{ P }[/math] on the curve and an integer [math]\displaystyle{ k }[/math], which is usually thought as distributed uniformly at random over [math]\displaystyle{ \{0, \ldots, N-1\} }[/math].
Since we look at a prime order cyclic subgroup, one can write scalars [math]\displaystyle{ \lambda_\psi, \lambda_\phi }[/math] such that [math]\displaystyle{ \psi(P) = [\lambda_\psi]P }[/math] and [math]\displaystyle{ \phi(P) = [\lambda_\phi]P }[/math] for every point [math]\displaystyle{ P }[/math] in the N-torsion subgroup.
Hence, for a given [math]\displaystyle{ k }[/math] we may write
- [math]\displaystyle{ k = a_1 + a_2 \lambda_\phi + a_3 \lambda_\psi + a_4 \lambda_\phi\lambda_\psi \pmod N }[/math]
If we find small [math]\displaystyle{ a_i }[/math], we may compute [math]\displaystyle{ [k]P }[/math] quickly by utilizing the implied equation
- [math]\displaystyle{ [k]P = [a_1]P + [a_2] \phi(P) + [a_3] \psi(P) + [a_4] \phi(\psi(P)) }[/math]
Babai rounding technique[7] is used to find small [math]\displaystyle{ a_i }[/math]. For FourQ it turns that one can guarantee an efficiently computable solution with [math]\displaystyle{ a_i \lt 2^{64} }[/math].
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.
Uses
 | This section is missing information about uses. (July 2019) |
FourQ is implemented in the cryptographic library CIRCL, published by Cloudflare.[8]
See also
References
- ↑ 1.0 1.1 1.2 Costello, Craig; Longa, Patrick (2015). FourQ: four-dimensional decompositions on a Q-curve over the Mersenne prime. https://eprint.iacr.org/2015/565. Retrieved 23 May 2019.
- ↑ 2.0 2.1 "FourQlib". https://www.microsoft.com/en-us/research/project/fourqlib/.
- ↑ "References". 4 October 2021. https://github.com/microsoft/FourQlib.
- ↑ Longa, Patrick; Sica, Francesco (2011). Four-Dimensional Gallant–Lambert–Vanstone Scalar Multiplication. https://eprint.iacr.org/2011/608. Retrieved 23 May 2019.
- ↑ Ladd, Watson; Longa, Patrick; Barnes, Richard (27 March 2017). draft-ladd-cfrg-4q-01. https://datatracker.ietf.org/doc/draft-ladd-cfrg-4q/. Retrieved 23 May 2019.
- ↑ van Oorschot, Paul C.; Wiener, Michael J. (1996). "On Diffie-Hellman Key Agreement with Short Exponents". Advances in Cryptology — EUROCRYPT '96. Lecture Notes in Computer Science. 1070. Springer Berlin Heidelberg. pp. 332–343. doi:10.1007/3-540-68339-9_29. ISBN 978-3-540-61186-8.
- ↑ Babai, L. (1 March 1986). "On Lovász' lattice reduction and the nearest lattice point problem". Combinatorica 6 (1): 1–13. doi:10.1007/BF02579403. ISSN 1439-6912.
- ↑ "Introducing CIRCL". 20 June 2019. https://blog.cloudflare.com/introducing-circl/.
External links
 |  |
