Continuing a bestselling tradition, An Introduction to Cryptography, Second Edition provides
a solid foundation in cryptographic concepts that features all of the requisite background …

The book introduces new techniques that imply rigorous lower bounds on the com plexity of
some number-theoretic and cryptographic problems. It also establishes certain attractive …

This book is mainly devoted to some computational and algorithmic problems in finite fields
such as, for example, polynomial factorization, finding irreducible and primitive polynomials …

We consider the problem of recovering a hidden element s of a finite field F_q of q elements
from queries to an oracle that for a given x∈F_q returns (x+s)^e for a given divisor e∣q-1 …

INFORMATION TO USERS Page 1 INFORMATION TO USERS This manuscript has been
reproduced from the microfilm master. UMI films the text directly from the original or copy …

Garbling schemes, also known as decomposable randomized encodings (DRE), have found
many applications in cryptography. However, despite a large body of work on constructing …

The Distribution of the Quadratic Symbol in Function Fields and a Faster Mathematical Stream
Cipher Page 1 Progress in Computer Science and Applied Logic, Vol. 20 © 2001 Birkhiiuser …

Let E Γ be a family of hyperelliptic curves defined by Y^2=̄Q(X,Γ), where ̄Q is defined over
a small finite field of odd characteristic. Then with ̄γ in an extension degree n field over this …

We consider two natural instances of the problem of determining a function f: G→ G defined
on a group G by making repeated queries to the oracle O (x)= χ (f (x)), where χ is a known …

We construct a family of finite binary sequences which has a remarkable uniformity with
respect to specification of several terms and which also has the property that every …