A note on Diem's proof
From MaRDI portal
Publication:3454601
DOI10.1007/978-3-319-16745-9_25zbMATH Open1403.94083OpenAlexW831619891MaRDI QIDQ3454601FDOQ3454601
Authors: Song Tian, Kun Peng Wang, Bao Li, Wei Yu 
Publication date: 25 November 2015
Published in: Information Security and Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-16745-9_25
Recommendations
- Some relations between Semaev's summation polynomials and Stange's elliptic nets
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- Elliptic curve discrete logarithm problem over small degree extension fields
- Complexity bounds on Semaev's naive index calculus method for ECDLP
Cites Work
- Algebraic Function Fields and Codes
- Title not available (Why is that?)
- 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?)
- Solving degenerate sparse polynomial systems faster
Cited In (6)
- Some relations between Semaev's summation polynomials and Stange's elliptic nets
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- On the first fall degree of summation polynomials
- Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
- A Note on Robert Recorde and the Dienes Blocks
- Title not available (Why is that?)
This page was built for publication: A note on Diem's proof
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454601)
