all InfoSec news
Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves
Jan. 20, 2023, 9:30 p.m. |
IACR News www.iacr.org
ePrint Report: Computation of Hilbert class polynomials and modular polynomials from supersingular elliptic curves
Antonin Leroux
We present several new heuristic algorithms to compute class polynomials and modular polynomials modulo a prime $P$. For that, we revisit the idea of working with supersingular elliptic curves.
The best known algorithms to this date are based on ordinary curves, due to the supposed inefficiency of the supersingular case. While this was true a decade ago, the recent advances in the study of …
algorithms case class computation compute elliptic eprint report modular prime report working
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
1 day, 21 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
1 day, 21 hours ago |
www.iacr.org
Improving Generic Attacks Using Exceptional Functions
1 day, 21 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
3 days, 1 hour ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist II: Network Architect
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Engineering Manager - Cloud Security team
@ SentinelOne | Prague, Czech Republic
Legal & Compliance Apprentice (H/F)
@ Novo Nordisk | Puteaux, Île-de-France, FR
Manager, Governance Risk & Compliance
@ Comcast | Virtual