z-logo
open-access-imgOpen Access
Solving a 676-Bit Discrete Logarithm Problem in GF(36n)
Author(s) -
Takuya Hayashi,
Naoyuki Shinohara,
Lihua Wang,
Shin’ichiro Matsuo,
Masaaki Shirase,
Tsuyoshi Takagi
Publication year - 2012
Publication title -
ieice transactions on fundamentals of electronics communications and computer sciences
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 0.188
H-Index - 52
eISSN - 1745-1337
pISSN - 0916-8508
DOI - 10.1587/transfun.e95.a.204
Subject(s) - discrete logarithm , finite field , cryptosystem , gf(2) , mathematics , logarithm , cryptography , elliptic curve , discrete mathematics , arithmetic , function (biology) , set (abstract data type) , computer science , theoretical computer science , algorithm , public key cryptography , encryption , pure mathematics , mathematical analysis , operating system , evolutionary biology , programming language , biology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom