Public-Key Cryptography – PKC 2016
19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part I
Page
%P
-
Chapter and Conference Paper
Algorithmic Views of Vectorized Polynomial Multipliers – NTRU Prime
In this paper, we explore the cost of vectorization for multiplying polynomials with coefficients in \(\mathbb {{Z}}_q\) ...
-
Chapter and Conference Paper
Algorithmic Views of Vectorized Polynomial Multipliers – NTRU
The lattice-based post-quantum cryptosystem NTRU is used by Google for protecting Google’s internal communication. In NTRU, polynomial multiplication is one of bottleneck. In this paper, we explore the interac...
-
Article
Open AccessStreamlined 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, low-area implementation. We introduce several new techniques t...
-
Chapter and Conference Paper
CoqCryptoLine: A Verified Model Checker with Certified Results
We present the verified model checker CoqCryptoLine for cryptographic programs with certified verification results. The CoqCryptoLine verification algorithm consists of two reductions. The algebraic reduction tra...
-
Chapter and Conference Paper
Correction to: CoqCryptoLine: A Verified Model Checker with Certified Results
-
Chapter and Conference Paper
Certified Verification for Algebraic Abstraction
We present a certified algebraic abstraction technique for verifying bit-accurate non-linear integer computations. In algebraic abstraction, programs are lifted to polynomial equations in the abstract domain. ...
-
Chapter and Conference Paper
Efficient Multiplication of Somewhat Small Integers Using Number-Theoretic Transforms
Conventional wisdom purports that FFT-based integer multiplication methods (such as the Schönhage–Strassen algorithm) begin to compete with Karatsuba and Toom–Cook only for integers of several tens of thousand...
-
Chapter and Conference Paper
Secure Boolean Masking of Gimli
Gimli is a highly secure permutation with high performance across a broad range of platforms. However, side-channel analysis poses a threat to the Gimli without any masking protection. To resist side-channel anal...
-
Chapter and Conference Paper
Verifying Post-Quantum Signatures in 8 kB of RAM
In this paper, we study implementations of post-quantum signature schemes on resource-constrained devices. We focus on verification of signatures and cover NIST PQC round-3 candidates Dilithium, Falcon, Rainbo...
-
Chapter and Conference Paper
The Nested Subset Differential Attack
In 2017, Ward Beullens et al. submitted Lifted Unbalanced Oil and Vinegar [3], which is a modification to the Unbalanced Oil and Vinegar Scheme by Patarin. Previously, Ding et al. proposed the Subfield Differenti...
-
Chapter and Conference Paper
CoqQFBV: A Scalable Certified SMT Quantifier-Free Bit-Vector Solver
We present a certified SMT QF_BV solver CoqQFBV built from a verified bit blasting algorithm, Kissat, and the verified SAT certificate checker GratChk in this paper. Our verified bit blasting algorithm supports ...
-
Chapter and Conference Paper
Implementing Joux-Vitse’s Crossbred Algorithm for Solving \({\mathcal M\mathcal Q}\) Systems over \({\mathbb F}_2\) on GPUs
The hardness of solving multivariate quadratic ( \(\mathcal {MQ}\) ) systems is the underlying problem for mu...
-
Chapter and Conference Paper
Asymptotically Faster Quantum Algorithms to Solve Multivariate Quadratic Equations
This paper designs and analyzes a quantum algorithm to solve a system of m quadratic equations in n variables over a finite field ...
-
Chapter and Conference Paper
HMFEv - An Efficient Multivariate Signature Scheme
Multivariate Cryptography, as one of the main candidates for establishing post-quantum cryptosystems, provides strong, efficient and well-understood digital signature schemes such as UOV, Rainbow, and Gui. Whi...
-
Chapter and Conference Paper
Gauss Sieve Algorithm on GPUs
Lattice-based cryptanalysis is an important field in cryptography since lattice problems are among the most robust assumptions, and have been used to construct most cryptographic primitives. In this research, ...
-
Book and Conference Proceedings
-
Book and Conference Proceedings
Public-Key Cryptography – PKC 2016
19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Taipei, Taiwan, March 6-9, 2016, Proceedings, Part II
-
Chapter and Conference Paper
Multi-core FPGA Implementation of ECC with Homogeneous Co-Z Coordinate Representation
Elliptic Curve Cryptography is gaining popularity, and optimization opportunities exist on several different levels: algorithm, architecture, and/or implementation. To support a wide variety of curves and at t...
-
Chapter and Conference Paper
A Memory Efficient Variant of an Implementation of the F \(_4\) Algorithm for Computing Gröbner Bases
Solving multivariate systems of polynomial equations is an important problem both as a subroutine in many problems and in its own right. Currently, the most efficient solvers are the Gröbner-basis solvers, whi...
-
Chapter and Conference Paper
Tuning GaussSieve for Speed
The area of lattice-based cryptography is growing ever-more prominent as a paradigm for quantum-resistant cryptography. One of the most important hard problem underpinning the security of lattice-based cryptos...
