Search: id:"swepub:oai:lup.lub.lu.se:51a974a3-8587-4c3d-9716-fa4b36529cc3" >
On computing logari...
On computing logarithms over GF(2p)
-
Herlestam, Tore (author)
-
- Johannesson, Rolf (author)
- Lund University,Lunds universitet,Institutionen för elektro- och informationsteknik,Institutioner vid LTH,Lunds Tekniska Högskola,Department of Electrical and Information Technology,Departments at LTH,Faculty of Engineering, LTH
-
(creator_code:org_t)
- 1981
- 1981
- English.
-
In: BIT Numerical Mathematics. - 0006-3835. ; 21:3, s. 326-334
- Related links:
-
http://dx.doi.org/10...
-
show more...
-
https://lup.lub.lu.s...
-
https://doi.org/10.1...
-
show less...
Abstract
Subject headings
Close
- 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" and 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).
Subject headings
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Publication and Content Type
- art (subject category)
- ref (subject category)
Find in a library
To the university's database