2016Unpublished venueRequires access

Generalized low density lattices for GGH cryptosystem

Sarah Kamel, Mireille Sarkiss, Ghaya Rekaya-Ben Othman

Open publisher page 1 citations

Abstract

Goldreich-Goldwasser-Halevi (GGH) is a lattice-based public-key cryptosystem which has been widely developed due to its simple encryption and decryption procedures. Despite many existing GGH improvements, its huge public key size remains its main drawback, which prevents the system from being used in practice. In order to reduce the key size, we propose in this paper a new GGH cryptosystem using Generalized low density (GLD) lattices. For this proposed GGH lattice-based scheme, we provide a security analysis by considering all known attacks on GGH systems. We conclude that our scheme is as secure as the existing GGH schemes. We also investigate the complexity of our cryptosystem and prove that GLD lattices reduce significantly the key size and the complexity of the key generation and decryption phases compared to other GGH systems.

About this research paper

What this paper is about

Goldreich-Goldwasser-Halevi (GGH) is a lattice-based public-key cryptosystem which has been widely developed due to its simple encryption and decryption procedures. Despite many existing GGH improvements, its huge public key size remains its main drawback, which prevents the system from being used in practice. In order to reduce the key size, we propose in this paper a new GGH cryptosystem using Generalized low density (GLD) lattices. For this proposed GGH lattice-based scheme, we provide a security analysis by considering all known attacks on GGH systems. We conclude that our scheme is as secure as the existing GGH schemes. We also investigate the complexity of our cryptosystem and prove that GLD lattices reduce significantly the key size and the complexity of the key generation and decryption phases compared to other GGH systems.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Goldreich-Goldwasser-Halevi (GGH) is a lattice-based public-key cryptosystem which has been widely developed due to its simple encryption and decryption procedures. Despite many existing GGH improvements, its huge public key size remains its main drawback, which prevents the system from being used in practice. In order to reduce the key size, we propose in this paper a new GGH cryptosystem using Generalized low density (GLD) lattices. For this proposed GGH lattice-based scheme, we provide a security analysis by considering all known attacks on GGH systems. We conclude that our scheme is as secure as the existing GGH schemes. We also investigate the complexity of our cryptosystem and prove that GLD lattices reduce significantly the key size and the complexity of the key generation and decryption phases compared to other GGH systems.

Key concepts: Cryptosystem, Hybrid cryptosystem, Key encapsulation, Computer science, Key (lock), Public-key cryptography, Encryption, Scheme (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Generalized low density lattices for GGH cryptosystem — Research Paper | ScholarLens