Since the introduction of public-key cryptography by Diffie and Hellman in 1976, the
potential for the use of the discrete logarithm problem in public-key cryptosystems has been …

Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of
constants, from the well known to the highly exotic. This book is helpful both to readers …

VI Preface methods from information theory. Unconditionally secure schemes are now
addressed in an extra chapter, Chapter 10.• Unconditional security is not achievable without …

ELLIPTIC CURVES AND PRIMALITY PROVING 1. Introduction Primality testing is one of the
most flourishing fields in computational n Page 1 mathematics of computation volume 61 …

In this paper we discuss a source of finite abelian groups suitable for cryptosystems based
on the presumed intractability of the discrete logarithm problem for these groups. They are …

This book is intended as a text for a course on cryptography with emphasis on algebraic
methods. It is written so as to be accessible to graduate or advanced undergraduate …

A very efficient recursive algorithm for generating nearly random provable primes is
presented. The expected time for generating a prime is only slightly greater than the …

We present a scalar multiplication algorithm with recovery of the y-coordinate on a
Montgomery form elliptic curve over any non-binary field. The previous algorithms for scalar …

LNCS 1716 - Speeding up the Discrete Log Computation on Curves with Automorphisms Page
1 Speeding up the Discrete Log Computation on Curves with Automorphisms I. Duursma1, P …

A Family of Jacobians Suitable for Discrete Log Cryptosystems Abstract. Page 1 A Family of
Jacobians Suitable for Discrete Log Cryptosystems Xeal Koblitz, Dept. of Mathematics GN-50 …