Sciweavers

4340 search results - page 199 / 868
» Formal Methods and Cryptography
Sort
View
APLAS
2009
ACM
15 years 11 months ago
The Higher-Order, Call-by-Value Applied Pi-Calculus
We define a higher-order process calculus with algebraic operations such as encryption and decryption, and develop a bisimulation proof method for behavioral equivalence in this c...
Nobuyuki Sato, Eijiro Sumii
EUROCRYPT
2005
Springer
15 years 10 months ago
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
We present a new and flexible formulation of Coppersmith’s method for finding small solutions of bivariate polynomials p(x, y) over the integers. Our approach allows to maximiz...
Johannes Blömer, Alexander May
PKC
2005
Springer
109views Cryptology» more  PKC 2005»
15 years 10 months ago
Fast Multi-computations with Integer Similarity Strategy
Abstract. Multi-computations in finite groups, such as multiexponentiations and multi-scalar multiplications, are very important in ElGamallike public key cryptosystems. Algorithm...
Wu-Chuan Yang, Dah-Jyh Guan, Chi-Sung Laih
CHES
2003
Springer
88views Cryptology» more  CHES 2003»
15 years 9 months ago
A New Algorithm for Switching from Arithmetic to Boolean Masking
To protect a cryptographic algorithm against Differential Power Analysis, a general method consists in masking all intermediate data with a random value. When a cryptographic algo...
Jean-Sébastien Coron, Alexei Tchulkine
TYPES
2007
Springer
15 years 10 months ago
A Declarative Language for the Coq Proof Assistant
This paper presents a new proof language for the Coq proof assistant. This language uses the declarative style. It aims at providing a simple, natural and robust alternative to the...
Pierre Corbineau