Background Elliptic curve cryptographic schemes were proposed independently in 1985 by
Neal Koblitz (Koblitz 1987) and Victor Miller (Miller 1986). They are the elliptic curve …

Public key cryptography is a major interdisciplinary subject with many real-world
applications, such as digital signatures. A strong background in the mathematics underlying …

In this paper we perform a review of elliptic curve cryptography (ECC) as it is used in
practice today in order to reveal unique mistakes and vulnerabilities that arise in …

The power consumed by a circuit varies according to the activity of its individual transistors
and other components. As a result, measurements of the power used by actual computers or …

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 …

We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs).
The basic problem in this class is the following: Given many pairs< xi, msb k ((α+ xi)-1 mod …

Abstract In recent work, Backendal, Haller, and Paterson identified several exploitable
vulnerabilities in the cloud storage provider MEGA. They demonstrated an RSA key recovery …

Stake-based multiparty cryptographic primitives operate in a setting where participants are
associated with their stake, security is argued against an adversary that is bounded by the …

Abstract Recently Cash, Kiltz, and Shoup [13] showed a variant of the Cramer-Shoup (CS)
scheme [14] whose chosen-ciphertext (CCA) security relies on the computational Diffie …

Many privacy-preserving protocols employ a primitive that allows a sender to" flag" a
message to a recipient's public key, such that only the recipient (who possesses the …