Results 41 to 50 of about 963,035 (329)
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
Cryptography, 2018 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 ...
Edoardo Persichetti
doaj +1 more source
DAGS: Key encapsulation using dyadic GS codes
Journal of Mathematical Cryptology, 2018 Code-based cryptography is one of the main areas of interest for NIST’s Post-Quantum Cryptography Standardization call. In this paper, we introduce DAGS, a Key Encapsulation Mechanism (KEM) based on quasi-dyadic generalized Srivastava codes.
Banegas Gustavo +12 more
doaj +1 more source
Development of digital signature algorithm based on the Niederriter crypto-code system
Системи обробки інформації, 2020 The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and
О.С. Циганенко
doaj +1 more source
Anti-Quantum Signcryption Scheme Based on Niederreiter Cryptosystem [PDF]
Jisuanji gongcheng, 2020 To address security issues of network communication in the post-quantum era,this paper studies the Niederreiter cryptosystem in code-based cryptography,and combines the double public key cryptographic scheme based on the improved Niederreiter scheme with
WANG Zhong, HAN Yiliang
doaj +1 more source
Code-based Post-Quantum Cryptography
, 2021 Cryptography has been used from time immemorial for preserving the confidentiality of data/information in storage or in transit. Thus, cryptography research has also been evolving from the classical Caesar cipher to the modern cryptosystems based on modular arithmetic to the contemporary cryptosystems based on quantum computing.
Balamurugan, Chithralekha +3 more
openaire +2 more sources
Designing Efficient Dyadic Operations for Cryptographic Applications
Journal of Mathematical Cryptology, 2020 Cryptographic primitives from coding theory are some of the most promising candidates for NIST’s Post-Quantum Cryptography Standardization process. In this paper, we introduce a variety of techniques to improve operations on dyadic matrices, a particular
Banegas Gustavo +3 more
doaj +1 more source
Mathematics, 2020 We define a family of codes called twisted Hermitian codes, which are based on Hermitian codes and inspired by the twisted Reed–Solomon codes described by Beelen, Puchinger, and Nielsen. We demonstrate that these new codes can have high-dimensional Schur
Austin Allen +6 more
doaj +1 more source
Structural Properties of Twisted Reed-Solomon Codes with Applications to Cryptography
, 2018 We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality.
Beelen, Peter +3 more
core +1 more source
Provably secure identity-based identification and signature schemes from code assumptions. [PDF]
PLoS ONE, 2017 Code-based cryptography is one of few alternatives supposed to be secure in a post-quantum world. Meanwhile, identity-based identification and signature (IBI/IBS) schemes are two of the most fundamental cryptographic primitives, so several code-based IBI/
Bo Song, Yiming Zhao
doaj +1 more source
A Comparison of Cryptography Courses
, 2004 The author taught two courses on cryptography, one at Duke University aimed at non-mathematics majors and one at Rose-Hulman Institute of Technology aimed at mathematics and computer science majors.
Holden, Joshua
core +1 more source