Skip to main content

Standard curve database

Search

w-383-mers

383-bit prime field Weierstrass curve.

Curve from https://eprint.iacr.org/2014/130.pdf. No generator present.


y2x3+ax+by^2 \equiv x^3 + ax + b

Parameters

NameValue
p0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe5b
a0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe58
b0x17dbc
n0x7fffffffffffffffffffffffffffffffffffffffffffffffa9caf814a8a116ad9fb0b4035417aaf319297fc0bb7a439f
h0x01


Characteristics

  • j-invariant:
    11763417020248336900531851014528852113062851552345693728565095240611454671801552872415821277149082183594513817350077
  • Trace of Frobenius:
    2113793218673198987988742457840023505747218554421793635005
  • Discriminant:
    19701003098197239606139520050071806902539869635232723333974146702122860885748605305707133127442457820399188403718683
  • Embedding degree:
    19701003098197239606139520050071806902539869635232723333972032908904187686760616563249293103936710601848892201517982
  • CM-discriminant:
    -74335890621480155989754748787396375367320169623343827664223445845656783833349619164859155948472241645542524819261923
  • Conductor:
    1

SAGE

p = 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe5b
K = GF(p)
a = K(0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe58)
b = K(0x17dbc)
E = EllipticCurve(K, (a, b))
# No generator defined
E.set_order(0x7fffffffffffffffffffffffffffffffffffffffffffffffa9caf814a8a116ad9fb0b4035417aaf319297fc0bb7a439f * 0x01)

PARI/GP

p = 0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe5b
a = Mod(0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe58, p)
b = Mod(0x17dbc, p)
E = ellinit([a, b])
E[16][1] = 0x7fffffffffffffffffffffffffffffffffffffffffffffffa9caf814a8a116ad9fb0b4035417aaf319297fc0bb7a439f * 0x01
\\ No generator defined

JSON

{
"name": "w-383-mers",
"desc": "Curve from https://eprint.iacr.org/2014/130.pdf. No generator present.",
"sources": [
{
"name": "Selecting Elliptic Curves for Cryptography: An Efficiency and Security Analysis",
"url": "https://eprint.iacr.org/2014/130"
}
],
"form": "Weierstrass",
"field": {
"type": "Prime",
"p": "0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe5b",
"bits": 383
},
"params": {
"a": {
"raw": "0x7ffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffe58"
},
"b": {
"raw": "0x17dbc"
}
},
"order": "0x7fffffffffffffffffffffffffffffffffffffffffffffffa9caf814a8a116ad9fb0b4035417aaf319297fc0bb7a439f",
"cofactor": "0x01",
"characteristics": {
"cm_disc": "-74335890621480155989754748787396375367320169623343827664223445845656783833349619164859155948472241645542524819261923",
"conductor": "1",
"discriminant": "19701003098197239606139520050071806902539869635232723333974146702122860885748605305707133127442457820399188403718683",
"j_invariant": "11763417020248336900531851014528852113062851552345693728565095240611454671801552872415821277149082183594513817350077",
"embedding_degree": "19701003098197239606139520050071806902539869635232723333972032908904187686760616563249293103936710601848892201517982",
"trace_of_frobenius": "2113793218673198987988742457840023505747218554421793635005"
}
}

© 2020-2025 Jan Jancar | Built with Dox theme for Gatsby