Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\)) (Q2874534)
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 6327727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\)) |
scientific article; zbMATH DE number 6327727 |
Statements
Breaking ‘128-bit Secure’ Supersingular Binary Curves (English)
0 references
7 August 2014
0 references
discrete logarithm problem
0 references
supersingular binary curves
0 references
pairings
0 references
finite fields
0 references
0.8365387320518494
0 references
0.8240268230438232
0 references
0.8157064914703369
0 references
0.8092064261436462
0 references
