EFFICIENT ARITHMETIC FOR LATTICE-BASED CRYPTOGRAPHY ON GPU USING THE CUDA PLATFORM

Date

2014-04-25

Author

AKLEYLEK, SEDAT
Tok, Zaliha Yuce

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

107
views

0
downloads

The demand to lattice-based cryptographic schemes has been inreasing. Due to processing unit having multiple processors, there is a need to implements such protocols on these platforms. Graphical processing units (GPU) have attracted so much attention. In this paper, polynomial multiplication algorithms, having a very important role in lattice-based cryptographic schemes, are implemented on a GPU (NVIDIA Quadro 600) using the CUDA platform. FFT-based and schoolbook multiplication methods are implemented in serial and parallel way and a timing comparison for these techniques is given. It's concluded that for the polynomials whose degrees are up to 2000 the fastest polynomial multiplication method is iterative NTT.

Subject Keywords

Graphics processing units, Instruction sets, Cryptography, Signal processing, Conferences, Polynomials, Educational institutions

URI

https://hdl.handle.net/11511/65236

Conference Name

22nd IEEE Signal Processing and Communications Applications Conference (SIU)

Collections

Department of Computer Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

A Secure and Efficient Protocol for Electronic Treasury Auctions Bektas, Atilla; Kiraz, Mehmet Sabir; Uzunkol, Osmanbey (2014-10-17) Auctions have become an important part of electronic commerce. Considering the gradually increasing importance of confidentiality and privacy in auction modeling, various designs have been proposed to ensure secure transmission especially in sealed-bid auctions. However, to the best of our knowledge there is no secure and privacy preserving Treasury Auction system. Looking at systems currently in use, many countries perform those auctions manually. Since all the bids are transferred to the system in clear f...
Efficient GeMSS Based Ring Signature Scheme Demircioğlu, Murat; Akleylek, Sedat; Cenk, Murat (2019-06-18) The ring signature scheme has an important usage area of public key crypto-system. It can be used for e-voting,as well as leaking information without revealing identity within a group. However, mostof these systems relies ontraditional crypto-systems which are not secure against quantum computing related attacks. Multivariate cryptography is one of themost popular researchareas on quantum resilient crypto-systems. In this work, we propose an efficient ring signature scheme based on GeM...
Implications of Blockchain Technology in the Health Domain Baysal, Merve Vildan; Özcan Top, Özden; Betin Can, Aysu (2021-09-09) Blockchains are tamper-evident and tamper-resistant digital ledgers. Due to their distributed and shared nature, and their cryptographic functions, blockchains are resilient to alterations. They provide a trustworthy environment for the data stored in the ledgers. However, each new technology brings its own challenges along with the opportunities. Our minds are still busy with the question of “how could blockchain technology potentially benefit us?” In this paper, we approach to this question from the healt...
Implications of Blockchain Technology in the Health Domain Baysal, Merve; Özcan Top, Özden; Betin Can, Aysu (Springer-Verlag, 2021-09-01) Blockchains are tamper-evident and tamper-resistant digital ledgers. Due to their distributed and shared nature, and their cryptographic functions, blockchains are resilient to alterations. They provide a trustworthy environment for the data stored in the ledgers. However, each new technology brings its own challenges along with the opportunities. Our minds are still busy with the question of “how could blockchain technology potentially benefit us?” In this paper, we approach to this question from the healt...
Efficient simulation and modelling of counterparty credit risk Hekimoğlu, Alper Ali; Uğur, Ömür; Kestel, Sevtap Ayşe; Department of Financial Mathematics (2018) After 2008-2009 crisis, measurement of Counterparty Credit risk has become an essential part of Basel-III regulations. The measurement involves a complex calculation, simulation and scenario generation process which involve a heavy computational cost. Moreover, the counterparty default calculation is an important part depending on scenario generation and state of the economy, state of the counterparty, liquidity as well as the bank itself. In this thesis we develop flexible structural credit risk models and...

Citation Formats

S. AKLEYLEK and Z. Y. Tok, “EFFICIENT ARITHMETIC FOR LATTICE-BASED CRYPTOGRAPHY ON GPU USING THE CUDA PLATFORM,” Karadeniz Teknik Univ, Trabzon, Turkey, 2014, p. 854, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/65236.