Sciweavers

10 search results - page 1 / 2
» How to Generalize RSA Cryptanalyses
Sort
View
ICISC
2007
125views Cryptology» more  ICISC 2007»
13 years 6 months ago
A Cryptanalysis of the Double-Round Quadratic Cryptosystem
In the 80’s Matsumoto and Imai [8] proposed public key cryptosystems based on the difficulty of solving systems of polynomials in several variables. Although these first schemes...
Antoine Scemama
RSA
1998
54views more  RSA 1998»
13 years 4 months ago
Random disease on the square grid
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
József Balogh, Gábor Pete
AFRICACRYPT
2009
Springer
13 years 2 months ago
Efficient Acceleration of Asymmetric Cryptography on Graphics Hardware
Graphics processing units (GPU) are increasingly being used for general purpose computing. We present implementations of large integer modular exponentiation, the core of public-ke...
Owen Harrison, John Waldron
PKC
2007
Springer
160views Cryptology» more  PKC 2007»
13 years 11 months ago
Anonymous Signatures Made Easy
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
Marc Fischlin
SAINT
2003
IEEE
13 years 10 months ago
Distributed Authentication for Peer-to-Peer Networks
A public key infrastructure is generally (and effectively) used for cryptographically secure authentication in the networks. Ad-hoc networks are formed in haphazard manner. Securi...
Shardul Gokhale, Partha Dasgupta