Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

On computing logarithms over GF(2p)

Publiceringsår: 1981
Språk: Engelska
Sidor: 326-334
Publikation/Tidskrift/Serie: BIT Numerical Mathematics
Volym: 21
Nummer: 3
Dokumenttyp: Artikel i tidskrift
Förlag: Springer


In this paper we present a new, heuristic method for computing logarithms over GF(2P).

When 2P-1 is a Mersenne prime <231-1 it works in very short running times on a

general purpose computer. It is based on the interdependent relations

f,~(t) = t-2~f(t) 2"


log f~s(t) = - 2' + 2" log f(t),

where f and frs are polynomials over GF(2).

Its cryptographic significance is discussed and it can be considered as an attempt to

swindle MITRE Corporation which reportedly is using a public key distribution system,

based on the presumed difficulty in computing logarithms over GF(2127).


  • Electrical Engineering, Electronic Engineering, Information Engineering


  • ISSN: 0006-3835

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen