COCO
2011
Springer
12 years 4 months ago
2011
Springer
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
JCT
2006
13 years 4 months ago
2006
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
EJC
2008
13 years 4 months ago
2008
In 2004, Cs
EUROCRYPT
2006
Springer
13 years 8 months ago
2006
Springer
Let g be an element of prime order p in an abelian group and Zp. We show that if g, g , and gd are given for a positive divisor d of p - 1, we can compute the secret in O(log p
CRYPTO
2001
Springer
13 years 9 months ago
2001
Springer
Most public key cryptosystems have been constructed based on abelian groups up to now. We propose a new public key cryptosystem built on finite non abelian groups in this paper. I...
PAIRING
2007
Springer
13 years 10 months ago
2007
Springer
— In EUROCRYPT 2006, Cheon proposed breakthrough algorithms for pairing-related problems such as the q-weak/strong Diffie-Hellman problem. Using that the exponents of an element ...
CHES
2007
Springer
13 years 10 months ago
2007
Springer
This papers introduces several binary scalar multiplication algorithms with applications to cryptography. Remarkably, the proposed algorithms regularly repeat the same pattern when...