Parallel isogeny path finding with limited memory (Q6169469)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7726569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel isogeny path finding with limited memory |
scientific article; zbMATH DE number 7726569 |
Statements
Parallel isogeny path finding with limited memory (English)
0 references
14 August 2023
0 references
isogenies
0 references
cryptanalysis
0 references
GPU
0 references
golden collision search
0 references
meet-in-the-middle
0 references
time-memory trade-offs
0 references
efficient implementation
0 references
0.8025485277175903
0 references
0.786106288433075
0 references
0.761885941028595
0 references
0.7604499459266663
0 references
0.7576152682304382
0 references
