TESLAC: Accelerating Lattice-Based Cryptography with AI Accelerator

A High Speed NTT Accelerator for Lattice-Based Cryptography

2021 International Conference on Communications, Information System and Computer Engineering (CISCE) ◽

10.1109/cisce52179.2021.9445982 ◽

2021 ◽

Author(s):

Chongyang Li ◽

Wenping zhu ◽

Leibo Liu

Keyword(s):

High Speed ◽

Lattice Based Cryptography

Download Full-text

On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography

IEEE Transactions on Computers ◽

10.1109/tc.2016.2642962 ◽

2018 ◽

Vol 67 (3) ◽

pp. 322-334 ◽

Cited By ~ 17

Author(s):

James Howe ◽

Ayesha Khalid ◽

Ciara Rafferty ◽

Francesco Regazzoni ◽

Maire O'Neill

Keyword(s):

Lattice Based Cryptography

Download Full-text

Proxy Re-Encryption in cloud using ALBC (adaptive lattice based cryptography)

Indonesian Journal of Electrical Engineering and Computer Science ◽

10.11591/ijeecs.v16.i3.pp1455-1463 ◽

2019 ◽

Vol 16 (3) ◽

pp. 1455

Author(s):

Chandrakala B M ◽

S C Lingareddy

Keyword(s):

Comparative Analysis ◽

Data Sharing ◽

Data Security ◽

Key Generation ◽

Encryption Scheme ◽

Two Phase ◽

Data Store ◽

Learning With Errors ◽

Lattice Based Cryptography

<p>In recent days, data sharing has provided the flexibility to share the data, store the data, and perform operation on data virtually as well as cost effectively. Data sharing in cloud is one of the feature, which is being popular and widely accepted. However, the concern here is to ensure the data security and this has led the researcher to research in this area. To provide the security several Proxy re-encryption scheme has been introduced, however all these method lacks of efficiency. Hence In this paper, we propose a scheme known as ALBC (Adaptive Lattice Based Cryptography), this scheme follows the two phase i.e. encryption and Re-encryption. Encryption phase has few algorithms such as Key_Gen, Enc, Dec. Similarly ALBC Re-Enc has five algorithm i.e. Key_Gen, Key_ReGen, Enc, Re-Enc, Dec. our algorithm not only provides the security but also solves the problem of RL(Ring-learning) with errors problems. In order to evaluate, our algorithm is compared with the existing model in terms of encryption time, decryption time, re-encryption time, key generation and key regeneration by varying the various key size. When we observe the comparative analysis, it is observed that our algorithm outperforms the existing algorithm.</p>

Download Full-text