17 search results - page 2 / 4 » New Public Key Cryptosystem Using Finite Non Abelian Groups |
SIAMCOMP
2008
13 years 4 months ago
2008
Abstract. We present efficient compression algorithms for subgroups of multiplicative groups of finite fields, we use our compression algorithms to construct efficient public key c...
EUROCRYPT
1999
Springer
13 years 9 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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The paper analyzes CFVZ, a new public key cryptosystem whose security is based on a matrix version of the discrete logarithm problem over an elliptic curve. It is shown that the co...
PKC
2000
Springer
13 years 8 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
CTRSA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast ...