Use of elliptic curves in cryptography
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
ICANCM'11/ICDCC'11 Proceedings of the 2011 international conference on applied, numerical and computational mathematics, and Proceedings of the 2011 international conference on Computers, digital communications and computing
Hi-index | 0.00 |
In this work we study the elliptic curve over the artinian principal ideal ring An = Fq[ε], (εn = 0). More precisely, we establish a group homomorphism betweens (Fqn-1, +) and the abelian group Ea,bn of elliptic curve. For cryptography applications, we give a strongly collision resistant function on Ea,bn and identification methods on Ea,bn.