Academic Journals Database
Disseminating quality controlled scientific knowledge

On Lattice Based Cryptographic Sampling: An Algorithmic Approach

ADD TO MY LIST
 
Author(s): Sunder Lal | Santosh Kumar Yadav | Kuldeep Bhardwaj

Journal: BVICAM's International Journal of Information Technology
ISSN 0973-5658

Volume: 2;
Issue: 1;
Date: 2010;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Sampling algorithm | Best Bound | NTRU Reduction | lattice bases reduction.

ABSTRACT
In this paper we propose a practical lattice based reduction by sampling to avoid any dependence on Schnorr's Geometric Series Assumption. It is a generalization of Schnorr's RSR algorithm. It is also well defined for bases where this algorithm is not applicable. It demonstrates that the sampling reduction can significantly reduce the length of the base vectors. We also propose a practical sampling reduction algorithm for lattice bases based on work by Schnorr. We report the empirical behaviour of these algorithms.

Tango Rapperswil
Tango Rapperswil

     Save time & money - Smart Internet Solutions