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.
展开▼
机译：椭圆曲线加密（ECC）通过Galois Field GF（2M）提供了相对于其他协议（即RSA）的高安全级别，但键尺寸较小。在本文中，我们考虑在椭圆曲线加密中使用的有限场乘法和添加到设计顺序，然后并发可重新配置的ECRYPTO系统来加密和解密消息。通过VHDL语言的FPGA实现已经完成以分析这两种情况所需的时间和区域。我们的方法，并首次考虑同时映射椭圆曲线上的消息。
展开▼
