Loading…
Gaussian sampling of lattices for cryptographic applications
Gaussian sampling is the major class of algorithms for solving the close vector problem(CVP)of lattices.In this paper we present a novel Gaussian sampling algorithm,which has the same cryptographic applications with original Gaussian sampling algorithms.Our novel Gaussian sampling algorithm has smal...
Saved in:
Published in: | Science China. Information sciences 2014-07, Vol.57 (7), p.150-157 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Gaussian sampling is the major class of algorithms for solving the close vector problem(CVP)of lattices.In this paper we present a novel Gaussian sampling algorithm,which has the same cryptographic applications with original Gaussian sampling algorithms.Our novel Gaussian sampling algorithm has smaller deviations,meaning smaller space sizes of lattice based public-key ciphers.The shape of our novel algorithm is almost repeated implementations of original algorithm,with random repeating times.Major result is that the deviation can be reduced to 0.64~0.75 of that of original Gaussian sampling algorithm without clearly increasing the average time cost. |
---|---|
ISSN: | 1674-733X 1869-1919 |
DOI: | 10.1007/s11432-013-4843-4 |