Point Decomposition Problem in Binary Elliptic Curves

DOI10.1007/978-3-319-30840-1_10zbMath1352.94042arXiv1504.02347OpenAlexW2208552461MaRDI QIDQ2806768

Koray Karabina

Publication date: 19 May 2016

Published in: Mathematics of Computation, Information Security and Cryptology - ICISC 2015 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02347

zbMATH Keywords

elliptic curvesdiscrete logarithm problemexponentiationpairing-based cryptographypoint decomposition problemsquaringSemaev polynomialscyclotomic subgroups

Mathematics Subject Classification ID

Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items

Faster Hashing to ${\mathbb G}_2$, Families of SNARK-friendly 2-chains of elliptic curves, Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, A survey of elliptic curves for proof systems, Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves, Recent progress on the elliptic curve discrete logarithm problem, Choosing and generating parameters for pairing implementation on BN curves, Updating key size estimations for pairings, Low-cost addition-subtraction sequences for the final exponentiation in pairings, Improving the computation of the optimal ate pairing for a high security level, Koblitz curves over quadratic fields

Uses Software

• Barreto-Naehrig

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of pairing-friendly elliptic curves
• Faster Explicit Formulas for Computing Pairings over Ordinary Curves
• High-Speed Software Implementation of the Optimal Ate Pairing over Barreto–Naehrig Curves
• Compression in Finite Fields and Torus-Based Cryptography
• Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
• Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
• Factor-4 and 6 compression of cyclotomic subgroups of and
• Integer Variable χ–Based Ate Pairing
• Double-Exponentiation in Factor-4 Groups and Its Applications
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Public-key cryptosystems based on cubic finite field extensions
• Advances in Cryptology – CRYPTO 2004
• Practical Cryptography in High Dimensional Tori
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Cryptology - CRYPTO 2003
• Algorithmic Number Theory
• Cryptography and Coding
• Algorithmic Number Theory