%0 Journal Article %T مروری بر رمزنگاری مشبکه - مبنا %J Biannual Journal Monadi for Cyberspace Security (AFTA) %V 3 %N 1 %U http://monadi.isc.org.ir/article-1-23-en.html %R %D 2014 %K Lattice-based Cryptography, Lattices hard problems, GGH, NTRU, NSS., %X   The purpose of this paper is twofold: Study of the mathematical background on lattice theory and its applications to cryptography. In the latter area, lattice theory has played a crucial role in the definition of new cryptosystems, in the study of cryptographic primitives and in cryptanalysis. Lattice-based public-key cryptosystems relies on computational hard problems based on the shortest vector problem (SVP) and the closest vector problem (CVP) in lattices for their security. In this paper, we present a short introduction to lattice theory and its hard problems and also we study the most important lattice-based public-key cryptosystems and digital signature together with their security analysis and some applied examples. %> http://monadi.isc.org.ir/article-1-23-en.pdf %P 3-14 %& 3 %! %9 Review Article %L A-10-39-1 %+ %G eng %@ 2476-3047 %[ 2014