Sciweavers

257 search results - page 35 / 52
» On the Security of RSA Screening
Sort
View
EUROPAR
2010
Springer
13 years 9 months ago
Parallel Enumeration of Shortest Lattice Vectors
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
Özgür Dagdelen, Michael Schneider 0002
TCS
2008
13 years 7 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
TC
2010
13 years 2 months ago
Faster Interleaved Modular Multiplication Based on Barrett and Montgomery Reduction Methods
This paper proposes two improved interleaved modular multiplication algorithms based on Barrett and Montgomery modular reduction. The algorithms are simple and especially suitable ...
Miroslav Knezevic, Frederik Vercauteren, Ingrid Ve...
TC
2008
13 years 7 months ago
Cryptanalysis with COPACOBANA
Cryptanalysis of ciphers usually involves massive computations. The security parameters of cryptographic algorithms are commonly chosen so that attacks are infeasible with availabl...
Tim Güneysu, Timo Kasper, Martin Novotn&yacut...
CCS
2009
ACM
14 years 2 months ago
Anonymous credentials on a standard java card
Secure identity tokens such as Electronic Identity (eID) cards are emerging everywhere. At the same time usercentric identity management gains acceptance. Anonymous credential sch...
Patrik Bichsel, Jan Camenisch, Thomas Groß, ...