Search
Search Results
-
Rinocchio: SNARKs for Ring Arithmetic
Succinct non-interactive arguments of knowledge (SNARKs) enable non-interactive efficient verification of NP computations and admit short proofs....
-
Parameterized Algorithms for Covering by Arithmetic Progressions
An arithmetic progression is a sequence of integers in which the difference between any two consecutive elements is the same. We investigate the...
-
Arithmetic Sketching
This paper introduces arithmetic sketching, an abstraction of a primitive that several previous works use to achieve lightweight, low-communication...
-
Montgomery curve arithmetic revisited
A one-third century ago, as a means to speed up the elliptic curve method (ECM) for integer factoring, Montgomery suggested using a special elliptic...
-
Arithmetic Circuits, Structured Matrices and (not so) Deep Learning
This survey presents a necessarily incomplete (and biased) overview of results at the intersection of arithmetic circuit complexity, structured...
-
Finite Field Arithmetic in Large Characteristic for Classical and Post-quantum Cryptography
Both classical and post-quantum cryptography massively use large characteristic finite fields or rings. Consequently, basic arithmetic on these...
-
Big Number and Polynomial Arithmetic
This chapter deals with two related topics that belong to the general area of “computer algebra”: the computation with integer numbers of arbitrary...
-
Time-Optimal Design of Finite Field Arithmetic for SIKE on Cortex-M4
The advances in quantum technologies and the fast move toward quantum computing are threatening classical cryptography and urge the deployment of...
-
Chaotic arithmetic optimization algorithm
Arithmetic Optimization Algorithm (AOA) is a meta-heuristic algorithm. Its main idea is to use the distribution behavior of the four main...
-
Effective and Efficient Masking with Low Noise Using Small-Mersenne-Prime Ciphers
Embedded devices used in security applications are natural targets for physical attacks. Thus, enhancing their side-channel resistance is an...
-
Algorithmic Views of Vectorized Polynomial Multipliers – NTRU Prime
In this paper, we explore the cost of vectorization for multiplying polynomials with coefficients in...
-
-
Multi-threshold image segmentation research based on improved enhanced arithmetic optimization algorithm
Aiming at the shortcomings of arithmetic optimization algorithm (AOA), which has low efficiency and is prone to fall into local optimal solutions,...
-
Streamlined NTRU Prime on FPGA
We present a novel full hardware implementation of Streamlined NTRU Prime, with two variants: a high-speed, high-area implementation and a slower,...
-
-
An arithmetic and geometric mean-based multi-objective moth-flame optimization algorithm
Expanding the capacity of optimization algorithms for simultaneous optimization of multiple competing objectives is a crucial aspect of research....
-
How to Garble Mixed Circuits that Combine Boolean and Arithmetic Computations
The study of garbling arithmetic circuits is initiated by Applebaum, Ishai, and Kushilevitz [FOCS’11], which can be naturally extended to mixed...
-
Formal Verification of Arithmetic Masking in Hardware and Software
Masking is a popular countermeasure to protect cryptographic implementations against physical attacks like differential power analysis. So far,...
-
Correct approximation of IEEE 754 floating-point arithmetic for program verification
Verification of programs using floating-point arithmetic is challenging on several accounts. One of the difficulties of reasoning about such programs...
-
Ideal-SVP is Hard for Small-Norm Uniform Prime Ideals
The presumed hardness of the Shortest Vector Problem for ideal lattices (Ideal-SVP) has been a fruitful assumption to understand other assumptions on...