Improvement of Lattice-Based Cryptography Using CRT

Plantard, Thomas; Rose, Mike; Susilo, Willy

doi:10.1007/978-3-642-11731-2_34

Cited by 6 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this work, the proposals [11], [12] for using RNS to enhance the decryption procedure of GGH-like cryptosystems were considered and concretized. They were applied not only to GPU accelerators, but also to CPU devices.…”

Section: Discussionmentioning

confidence: 99%

“…In their first form, GGH signature and encryption schemes were severely broken [4], [5] and thwarting these attacks is still a current concern [6]- [8]. Recently, GGH has got many improvements [9]- [11] to make it competitive under secure parameters. This article deals with efficient implementation of GGH decryption function, via an arithmetical approach as suggested in [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Programmable RNS lattice-based parallel cryptographic decryption

Martins

Sousa

Eynard

et al. 2015

2015 IEEE 26th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)

View full text Add to dashboard Cite

Should quantum computing become viable, current public-key cryptographic schemes will no longer be valid. Since cryptosystems take many years to mature, research on postquantum cryptography is now more important than ever. Herein, lattice-based cryptography is focused on, as an alternative postquantum cryptosystem, to improve its efficiency. We put together several theoretical developments so as to produce an efficient implementation that solves the Closest Vector Problem (CVP) on Goldreich-Goldwasser-Halevi (GGH)-like cryptosystems based on the Residue Number System (RNS). We were able to produce speed-ups of up to 5.9 and 11.2 on the GTX 780 Ti and i7 4770K devices, respectively, when compared to a single-core optimized implementation. Finally, we show that the proposed implementation is a competitive alternative to the Rivest-Shamir-Adleman (RSA).

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Programmable RNS lattice-based parallel cryptographic decryption

Martins

Sousa

Eynard

et al. 2015

2015 IEEE 26th International Conference on Application-Specific Systems, Architectures and Processors (ASAP)

View full text Add to dashboard Cite

show abstract

“…Since Shor's discovery of the quantum factoring algorithm in the mid-1990s attempts to solve lattice problems by quantum algorithms have been made. With the continuous advancements in the field of quantum computing, the security of many existing asymmetric key cryptosystems has been demonstrated to be broken in the theoretical sense [7].…”

Section: Relationship Of Qc and Latticementioning

confidence: 99%

Quantum and Lattices

Anyanwu¹,

Alese²,

O.³

2013

IJCA

View full text Add to dashboard Cite

show abstract

“…Originally proposed with size of parameters making it viable in practice, encryption and signature GGH schemes, however, contained major flaws [19,20], forcing the lattice dimensions to be greater than suggested, essentially in order to put attacks based on lattice reduction out of action. Thus, many consecutive works were concerned by as well thwarting these attacks [17,32] as bringing practical improvements [18,22,27] to make such scheme viable under safe parameters.…”

mentioning

confidence: 99%