Results 21 to 30 of about 3,550 (163)
McBits: Fast Constant-Time Code-Based Cryptography [PDF]
This paper presents extremely fast algorithms for code-based public-key cryptography, including full protection against timing attacks. For example, at a 2^128 security level, this paper achieves a reciprocal decryption throughput of just 60493 cycles (plus cipher cost etc.) on a single Ivy Bridge core. These algorithms rely on an additive FFT for fast
Bernstein, D. J., Chou, T., Schwabe, P.
openaire +3 more sources
A Summary of McEliece-Type Cryptosystems and their Security
In this paper we give an overview of some of the cryptographic applications which were derived from the proposal of R. J. McEliece to use error correcting codes for cryptographic purposes.
Engelbert D., Overbeck R., Schmidt A.
doaj +1 more source
Efficient One-Time Signatures from Quasi-Cyclic Codes: A Full Treatment
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
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
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]
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
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
The code-based McEliece and Niederreiter cryptosystems are promising candidates for post-quantum public-key encryption. Recently, q-ary concatenated codes over Gaussian integers were proposed for the McEliece cryptosystem, together with the one-Mannheim ...
Johann-Philipp Thiers +1 more
doaj +1 more source
Code-based Post-Quantum Cryptography
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
A Biological-Inspired Cryptosystem based on DNA Cryptography and Morse Code Ciphering Technique
Due to its prominent facility to hide colossal datasets with a high calibre of randomness and subsequent protection, the famous genomic Deoxyribonucleic Acid (DNA) has been presented as a hiding medium, known as DNA steganography.
Adithya B +1 more
doaj +1 more source
Designing Efficient Dyadic Operations for Cryptographic Applications
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

