Efficient finite field multiplication for isogeny based post quantum cryptography (Q5267802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient finite field multiplication for isogeny based post quantum cryptography |
scientific article; zbMATH DE number 6730166
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient finite field multiplication for isogeny based post quantum cryptography |
scientific article; zbMATH DE number 6730166 |
Statements
Efficient Finite Field Multiplication for Isogeny Based Post Quantum Cryptography (English)
0 references
13 June 2017
0 references
modular multiplication
0 references
isogeny
0 references
post-quantum cryptography
0 references
0 references
0 references
0.8461933135986328
0 references
0.7757822275161743
0 references
0.7667785286903381
0 references
0.7667446732521057
0 references
0.7621598243713379
0 references
