搜索结果: 1-9 共查到“军事学 lattice cryptography”相关记录9条 . 查询时间(0.061 秒)
Faster AVX2 optimized NTT multiplication for Ring-LWE lattice cryptography
lattice cryptography NTT implementation
2018/1/11
Constant-time polynomial multiplication is one of the most time-consuming operations in many lattice-based cryptographic constructions. For schemes based on the hardness of Ring-LWE in power-of-two cy...
In this work we apply information theoretically optimal arithmetic coding and a number of novel side-channel blinding countermeasure techniques to create BLZZRD, a practical, compact, and more quantum...
Lattice Cryptography for the Internet
lattice cryptography efficiency key encapsulation/transport
2016/1/26
In recent years, lattice-based cryptography has been recognized for its many attractive properties, such
as strong provable security guarantees and apparent resistance to quantum attacks, flexibility...
A Practical Key Exchange for the Internet using Lattice Cryptography
Cryptography Lattice Ring-LWE Ring Learning With Errors
2016/1/4
In 2014, Peikert presented an efficient and provably secure set of lower level primitives for practical post-quantum cryptography. These primitives also gave the first lattice-based scheme to provide ...
Lattice-based cryptography is the use of conjectured hard problems on point lattices in $\R^{n}$ as the foundation for secure cryptographic constructions. Attractive features of lattice cryptography i...
Gaussian Sampling Precision in Lattice Cryptography
Post-Quantum Cryptography Lattice Public Key Cryptography Gaussian Sampling
2015/12/22
Security parameters and attack countermeasures for Lattice-based cryptosystems have
not yet matured to the level that we now expect from RSA and Elliptic Curve implementations.
Many modern Ring-LWE ...
Even More Practical Key Exchanges for the Internet using Lattice Cryptography
Cryptography Lattice Ring-LWE
2015/12/21
In 2014, Peikert described the first practical lattice-based key exchange that is provably
secure and provides perfect forward security. However, his presentation lacks concrete proposals
for parame...
Tighter Security for Efficient Lattice Cryptography via the R閚yi Divergence of Optimized Orders
lattice based cryptography tight reduction R磂nyi divergence
2015/12/21
In security proofs of lattice based cryptography, bounding the closeness of two probability
distributions is an important procedure. To measure the closeness, the R磂nyi divergence has been used
inst...
Λ◦λ :A Functional Library for Lattice Cryptography
lattice cryptography Ring-LWE fully homomorphic encryption
2015/12/21
Theory affinity: Λ◦λ is designed from the ground-up around the specialized ring representations, fast
algorithms, and worst-case hardness proofs that have been developed for the Ring-LWE proble...