Post-Quantum Cryptography
4th International Workshop, PQCrypto 2011, Taipei, Taiwan, November 29 – December 2, 2011. Proceedings
Page
%P
31 Result(s)
-
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
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
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
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, ...
-
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...
-
Chapter
Operating Degrees for XL vs. F4/F5 for Generic \(\mathcal{M}Q\) with Number of Equations Linear in That of Variables
We discuss the complexity of \(\mathcal{M}Q\) , or solving multivariate systems of m equations in n variables over the f...
-
Article
Open AccessHigh-speed high-security signatures
This paper shows that a $390 mass-market quad-core 2.4GHz Intel Westmere (Xeon E5620) CPU can create 109000 signatures per second and verify 71000 signatures per second on an elliptic curve at a 2128 security lev...
-
Chapter and Conference Paper
Efficient Parallel Evaluation of Multivariate Quadratic Polynomials on GPUs
QUAD is a provably secure stream cipher, whose security is based on the hardness assumption of solving multivariate quadratic polynomial systems over a finite field, which is known to be NP-complete. However, ...
-
Chapter and Conference Paper
Public-Key Cryptography from New Multivariate Quadratic Assumptions
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryptions. In particular, we research in the following two directions:
-
Chapter and Conference Paper
Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation
When secure arithmetic is required, computation based on secure multiplication (MULT) is much more efficient than computation based on secure Boolean circuits. However, a typical application may also require othe...
-
Chapter and Conference Paper
SHA-3 on ARM11 Processors
This paper presents high-speed assembly implementations of the 256-bit-output versions of all five SHA-3 finalists and of SHA-256 for the ARM11 family of processors. We report new speed records for all of the ...
-
Book and Conference Proceedings
-
Chapter and Conference Paper
ECC2K-130 on NVIDIA GPUs
A major cryptanalytic computation is currently underway on multiple platforms, including standard CPUs, FPGAs, PlayStations and Graphics Processing Units (GPUs), to break the Certicom ECC2K-130 challenge. This...
-
Chapter and Conference Paper
Square, a New Multivariate Encryption Scheme
We propose and analyze a multivariate encryption scheme that uses odd characteristic and an embedding in its construction. This system has a very simple core map F(X) = X 2, allowing for efficient...
-
Chapter and Conference Paper
ECM on Graphics Cards
This paper reports record-setting performance for the elliptic-curve method of integer factorization: for example, 926.11 curves/second for ECM stage 1 with B 1 = 8192 for 280-bit integers on a si...
-
Chapter and Conference Paper
Multivariates Polynomials for Hashing
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security properties and potential feasib...
-
Chapter and Conference Paper
Secure PRNGs from Specialized Polynomial Maps over Any \(\mathbb{F}_{q}\)
Berbain, Gilbert, and Patarin presented QUAD, a pseudo random number generator (PRNG) at Eurocrypt 2006. QUAD (as PRNG and stream cipher) may be proved secure based on an interesting hardness assumption about the...
-
Chapter and Conference Paper
New Differential-Algebraic Attacks and Reparametrization of Rainbow
A recently proposed class of multivariate Public-Key Cryptosystems, the Rainbow-Like Digital Signature Schemes, in which successive sets of central variables are obtained from previous ones by solving linear e...
