GGH encryption algorithm

GGH encryption algorithm

The Goldreich-Goldwasser-Halevi (GGH) signature scheme is an asymmetric key encryption algorithm proposed in 1995 and published in 1997, based on solving the close vector problem (CVP) in a lattice. The encrypter uses the public key, a bad lattice basis, to select a lattice point that represents the message and add a small random noise to that point to form the ciphertext. The decrypter uses the private key, a good basis for the lattice, to solve CVP on the ciphertext; the resulting lattice point is the message representative.

A version of the algorithm was cryptanalyzed by Nguyen in 1999.

The original paper also proposed the GGH signature scheme, a digital signature algorithm.

External links

* [http://www.research.ibm.com/people/s/shaih/pubs/ggh97a.html The webpage of the original paper]
* [http://www.di.ens.fr/~pnguyen/pub.html?#Ng99 The paper cryptanalyzing the original proposal]


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • GGH signature scheme — The Goldreich Goldwasser Halevi (GGH) signature scheme is a digital signature scheme proposed in 1995 and published in 1997, based on solving the closest vector problem (CVP) in a lattice. The signer demonstrates knowledge of a good basis for the …   Wikipedia

  • Lattice based cryptography — is the generic term for asymmetric cryptographic primitives based on lattice. HistoryLattice have first been discovered by mathematicans Lagrange and Gauss. Lattice have been used laterly in computer algorithms and in cryptanalysis. In 1996 Atjai …   Wikipedia

  • NTRUSign — NTRUSign, also known as the NTRU Signature Algorithm, is a public key cryptography digital signature algorithm based on the GGH signature scheme. It was first presented at the rump session of Asiacrypt 2001 and published in peer reviewed form at… …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”