Elliptic Curve Cryptography (ECC) over a Galois Field GF (2m) offers a high security level relative to other protocols (i.e., RSA) but with smaller keys' sizes. In this paper, we consider the finite field multiplication and addition used in elliptic curve cryptography to design sequential, and then, concurrent reconfigurable ecrypto system to encrypt and decrypt a message. FPGA implementation via VHDL language has been completed to analyze the time and area required in both scenarios. Our approach, and for the first time, consider mapping a message on the elliptic curve concurrently.
展开▼
机译：Galois Field GF（2 m ）上的椭圆曲线密码术（ECC）相对于其他协议（例如RSA）具有较高的安全级别，但是密钥的大小较小。在本文中，我们考虑了椭圆曲线加密中使用的有限域乘法和加法来设计顺序，然后使用并发可重构密码系统来加密和解密消息。通过VHDL语言实现的FPGA已经完成，可以分析两种情况下所需的时间和面积。我们的方法（也是第一次）考虑同时在椭圆曲线上映射消息。
展开▼
