you are in... Main\gf2^131mult
Function gf2^131mult finds product of two elements, a and b, of a
field GF(2^{131}). The output, c=ab, is written onto the last 131 bits.
Inputs a and b must remain unchanged. Solving
Discrete Logarithm over Elliptic Curve Group over GF(2^{131}) by a
quantum computer with a Shor-like attack requires implementing gf2^131mult.
A successful attack unlocks Level-I
unsolved Certicom challenge.
Primitive polynomial |
Picture |
Machine-readable version |
Model |
Garbage |
Gate count |
Quantum cost |
Author(s) |
Date |
x^{131}+x^{7}+x^{6}+ x^{5}+ x^{4}+x+1 |
N/A (too large) |
CNT |
262 |
17,811 |
86,455 |
January, 2018 |
________________________________
^{m}
- the number is shown to be minimal