[Home ] [Archive]   [ فارسی ]  
:: Main :: About :: Current Issue :: Archive :: Search :: Submit :: Contact ::
Main Menu
Home::
Journal Information::
Articles archive::
For Authors::
For Reviewers::
Registration::
Site Facilities::
Indexing::
Contact us::
::
Search in website

Advanced Search
..
Receive site information
Enter your Email in the following box to receive the site news and information.
..
Print ISSN
Print ISSN: 2476-3047
..
:: Search published articles ::
Showing 1 results for Lattices Hard Problems

, ,
Volume 3, Issue 1 (9-2014)
Abstract

  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.



Page 1 from 1     

دوفصل نامه علمی  منادی امنیت فضای تولید و تبادل اطلاعات( افتا) Biannual Journal Monadi for Cyberspace Security (AFTA)
Persian site map - English site map - Created in 0.03 seconds with 27 queries by YEKTAWEB 4710