ECC over the ring F3d[ε],ε4=0 by using two methods

Abstract

Let F3d is the finite field of order 3d with d be a positive integer, we consider A4:=F3d[ε]=F3d[X]/(X4) is a finite quotient ring, where ε4=0. In this paper, we will show an example of encryption and decryption. Firstly, we will present the elliptic curve over this ring. In addition, we study the algorithmic properties by proposing effective implementations for representing the elements and the group law. Precisely, we give a numerical example of cryptography (encryption and decryption) by using two methods with a secret key.