๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Kangaroos, Monopoly and Discrete Logarithms

โœ Scribed by J. M. Pollard

Book ID
105839993
Publisher
Springer
Year
2000
Tongue
English
Weight
62 KB
Volume
13
Category
Article
ISSN
0933-2790

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Computing discrete logarithms with the p
Computing discrete logarithms with the parallelized kangaroo method
โœ Edlyn Teske ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 241 KB

The Pollard kangaroo method computes discrete logarithms in arbitrary cyclic groups. It is applied if the discrete logarithm is known to lie in a certain interval, say [a; b], and then has expected running time O( โˆš b -a) group operations. In its serial version it uses very little storage. It can be

Incomplete Character Sums and Polynomial
Incomplete Character Sums and Polynomial Interpolation of the Discrete Logarithm
โœ Harald Niederreiter; Arne Winterhof ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 99 KB

In the "rst part of the paper, certain incomplete character sums over a "nite "eld F N P are considered which in the case of "nite prime "elds F N are of the form , where A and N are integers with 14N(p, g and f are polynomials over F N , and denotes a multiplicative and an additive character of F

Discrete logarithm based chameleon hashi
Discrete logarithm based chameleon hashing and signatures without key exposure
โœ Xiaofeng Chen; Fangguo Zhang; Haibo Tian; Baodian Wei; Kwangjo Kim ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 232 KB

Chameleon signatures simultaneously provide the properties of non-repudiation and nontransferability for the signed message. However, the initial constructions of chameleon signatures suffer from the key exposure problem of chameleon hashing. This creates a strong disincentive for the recipient to c