A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
From MaRDI portal
Publication:5048971
DOI10.1007/978-3-030-51938-4_11zbMATH Open1504.94192OpenAlexW3031677562MaRDI QIDQ5048971FDOQ5048971
Authors: Monika Trimoska, Sorina Ionica, Gilles Dequen 
Publication date: 9 November 2022
Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_11
Recommendations
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- scientific article; zbMATH DE number 1302788
- On the computational complexity of ECDLP for elliptic curves in various forms using index calculus
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- On index calculus algorithms for subfield curves
- scientific article; zbMATH DE number 1113836
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Computing all S-integral points on elliptic curves
- Information Security and Privacy
- A New Model of Binary Elliptic Curves
symmetryelliptic curvesdiscrete logarithmsatisfiabilityindex calculuspoint decomposition\textsc{dpll} algorithm
Cites Work
- The Magma algebra system. I: The user language
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- A machine program for theorem-proving
- Parallel collision search with cryptanalytic applications
- Hybrid approach for solving multivariate systems over finite fields
- On the discrete logarithm problem in elliptic curves. II
- Title not available (Why is that?)
- Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- On polynomial systems arising from a Weil descent
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- On the discrete logarithm problem in elliptic curves
- Title not available (Why is that?)
- Summation polynomial algorithms for elliptic curves in characteristic two
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- Improvement of Faugère et al.'s method to solve ECDLP
- A crossbred algorithm for solving Boolean polynomial systems
- Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
- Revisiting AES related-key differential attacks with constraint programming
- Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs
- Beating brute force for (quantified) satisfiability of circuits of bounded treewidth
Cited In (1)
Uses Software
This page was built for publication: A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5048971)
