搜索结果: 1-15 共查到“军事学 Ntru”相关记录47条 . 查询时间(0.062 秒)
In 1998, Jerey Hostein, Jill Pipher, and Joseph H. Silverman introduced the famous Ntru cryptosystem, and called it "A ring-based public key cryptosystem". Actually it turns out to be a lattice based ...
Cryptanalysis of an NTRU-based Proxy Encryption Scheme from ASIACCS'15
NTRUReEncrypt NTRU Decryption Failure
2019/1/29
In ASIACCS 2015, Nuñez, Agudo, and Lopez proposed a proxy re-encryption scheme, NTRUReEncrypt, based on NTRU, which allows a proxy to translate ciphertext under the delegator's public key into a ...
A Generic Attack on Lattice-based Schemes using Decryption Errors with Application to ss-ntru-pke
Lattice-based cryptography NIST post-quantum standardization decryption error
2019/1/19
Hard learning problems are central topics in recent cryptographic research. Many cryptographic primitives relate their security to difficult problems in lattices, such as the shortest vector problem. ...
More Efficient Algorithms for the NTRU Key Generation using the Field Norm
lattice techniques public-key cryptography quantum cryptography
2019/1/9
NTRU lattices are a class of polynomial rings which allow for compact and efficient representations of the lattice basis, thereby offering very good performance characteristics for the asymmetric algo...
We analyze the size vs. security trade-offs that are available when selecting parameters for perfectly correct key encapsulation mechanisms based on NTRU.
Blending FHE-NTRU keys – The Excalibur Property
cryptographic protocols multiparty computaion fully homomorphic encryption
2018/9/6
Can Bob give Alice his decryption secret and be convinced that she will not give it to someone else? This is achieved by a proxy re-encryption scheme where Alice does not have Bob’s secret but instead...
Characterizing overstretched NTRU attacks
lattice techniques overstretched NTRU subfield attack
2018/6/27
Overstretched NTRU, an NTRU variant with a large modulus, has been used as a building block for several cryptographic schemes in recent years. Recently, two lattice subfield attacks and a subring atta...
We propose a detailed construction of Collision Resistance Preimage Sampleable Functions ((CRPSF)) over any cyclotomic field based on NTRU, hence give a provably secure NTRU Signature scheme ((NTRUSig...
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from NTRU Attack
Obfuscation multilinear maps graded encoding schemes
2018/5/11
In this paper, we propose cryptanalyses of all existing indistinguishability obfuscation (iO) candidates based on branching programs (BP) over GGH13 multilinear map. To achieve this, we introduce two ...
Estimate all the {LWE, NTRU} schemes!
post-quantum cryptography public-key cryptography cryptanalysis
2018/4/11
We consider all LWE- and NTRU-based encryption, key encapsulation, and digital signature schemes proposed for standardisation as part of the Post-Quantum Cryptography process run by the US National In...
NTRU-LPR IND-CPA: A New Ideal Lattices-based Scheme
Lattices-based Post-quantum Cryptography NTRUEncrypt NTRU-Prime
2018/1/31
In this paper, we propose NTRU-LPR IND-CPA, a new secure scheme based on the decisional variant of Bounded Distance Decoding problem over rings (DR-BDD). This scheme is IND-CPA secure and has two KEM ...
A Practical Implementation of Identity-Based Encryption over NTRU Lattices
lattice-based cryptography identity-based encryption NTRU
2017/11/1
An identity-based encryption scheme enables the efficient distribution of keys in a multi-user system. Such schemes are particularly attractive in resource constrained environments where critical reso...
Choosing Parameters for the Subfield Lattice Attack against overstretched NTRU
NTRU smaller modulus
2017/10/9
Albrecht et al. at Crypto 2016 and Cheon et al. at ANTS 2016 independently presented a subfield attack on overstretched NTRU problem. Their idea is to map the public key down to the subfield (by norm ...
This paper presents software demonstrating that the 20-year-old NTRU cryptosystem is competitive with more recent lattice-based cryptosystems in terms of speed, key size, and ciphertext size. We prese...
Cryptanalysis of the Overstretched NTRU Problem for General Modulus Polynomial
NTRU Ideal Lattice sub eld attack
2017/6/1
The overstretched NTRU problem, which is the NTRU problem with super-polynomial size q in n, is one of the important security foundation of cryptosystems which are recently suggested. Albrecht et al. ...