Results 81 to 90 of about 2,741,809 (181)
ElectricaHamming Quasi-Cyclic (HQC) is a code-based key encapsulation mechanism that stands out in the National Institute of Standards and Technology Post-Quantum Cryptography standardization process.
Cemile İnce
doaj +1 more source
Missing a trick: Karatsuba variations [PDF]
, 2020 There are a variety of ways of applying the Karatsuba idea to multi-digit multiplication. These apply particularly well in the context where digits do not use the full word-length of the computer, so that partial products can be safely accumulated ...
Mike Scott
core +1 more source
Algoritmo de Karatsuba en operaciones de exponenciación
, 2018 El algoritmo dado por Anatoly Alexeevitch Karatsuba en 1960 (Karatsuba, 1962) para la multiplicación no es únicamente aplicable a dicha operación, se puede aplicar a cualquier operación algebraica que se construya sobre una operación que cumpla la ...
Ayuso Pérez, Jesús
core
IEEE AccessThe most widely used asymmetric cipher is ECC. It can be applied to IoT applications to offer various security services. However, a wide range of sectors have been investigated for applying ECC. The field of elliptic curve cryptographic processors for GF
Sumit Singh Dhanda +7 more
doaj +1 more source
, 2023 SABER is a round 3 candidate in the NIST Post-Quantum Cryptography Standardization process. Polynomial convolution is one of the most computationally intensive operation in Saber Key Encapsulation Mechanism, that can be performed through widely explored ...
Mok, Kai Ming +11 more
core +1 more source
Современные информационные технологии и IT-образованиеThis article considers a computational method that is more efficient than methods based on the divide-and-conquer principle. Goethe once said that divide and conquer is a good principle, but the principle of unite and guide is better.
Rustem Aidagulov, Valery Vasenin
doaj +1 more source
Comments on Montgomery’s “Five, Six, and Seven-Term Karatsuba-Like Formulae”
, 2008 We show that multiplication complexities of n-term Karatsuba-Like formulae (7 < n < 19) in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x − ∞) w.
Haining Fan, M. Anwar Hasan
core
Alternative to the Karatsuba algorithm for software implementations of GF(2 n ) multiplications
IET Information Security, 2009 A new approach to subquadratic space complexity GF(2n) multipliers has been proposed recently. The corresponding algorithm for software implementations is developed. While its recursive implementation is as simple as that of the Karatsuba algorithm, it requires much less memory to store the look-up table.
Haining Fan, Masud Anwarul Hasan
openaire +1 more source
Algoritmo de booth-karatsuba en operaciones aditivas
, 2018 The algorithm given by Andrew Donald Booth in 1950 (Booth, 1951) for multiplication and the algorithm given by Anatoly Alexeevitch Karatsuba in 1960 (Karatsuba, 1962) in turn for multiplication prove to have much more in common than what its authors ...
Ayuso Pérez, Jesús
core
Discover Artificial IntelligenceEven though face recognition is now an essential part of modern security, surveillance and authentication systems its large-scale adoption in real-time, limited resource environments poses persistent challenges.
Debmalya Sanyal +4 more
doaj +1 more source