搜索结果: 46-53 共查到“军事学 ring-LWE”相关记录53条 . 查询时间(0.058 秒)
Ring-LWE Cryptography for the Number Theorist
lattice-based cryptography homomorphic encryption
2015/12/24
In this paper, we survey the status of attacks on the ring
and polynomial learning with errors problems (RLWE and PLWE). Recent
work on the security of these problems [EHL, ELOS] gives rise to
inte...
NEON PQCryto: Fast and Parallel Ring-LWE Encryption on ARM NEON Architecture
Lightweight Implementation Lattice-based Cryptography ARM NEON Architecture
2015/12/21
Recently, ARM NEON architecture has occupied a significant
share of tablet and smartphone markets due to its low cost
and high performance. This paper studies efficient techniques of
lattice-based ...
Compact Ring-LWE based Cryptoprocessor
Lattice-based cryptography ring-LWE Polynomial multiplication Number Theoretic Transform Hardware implementation
2014/3/5
In this paper we propose an efficient and compact processor for a ring-LWE based encryption scheme. We present three optimizations of the Number Theoretic Transform (NTT) used for polynomial multiplic...
Recent advances in lattice cryptography, mainly stemming from the development of ring-based primitives such as ring-$\lwe$, have made it possible to design cryptographic schemes whose efficiency is co...
Efficient Multi-Query CPIR from Ring-LWE
cryptographic protocols / Circuit complexity compressed constant-weight codes computational batch codes CPIR parallel computation ring-LWE
2012/3/22
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
Efficient Multi-Query CPIR from Ring-LWE
cryptographic protocols / Circuit complexity compressed constant-weight codes computational batch codes CPIR parallel computation ring-LWE
2012/3/21
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
We propose an $(n, m)$-computationally-private information retrieval (CPIR) protocol with rate $1 - o (1)$ and highly nontrivial (sublinear and data-dependent) server's computational complexity. For t...
Fully Homomorphic Encryption and Ring-LWE over the Integers
Fully Homomorphic Encryption Principal Ideal Lattice Ring-LWE over theIntegers
2011/3/11
This paper constructs a new fully homomorphic encryption scheme by applying self-loop bootstrappable technique. The security of our scheme depends on the hardness of the decision problem of a hidden p...