13 papers · ranked by Valyu relevance
Pedro Juan Roig, Salvador Alcaraz, Katja Gilly, Cristina Bernad + 3 more
'Carlos Juiz' 'Ramon Gonzalez Carvajal' 'Marco Picone'] Multi-access edge computing implementations are ever increasing in both the number of deployments and the areas of application. In this context, the easiness in the operations of packet forwarding between two end devices being part of a particular edge computing…
Mikhail Selianinau, Yuriy Povstenko, Sergio Cruces, Rubén Martín-Clemente + 2 more
'Rubén Martín-Clemente' 'Andrzej Cichocki' 'Iván Durán-Díaz'] In this paper, we deal with the critical problems in residue arithmetic. The reverse conversion from a Residue Number System (RNS) to positional notation is a main non-modular operation, and it constitutes a basis of other non-modular procedures used to…
Mikhail Selianinau, Yuriy Povstenko, Jun Chen, Sadaf Salehkalaibar
In this paper, we consider one of the key problems in modular arithmetic. It is known that scaling in the residue number system (RNS) is a rather complicated non-modular procedure, which requires expensive and complex operations at each iteration. Hence, it is time consuming and needs too much hardware for…
Cansu Demirkiran, Lakshmi Nair, Darius Bunandar, Ajay Joshi
Analog computing has reemerged as a promising avenue for accelerating deep neural networks (DNNs) to overcome the scalability challenges posed by traditional digital architectures. However, achieving high precision using analog technologies is challenging, as high-precision data converters are costly and impractical.…
Zhantao Zhang, Weijiang Wang, Jingqi Zhang, Xiang He + 4 more
With the development of mobile communication, digital signatures with low latency, low area, and high security are in increasing demand. Elliptic curve cryptography (ECC) is widely used because of its security and lightweight. Elliptic curve scalar multiplication (ECSM) is the basic arithmetic in ECC. Based on this…
Ravikumar Selvam, Akhilesh Tyagi, Pak Kwong Chan
In this paper, residue number system (RNS) based logic is proposed as a protection against power side-channel attacks. Every input to RNS logic is encrypted as a share of the original input in the residue domain through modulus values. Most existing countermeasures enhance side-channel privacy by making the power trace…
Deming Wang, Yuhang Lin, Jianguo Hu, Chong Zhang + 2 more
'José de Jesús Rangel Magdaleno'] The Internet of Things requires greater attention to the security and privacy of the network. Compared to other public-key cryptosystems, elliptic curve cryptography can provide better security and lower latency with shorter keys, rendering it more suitable for IoT security. This paper…
Khai Nguyen, Tung Nguyen, Hung Nguyen, Linh Tran + 1 more
This paper introduces a hardware architecture designed for constant-time modular inversion over prime fields, a critical function in Elliptic Curve Cryptography (ECC). We use Kaliski’s Almost Inversion Algorithm to develop an efficient FPGA-based solution. The proposed design guarantees constant-time execution…
José de Jesús Morales Romero, Mario Alfredo Reyes Barranca, David Tinoco Varela, Luis Martin Flores Nava + 3 more
'David Tinoco Varela' 'Luis Martin Flores Nava' 'Emilio Rafael Espinosa Garcia' 'Juvenal Rodriguez-Resendiz' 'Arman Roohi'] Cryptographic algorithms (RSA, DSA, and ECC) use modular exponentiation as part of the principal operation. However, Non-profiled Side Channel Attacks such as Simple Power Analysis and…
Anissa Sghaier, Medien Zeghid, Chiraz Massoud, Hassan Yousif Ahmed + 5 more
The advent of the Internet of Things (IoT) has enabled millions of potential new uses for consumers and businesses. However, with these new uses emerge some of the more pronounced risks in the connected object domain. Finite fields play a crucial role in many public-key cryptographic algorithms (PKCs), which are used…
Nicolas Allen Smoot
In 2018, Liuquan Wang and Yifan Yang proved the existence of an infinite family of congruences for the smallest parts function corresponding to the third-order mock theta function $\omega q$. Their proof took the form of an induction requiring 20 initial relations, and utilized a space of modular functions isomorphic…
Kritsanapong Somsuk
This aim of this research is to present the improved equations to enhance RSA cryptography for signing and verifying processes. The primary benefit is in signing procedure, where it could decrease computing resources by introducing a new integer to be utilized as exponents instead of the private key. In fact, this…
Ralf Hemmecke, Peter Paule, Cristian-Silviu Radu
\usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\pi $$\end{document} π Authors: Ralf Hemmecke, Peter Paule, Cristian-Silviu Radu Referring to ideas of Sato and Yang in…