Sciweavers

1834 search results - page 175 / 367
» Public Key Cryptography
Sort
View
EUROCRYPT
2004
Springer
14 years 2 months ago
Projective Coordinates Leak
Denoting by P = [k]G the elliptic-curve double-and-add multiplication of a public base point G by a secret k, we show that allowing an adversary access to the projective representa...
David Naccache, Nigel P. Smart, Jacques Stern
ANTS
2006
Springer
78views Algorithms» more  ANTS 2006»
14 years 1 months ago
Hidden Pairings and Trapdoor DDH Groups
This paper suggests a new building block for cryptographic protocols and gives two instantiations of it. The concept is to generate two descriptions of the same group: a public des...
Alexander W. Dent, Steven D. Galbraith
CCS
2008
ACM
13 years 11 months ago
Controlled privacy preserving keyword search
Data sharing on public servers has become a popular service on the Internet, in which users can store and share data with other users through public servers. However, because the ...
Stephen S. Yau, Yin Yin
FSE
2009
Springer
107views Cryptology» more  FSE 2009»
14 years 4 months ago
Multidimensional Extension of Matsui's Algorithm 2
Matsui’s one-dimensional Alg. 2 can be used for recovering bits of the last round key of a block cipher. In this paper a truly multidimensional extension of Alg. 2 based on estab...
Miia Hermelin, Joo Yeon Cho, Kaisa Nyberg
ARITH
2007
IEEE
14 years 3 months ago
Fast Modular Reduction
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal