In this volume we have endeavored to provide a middle ground-hopefully even a bridge-
between" theory" and" experiment" in the matter of prime numbers. Of course, we speak of …

We expand a previous result of Dean [Dea99] to provide a second preimage attack on all n-
bit iterated hash functions with Damgård-Merkle strengthening and n-bit intermediate states …

Fair exchange stems from a daily life problem: how can two people exchange objects
(material or immaterial) fairly, that is, without anyone being hurt in the exchange? More …

Since the original publication of Martin Hellman's cryptanalytic time-memory trade-off, a few
improvements on the method have been suggested. In all these variants, the cryptanalysis …

We survey the contributions of the entire theoretical computer science/cryptography
community during 1975-2002 that impact the question of how to run verifiable elections with …

Under the assumption that solving the discrete logarithm problem modulo an n-bit safe
prime p is hard even when the exponent is a small c-bit number, we construct a new pseudo …

Exhaustive key search is the simplest attack against a cryptosystem, but it is sometimes the
most realistic. This is specially true for carefully designed block ciphers for which advanced …

A digital signature algorithm (DSA) based on elliptic curve and chaotic mappings is
proposed to strengthen the security of an elliptic curve digital signature algorithm (ECDSA) …

POINT COUNTING ON PICARD CURVES IN LARGE CHARACTERISTIC 1. Introduction Let
p be a prime, p = 2, 3, and let Fq be a finite field Page 1 MATHEMATICS OF …

L'association de la femme à l'encadrement des enfants et des autres femmes est pour
l'instant le modèle dominant au sein des Églises pentecôtistes africaines, parfois associé au …