搜索结果: 1-8 共查到“ideal lattice”相关记录8条 . 查询时间(0.078 秒)
Domain-specific Accelerators for Ideal Lattice-based Public Key Protocols
Public Key Cryptography Post-quantum Cryptography Lattice-based Cryptography
2018/6/25
Post Quantum Lattice-Based Cryptography (LBC) schemes are increasingly gaining attention in traditional and emerging security problems, such as encryption, digital signature, key exchange, homomorphic...
On the Leakage Resilience of Ideal-Lattice Based Public Key Encryption
lattice-based cryptography leakage resilience Ring-LWE
2017/11/27
We consider the leakage resilience of the Ring-LWE analogue of the Dual-Regev encryption scheme (R-Dual-Regev for short), originally presented by Lyubashevsky et al. (Eurocrypt '13). Specifically, we ...
Digital Signatures Based on the Hardness of Ideal Lattice Problems in all Rings
lattice ideal lattice Ring-SIS
2016/12/10
In this work, we show that the above may actually be possible. We construct a digital signature scheme based (in the random oracle model) on a simple adaptation of the Ring-SIS problem which is as har...
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography
Post-quantum cryptography number theoretic transform (NTT) ring learning with errors (R-LWE)
2016/5/24
The Number Theoretic Transform (NTT) provides efficient algorithms for cyclic and nega-cyclic convolutions, which have many applications in computer arithmetic, e.g., for multiplying large integers an...
High-Performance Ideal Lattice-Based Cryptography on 8-bit ATxmega Microcontrollers
Ideal lattices NTT RLWE
2015/12/31
Over the last years lattice-based cryptography has received much attention due to versatile
average-case problems like Ring-LWE or Ring-SIS that appear to be intractable by quantum computers.
But de...
Efficient (ideal) lattice sieving using cross-polytope LSH
shortest vector problem sieving algorithms locality-sensitive hashing
2015/12/23
Combining the efficient cross-polytope locality-sensitive hash family of Terasawa and Tanaka with the heuristic lattice sieve algorithm of Micciancio and Voulgaris, we show how to obtain heuristic and...
Parallel Gauss Sieve Algorithm : Solving the SVP in the Ideal Lattice of 128-dimensions
shortest vector problem lattice-based cryptography
2014/3/12
In this paper, we report that we have solved the SVP Challenge over a 128-dimensional lattice in Ideal Lattice Challenge from TU Darmstadt, which is currently the highest dimension in the challenge th...
A Local-Global Approach to Solving Ideal Lattice Problems
shortest lattice vector problems closest lattice vector problems
2014/3/10
We construct an innovative SVP(CVP) solver for ideal lattices in case of any relative extension of number fields L/K of degree n where L is real(contained in R). The solver, by exploiting the relation...