Results 11 to 20 of about 72,380 (161)
Method to Improve the Cryptographic Properties of S-Boxes
IEEE Access, 2023 This study presents a method based on elementary logic and arithmetic operations to enhance the cryptographic properties of Substitution Boxes (S-Boxes).
Jesus Agustin Aboytes-Gonzalez +4 more
doaj +1 more source
Another look at some fast modular arithmetic methods
Journal of Mathematical Cryptology, 2009 In this work we re-examine a modular multiplication and a modular exponentiation method. The multiplication method, proposed by Hayashi in 1998, uses knowledge of the factorization of both N + 1 and N + 2 to compute a multiplication modulo N. If both N +
Hinek M. Jason, Lam Charles C. Y.
doaj +1 more source
Masta: An HE-Friendly Cipher Using Modular Arithmetic
IEEE Access, 2020 The Rasta cipher, proposed by Dobraunig et al. (CRYPTO 2018), is an HE-friendly cipher enjoying the fewest ANDs per bit and the lowest ANDdepth among the existing ciphers.
Jincheol Ha +6 more
doaj +1 more source
Minimizing CNOT-count in quantum circuit of the extended Shor’s algorithm for ECDLP
Cybersecurity, 2023 The elliptic curve discrete logarithm problem (ECDLP) is a popular choice for cryptosystems due to its high level of security. However, with the advent of the extended Shor’s algorithm, there is concern that ECDLP may soon be vulnerable.
Xia Liu, Huan Yang, Li Yang
doaj +1 more source
Implementation of RSA Signatures on GPU and CPU Architectures
IEEE Access, 2020 This paper reports a constant-time CPU and GPU software implementation of the RSA exponentiation by using algorithms that offer a first-line defense against timing and cache attacks.
Eduardo Ochoa-Jimenez +3 more
doaj +1 more source
Montgomery Reduction for Gaussian Integers
Cryptography, 2021 Modular arithmetic over integers is required for many cryptography systems. Montgomery reduction is an efficient algorithm for the modulo reduction after a multiplication. Typically, Montgomery reduction is used for rings of ordinary integers.
Malek Safieh, Jürgen Freudenberger
doaj +1 more source
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
Algorithms, 2010 The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic.
Sanjay Mehrotra, Zhifeng Li
doaj +1 more source
Algorithms for estimating modular numbers in floating-point arithmetic
Наука. Инновации. Технологии, 2022 In the residue number system (RNS), the operations of addition, subtraction, and multiplication are executed in parallel for different digits (residues) of the modular numbers.
Konstantin Sergeevich Isupov
doaj
A Modular Framework for Generic Quantum Algorithms
Mathematics, 2022 We describe a general-purpose framework to design quantum algorithms. This framework relies on two pillars: a basic data structure called quantum matrix and a modular structure based on three quasi-independent modules.
Alberto Manzano +6 more
doaj +1 more source
Bio-Inspired Constant-Time Arithmetic Kernels in Hybrid Membrane–Neural Spiking P Systems
MathematicsThis work introduces Hybrid Membrane–Neural P systems (HMN P systems), a computational model that integrates principles from membrane computing and spiking neural P systems. The resulting framework offers a versatile foundation for the development of bio-
Eduardo Vázquez +7 more
doaj +1 more source