Algorithmresearch
Ekerå–Håstad algorithm
Also called Ekerå–Håstad short discrete log.
Reduces RSA factoring to a short discrete log, giving a cheaper quantum factoring route.
Reduces RSA factoring to a short discrete log, giving a cheaper quantum factoring route.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 86HVR8 Edit this page History Report an error