Quantum safe digital signatures from symmetric key primitives

Download

index.pdf

Date

2019

Author

Erbaş, Şeyma

Metadata

Show full item record

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

Item Usage Stats

259
views

110
downloads

When powerful quantum computers are built, they will break most of the public key cryptography schemes due to Shor’s quantum algorithm. Therefore, public key cryptography algorithm schemes that is secure against classical and quantum computers are needed. In this thesis, we study Picnic algorithm, a post-quantum digital signature scheme. Picnic digital signature algorithm has the security of symmetric-key primitives that is considered to be secure against quantum attacks. In Picnic algorithm, zero knowledge proof systems and circuits to compute their protocol are used.

Subject Keywords

Data encryption (Computer science)., Post quantum cryptography, multiparty computation, zero-knowledge proof, LowMC, Picnic.

URI

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

Collections

Graduate School of Applied Mathematics, Thesis

Suggestions

OpenMETU
Core

Quantum-resistant multivariate quadratic systems and digital signatures Altundağ, Esen; Cenk, Murat; Department of Cryptography (2019) In the light of technological advances, scientists expect that quantum computers will be generated and substitute with classical ones, then all symmetric and asymmetric (public-key) cryptosystems will be invalid in the near future. This causes the need for quantum-resistant algorithms all araund the world. That’s why, we have focused on multivariate public-key cryptosystems as a kind of post-quantum cryptography. In order to explain the root idea behind this kind of cryptosystems, as a starting point, the M...
Modular exponentiation methods in cryptography Yünüak, Hasan Bartu; Cenk, Murat; Department of Cryptography (2017) Modular exponentiation has an important role in many cryptographic algorithms. These exponentiation methods differ in the bases used and their representations, the repeating aspect, and for which algorithms they are used for: fixed or variable base. Our research aims to compare the efficiencies and implementation timings for some selected algorithms. Also, we look at the options for using a dedicated cubing algorithm, and compare them with the current algorithms.
Quantum systems and representation theorem Dosi, Anar (2013-09-01) In this paper we investigate quantum systems which are locally convex versions of abstract operator systems. Our approach is based on the duality theory for unital quantum cones. We prove the unital bipolar theorem and provide a representation theorem for a quantum system being represented as a quantum -system.
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...
Gröbner Basis Attack on STARK-Friendly Symmetric-Key Primitives: JARVIS, MiMC and GMiMCerf Kara, Gizem; Yayla, Oğuz (2022-01-01) A number of arithmetization-oriented ciphers emerge for use in advanced cryptographic protocols such as secure multi-party computation (MPC), fully homomorphic en-cryption (FHE) and zero-knowledge proofs (ZK) in recent years. The standard block ciphers like AES and the hash functions SHA2/SHA3 are proved to be efficient in software and hardware but not optimal to use in this field, for this reason, new kind of cryptographic primitives were proposed recently. However, unlike traditional ones, there is no sta...

Citation Formats

Ş. Erbaş, “Quantum safe digital signatures from symmetric key primitives,” Thesis (M.S.) -- Graduate School of Applied Mathematics. Cryptography., Middle East Technical University, 2019.