On the Efficiency of Polynomial Multiplication for Lattice-Based Cryptography on GPUs Using CUDA

Akleylek, Sedat; Dagdelen, Özgür; Tok, Zaliha Yüce

doi:10.1007/978-3-319-29172-7_10

Cited by 12 publications

(5 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nejatollahi et al [38] outline two different works that optimize the NTT using an Nvidia GPU. The first reports higher throughput polynomial multiplication [39] and the second is a performance evaluation between several versions of the NTT, including iterative NTT, parallel NTT, and CUDA-based FFT (cuFFT) for different polynomial sizes [40]. Strictly algorithmic optimizations of the NTT are presented in other works [41,42].…”

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

“…However, one drawback of using power-of-2 moduli is the inability to take advantage of faster NTT multiplication since the moduli are not prime. As described above, Akleylek et al [40] examines the performance of different multiplication techniques. By implementing a version of cuFFT in a similar fashion for SABER, we may observe a speedup in polynomial multiplication.…”

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

See 1 more Smart Citation

Post Quantum Cryptographic Keys Generated with Physical Unclonable Functions

et al. 2021

View full text Add to dashboard Cite

Lattice and code cryptography can replace existing schemes such as elliptic curve cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic keys is then more complex for handling longer keys. This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code-based cryptography. Handshakes between client devices containing the physical unclonable functions (PUFs) and a server are used to select sets of addressable positions in the PUFs, from which streams of bits called seeds are generated on demand. The public and private cryptographic key pairs are computed from these seeds together with additional streams of random numbers. The method allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network. Technologies such as high performance computing, and graphic processing units can further enhance security by preventing attackers from making this independent validation when only equipped with less powerful computers.

show abstract

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

Post Quantum Cryptographic Keys Generated with Physical Unclonable Functions

et al. 2021

View full text Add to dashboard Cite

show abstract

“…Nejatollahi et al [39] outline two different works that optimize the NTT using an Nvidia GPU. The first reports higher throughput polynomial multiplication [40] and the second is a performance evaluation between several versions of the NTT, including iterative NTT, parallel NTT, and CUDA-based FFT (cuFFT) for different polynomial sizes [41]. Strictly algorithmic optimizations of the NTT are presented in other works [42][43].…”

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

“…However, one drawback of using power-of-2 moduli is the inability to take advantage of faster NTT multiplication since the moduli are not prime. As described above, Akleylek et al [41] examines the performance of different multiplication techniques. By implementing a verison of cuFFT in a similar fashion for SABER, we may observe a speedup in polynomial multiplication.…”

Section: Implementation Of Pqc Algorithms For Pkimentioning

confidence: 99%

See 1 more Smart Citation

Key Distribution for Post Quantum Cryptography using Physical Unclonable Functions

Cambou¹,

Gowanlock²,

Yıldız³

et al. 2021

Preprint

View full text Add to dashboard Cite

Lattice and code cryptography can replace existing schemes such as Elliptic Curve Cryptography because of their resistance to quantum computers. In support of public key infrastructures, the distribution, validation and storage of the cryptographic keys is then more complex to handle longer keys. This paper describes practical ways to generate keys from physical unclonable functions, for both lattice and code based cryptography. Handshakes between client devices containing the PUFs and a server are used to select sets of addressable positions in the PUFs, from which streams of bits called seeds are generated on demand. The public and private cryptographic key pairs are computed from these seeds together with additional streams of random numbers. The method allows the server to independently validate the public key generated by the PUF, and act as a certificate authority in the network. Technologies such as High performance computing, and graphic processing units can further enhance security by preventing attackers to make this independent validation when only equipped with less powerful computers.

show abstract