402 search results - page 9 / 81 » Cryptosystems using Linear Groups |
DCC
2000
IEEE
14 years 9 months ago
2000
IEEE
The first practical public key cryptosystem to be published, the Diffie-Hellman key exchange algorithm, was based on the assumption that discrete logarithms are hard to compute. T...
62
Voted
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
Recently, and contrary to the common belief, Rivest and Silverman argued that the use of strong primes is unnecessary in the RSA cryptosystem. This paper analyzes how valid this as...
SETA
2004
Springer
15 years 3 months ago
2004
Springer
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
CSDA
2006
14 years 10 months ago
2006
A new method to detect different linear structures in a data set, called Linear Grouping Algorithm (LGA), is proposed. LGA is useful for investigating potential linear patterns in...
131
click to vote
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...