Finite-Field Parallel Adder Circuit Over Prime Numbers Based on Spiking Neural P Systems
| Autor: | Emmanuel Tonatihu Juárez-Velázquez, Carlos Alfonso Trejo-Villanueva, Derlis Hernández-Lara |
|---|---|
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Advances in Soft Computing ISBN: 9783030898199 MICAI (2) |
| DOI: | 10.1007/978-3-030-89820-5_17 |
| Popis: | Nowadays, the arithmetic operations precision is one of the most critical aspects in the development of efficient finite-field arithmetic circuits, because they are involved in several applications, for example, in advanced cryptographic algorithms such as AES (Advanced Encryption Standard), elliptic curves and RSA (Rivest Shamir Adleman). Most of these algorithms have been implemented on general purpose machines. However, the performance of recent computational systems could not satisfy the computational needs to perform finite-field arithmetic computations of large bit-length numbers, because the word length of these processors is too small compared with the bit-length of these numbers and thus suffer from the resulting increase in execution time. One potential solution can be found in the development of advanced highly parallel computing systems. Recently, an emerging branch of natural computation has created arithmetic circuits based on parallel computing (Spiking Neural P Systems). Most of them perform basic arithmetic operations sequentially despite of having intrinsic parallelism. In this paper, we introduce for the first time, the design of a finite-field parallel adder circuit, which is highly inspired by neural processing of the soma, synaptic weights and rules on the synapses, to process numbers with large bit-length efficiently. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|