scholarly journals Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 30 ◽  
Author(s):  
Edoardo Persichetti
Keyword(s):  
Quantum Cryptography ◽  
Open Problem ◽  
Cyclic Codes ◽  
Security Analysis ◽  
Short Paper ◽  
Signature Scheme ◽  
Full Version ◽  
And Performance ◽  
Post Quantum Cryptography ◽  
Quasi Cyclic Codes

The design of a practical code-based signature scheme is an open problem in post-quantum cryptography. This paper is the full version of a work appeared at SIN’18 as a short paper, which introduced a simple and efficient one-time secure signature scheme based on quasi-cyclic codes. As such, this paper features, in a fully self-contained way, an accurate description of the scheme setting and related previous work, a detailed security analysis, and an extensive comparison and performance discussion.

scholarly journals Key Substitution Attacks on Lattice Signature Schemes Based on SIS Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-13
Author(s):  
Youngjoo An ◽  
Hyang-Sook Lee ◽  
Juhee Lee ◽  
Seongan Lim
Keyword(s):  
Quantum Cryptography ◽  
Digital Signatures ◽  
Signature Scheme ◽  
Promising Candidate ◽  
Signature Schemes ◽  
Critical Requirement ◽  
Post Quantum Cryptography

The notion of key substitution security on digital signatures in the multiuser setting has been proposed by Menezes and Smart in 2004. Along with the unforgeability of signature, the key substitution security is very important since it is a critical requirement for the nonrepudiation and the authentication of the signature. Lattice-based signature is a promising candidate for post-quantum cryptography, and the unforgeability of each scheme has been relatively well studied. In this paper, we present key substitution attacks on BLISS, Lyubashevsky’s signature scheme, and GPV and thus show that these signature schemes do not provide nonrepudiation. We also suggest how to avoid key substitution attack on these schemes.

scholarly journals From Key Encapsulation to Authenticated Group Key Establishment—A Compiler for Post-Quantum Primitives †

Entropy ◽  
2019 ◽  
Vol 21 (12) ◽  
pp. 1183 ◽  
Author(s):  
Edoardo Persichetti ◽  
Rainer Steinwandt ◽  
Adriana Suárez Corona
Keyword(s):  
Quantum Cryptography ◽  
Signature Scheme ◽  
Key Establishment ◽  
Group Key ◽  
Generic Construction ◽  
Key Encapsulation Mechanism ◽  
Authenticated Group Key ◽  
Post Quantum Cryptography ◽  
Group Key Establishment

Assuming the availability of an existentially unforgeable signature scheme and an (IND- CCA secure) key encapsulation mechanism, we present a generic construction for group key establishment. The construction is designed with existing proposals for post-quantum cryptography in mind. Applied with such existing proposals and assuming their security, we obtain a quantum-safe three-round protocol for authenticated group key establishment that requires only one signature per protocol participant.

scholarly journals An Improved Identity-Based Multivariate Signature Scheme Based on Rainbow

Cryptography ◽  
2019 ◽  
Vol 3 (1) ◽  
pp. 8 ◽  
Author(s):  
Le Luyen
Keyword(s):  
Quantum Cryptography ◽  
Public Key Cryptography ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Identity Based ◽  
Post Quantum Cryptography ◽  
Multivariate Public Key

Multivariate Public Key Cryptography (MPKC) is one of the main candidates for post-quantum cryptography, especially in the area of signature schemes. In this paper, we instantiate a certificate Identity-Based Signature (IBS) scheme based on Rainbow, one of the most efficient and secure multivariate signature schemes. In addition, we revise the previous identity-based signature scheme IBUOV based on the Unbalanced Oil and Vinegar (UOV) scheme on the security and choice of parameters and obtain that our scheme is more efficient than IBUOV in terms of key sizes and signature sizes.

scholarly journals Structure and performance of generalized quasi-cyclic codes

2017 ◽  
Vol 47 ◽  
pp. 183-202 ◽  
Author(s):  
Cem Güneri ◽  
Ferruh Özbudak ◽  
Buket Özkaya ◽  
Elif Saçıkara ◽  
Zahra Sepasdar ◽  
...  
Keyword(s):  
Cyclic Codes ◽  
And Performance ◽  
Quasi Cyclic Codes

scholarly journals Compact Dilithium Implementations on Cortex-M3 and Cortex-M4

2020 ◽  
pp. 1-24
Author(s):  
Denisa O. C. Greconici ◽  
Matthias J. Kannwischer ◽  
Daan Sprenkels
Keyword(s):  
Quantum Cryptography ◽  
Digital Signature ◽  
Flash Memory ◽  
Constant Time ◽  
Key Generation ◽  
Signature Scheme ◽  
Memory Footprint ◽  
Speed Up ◽  
Post Quantum Cryptography ◽  
Digital Signature Scheme

We present implementations of the lattice-based digital signature scheme Dilithium for ARM Cortex-M3 and ARM Cortex-M4. Dilithium is one of the three signature finalists of the NIST post-quantum cryptography competition. As our Cortex-M4 target, we use the popular STM32F407-DISCOVERY development board. Compared to the previous speed records on the Cortex-M4 by Ravi, Gupta, Chattopadhyay, and Bhasin we speed up the key operations NTT and NTT−1 by 20% which together with other optimizations results in speedups of 7%, 15%, and 9% for Dilithium3 key generation, signing, and verification respectively. We also present the first constant-time Dilithium implementation on the Cortex-M3 and use the Arduino Due for benchmarks. For Dilithium3, we achieve on average 2 562 kilocycles for key generation, 10 667 kilocycles for signing, and 2 321 kilocycles for verification.Additionally, we present stack consumption optimizations applying to both our Cortex- M3 and Cortex-M4 implementation. Due to the iterative nature of the Dilithium signing algorithm, there is no optimal way to achieve the best speed and lowest stack consumption at the same time. We present three different strategies for the signing procedure which allow trading more stack and flash memory for faster speed or viceversa. Our implementation of Dilithium3 with the smallest memory footprint uses less than 12kB. As an additional output of this work, we present the first Cortex-M3 implementations of the key-encapsulation schemes NewHope and Kyber.

A class of constacyclic codes over the ring Z4[u,v]/ and their Gray images

Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash
Keyword(s):  
Cyclic Codes ◽  
Constacyclic Codes ◽  
Gray Maps ◽  
Permutation Equivalent ◽  
Quasi Cyclic Codes

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.

Sign in / Sign up

Export Citation Format

Share Document