Aggregatable Subvector Commitment with Efficient Updates
An aggregatable subvector commitment scheme extends a vector commitment scheme by enabling the aggregation of multiple proofs into a single compact subvector proof.
Qing Xu, Chenyang Gao, Yunling Wang
doaj +1 more source
Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained. [PDF]
Liu J +5 more
europepmc +1 more source
Algoritmo de Karatsuba en contexto aditivo
The algorithm given by Anatoly Alexeevitch Karatsuba in 1960 (Karatsuba, 1962) for multiplication does not apply only in a multiplicative context, it can be applied to an algebraic context that is defined starting from a previous wellformed equivalence ...
Ayuso Pérez, Jesús
core
Obtaining More Karatsuba-Like Formulae over The Binary Field [PDF]
The aim of this paper is to find more Karatsuba-like formulae for a fixed set of moduli polynomials in GF(2)[x]. To this end, a theoretical framework is established. We first generalize the division algorithm, and then present a generalized definition of
Haining Fan +3 more
core +1 more source
Additive FFTs for HQC on ARM Cortex-M4, Revisited
This paper presents an optimized implementation of the Hamming Quasi- Cyclic (HQC) key encapsulation mechanism, leveraging the additive fast Fourier transform (FFT) for polynomial multiplication.
Ming-Shing Chen +5 more
doaj +1 more source
Atomicity and Regularity Principles Do Not Ensure Full Resistance of ECC Designs against Single-Trace Attacks. [PDF]
Kabin I, Dyka Z, Langendoerfer P.
europepmc +1 more source
Quantum Implementation of AIM: Aiming for Low-Depth
Security vulnerabilities in the symmetric-key primitives of a cipher can undermine the overall security claims of the cipher. With the rapid advancement of quantum computing in recent years, there is an increasing effort to evaluate the security of ...
Kyungbae Jang +3 more
doaj +1 more source
Factoring semi-primes with (quantum) SAT-solvers. [PDF]
Mosca M, Verschoor SR.
europepmc +1 more source
Analisis Waktu Eksekusi Algoritma Perkalian Karatsuba dan Nikhilam
Multiplication is a common thing which is done by everybody in daily routine. Even though, multiplication in Computer Science is not as simple as what is done by most people.
Felix, Felix
core
A Programmable Crypto-Processor for National Institute of Standards and Technology Post-Quantum Cryptography Standardization Based on the RISC-V Architecture. [PDF]
Lee J, Kim W, Kim JH.
europepmc +1 more source

