[图书][B] Modern computer arithmetic
RP Brent, P Zimmermann - 2010 - books.google.com
Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently
performing arithmetic operations such as addition, multiplication and division, and their …
performing arithmetic operations such as addition, multiplication and division, and their …
Saber on ARM CCA-secure module lattice-based key encapsulation on ARM
The CCA-secure lattice-based post-quantum key encapsulation scheme Saber is a
candidate in the NIST's post-quantum cryptography standardization process. In this paper …
candidate in the NIST's post-quantum cryptography standardization process. In this paper …
Réduction de réseau et sécurité concrete du chiffrement completement homomorphe
Y Chen - 2013 - theses.fr
La popularité de la cryptographie à base de réseau euclidien a considérablement augmenté
ces dernières années avec la découverte de nouvelles fonctionnalités spectaculaires, telles …
ces dernières années avec la découverte de nouvelles fonctionnalités spectaculaires, telles …
Faster algorithms for approximate common divisors: Breaking fully-homomorphic-encryption challenges over the integers
Y Chen, PQ Nguyen - Annual International Conference on the Theory and …, 2012 - Springer
At EUROCRYPT'10, van Dijk et al. presented simple fully-homomorphic encryption (FHE)
schemes based on the hardness of approximate integer common divisors problems, which …
schemes based on the hardness of approximate integer common divisors problems, which …
Space and time-efficient quantum multiplier in post quantum cryptography era
This paper examines the asymptotic performance of multiplication and the cost of quantum
implementation for the Naive schoolbook, Karatsuba, and Toom-Cook methods in the …
implementation for the Naive schoolbook, Karatsuba, and Toom-Cook methods in the …
Depth-optimization of quantum cryptanalysis on binary elliptic curves
This paper presents quantum cryptanalysis for binary elliptic curves from a time-efficient
implementation perspective (ie, reducing the circuit depth), complementing the previous …
implementation perspective (ie, reducing the circuit depth), complementing the previous …
[HTML][HTML] Polynomial-based key management for secure intra-group and inter-group communication
Secure group communication has become an important issue in many applications. Both
intra-group and inter-group multicast traffic must be protected by shared secret keys. In order …
intra-group and inter-group multicast traffic must be protected by shared secret keys. In order …
A polynomial subset-based efficient multi-party key management system for lightweight device networks
Wireless Sensor Networks (WSNs) consist of lightweight devices to measure sensitive data
that are highly vulnerable to security attacks due to their constrained resources. In a similar …
that are highly vulnerable to security attacks due to their constrained resources. In a similar …
Another concrete quantum cryptanalysis of binary elliptic curves
This paper presents concrete quantum cryptanalysis for binary elliptic curves for a time-
efficient implementation perspective (ie, reducing the circuit depth), complementing the …
efficient implementation perspective (ie, reducing the circuit depth), complementing the …
Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count
I Van Hoof - arXiv preprint arXiv:1910.02849, 2019 - arxiv.org
Multiplication is an essential step in a lot of calculations. In this paper we look at
multiplication of 2 binary polynomials of degree at most $ n-1$, modulo an irreducible …
multiplication of 2 binary polynomials of degree at most $ n-1$, modulo an irreducible …