High performance number theoretic transforms in cryptography

Download

index.pdf

Date

2020

Author

Ulu, Metin Evrim

Metadata

Show full item record

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

Item Usage Stats

298
views

227
downloads

Theoretical advances in physics opened up a new window into quantum computation. This window rendered a number of mathematically hard problems unusable for cryptographic applications. For instance, Shor showed that it is possible factor integers by a quantum algorithm efficiently thus rendering the standard public-key encryption scheme RSA insecure. In February 2016, NIST launched a standardization process for post-quantum cryptography algorithms to study the effect of quantum computing on the current generation of cryptographic algorithms and to build the next generation cryptosystems that are resistant to quantum attacks. One type of quantum safe cryptographic systems is based on lattices. In order to improve the performance in lattice based systems, Number Theoretic Transforms (NTT) are used. In this thesis, the performance of NTT in cryptography is studied. First, Peikert’s Scheme and its realization BCNS Algorithm and NewHope key encapsulation method is discussed. Next, SWIFFTX hash function that uses NTT as a building block is presented. Finally, an efficient GPU implementation of SWIFFTX hash function is provided. Experimental results indicate almost 10x improvement in speed and 5 Watts decrease in power consumption per 2^16 hashes.

Subject Keywords

Cryptography., NTT, PQC, NewHope, SWIFFT, SWIFFTX

URI

http://etd.lib.metu.edu.tr/upload/12625145/index.pdf
https://hdl.handle.net/11511/45230

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Efficient implementation of lattice-based schemes Bilgin, Yusuf Alper; Cenk, Murat; Department of Cryptography (2020-10-14) Quantum computing and quantum computers have been discussed for almost three decades. However, they remain mainly in theory. Almost all big companies like Google, IBM, and Microsoft have put their effort to build the most scalable quantum computers in recent years. These computers can change the game in cryptography since the known hard problems such as integer factorization and discrete logarithms can be broken with a large-scale quantum computer. These computers would seriously jeopardize the confide...
Supporting Simulation Experiments with Megamodeling Cam, Sema; Dayibas, Orcun; Gorur, Bilge K.; Oğuztüzün, Mehmet Halit S.; Yilmaz, Levent; Chakladar, Sritika; Doud, Kyle; Smith, Alice E.; Teran-Somohano, Alejandro (SCITEPRESS, AV D MANUELL, 27A 2 ESQ, SETUBAL, 2910-595, PORTUGAL; 2018-01-01) Recent developments in computational science and engineering allow a great deal of experimental work to be conducted through computer simulation. In a simulation experiment, a model of the phenomena to be studied is run in a computing environment under varying model and environment settings. As models are adjusted to experimental procedures and execution environments, variations arise. Models also evolve in time. Thus, models must be managed. We propose to bring Global Model Management (GMM) to bear on simu...
Measurement of the azimuthal ordering of charged hadrons with the ATLAS detector Aad, G.; et. al. (2012-09-14) This paper presents a study of the possible ordering of charged hadrons in the azimuthal angle relative to the beam axis in high-energy proton-proton collisions at the Large Hadron Collider (LHC). A spectral analysis of correlations between longitudinal and transverse components of the momentum of the charged hadrons, driven by the search for phenomena related to the structure of the QCD field, is performed. Data were recorded with the ATLAS detector at center-of-mass energies of root s = 900 GeV and root s...
Fast and accurate analysis of optical metamaterials using surface integral equations and the parallel multilevel fast multipole algorithm Ergül, Özgür Salih (2013-09-13) We present fast and accurate simulations of optical metamaterials using surface integral equations and the multilevel fast multipole algorithm (MLFMA). Problems are formulated with the electric and magnetic current combined-field integral equation and solved iteratively with MLFMA, which is parallelized using the hierarchical strategy on distributed-memory architectures. Realistic metamaterials involving dielectric, perfectly conducting, and plasmonic regions of finite extents are solved rigorously with the...
High Dimensional Channel Estimation Using Deep Generative Networks Balevi, Eren; Doshi, Akash; Jalal, Ajil; Dimakis, Alexandros; Andrews, Jeffrey G. (2021-01-01) This paper presents a novel compressed sensing (CS) approach to high dimensional wireless channel estimation by optimizing the input to a deep generative network. Channel estimation using generative networks relies on the assumption that the reconstructed channel lies in the range of a generative model. Channel reconstruction using generative priors outperforms conventional CS techniques and requires fewer pilots. It also eliminates the need of a priori knowledge of the sparsifying basis, instead using the ...

Citation Formats

M. E. Ulu, “High performance number theoretic transforms in cryptography,” Thesis (Ph.D.) -- Graduate School of Applied Mathematics. Cryptography., Middle East Technical University, 2020.