Results 21 to 30 of about 785 (182)
A Cipher Based on Prefix Codes
A prefix code, a P-code, is a code where no codeword is a prefix of another codeword. In this paper, a symmetric cipher based on prefix codes is proposed. The simplicity of the design makes this cipher usable for Internet of Things applications. Our goal
Otokar Grošek +2 more
doaj +1 more source
An Efficient Public Key Encryption Scheme Based on QC-MDPC Lattices
In this paper, we introduce a new family of lattices, namely QC-MDPC lattices, which are a special case of LDPC lattices, and an improved bit flipping algorithm for decoding of these lattices. Encoding and decoding implementations of QC-MDPC lattices are
Khadijeh Bagheri +2 more
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
A Solidity implementation of TAVS
We present a Solidity smart contract implementation of the TAVS e-voting protocol. The Two Authorities Electronic Voting Scheme (TAVS) is a voting scheme that achieves universal verifiability with a reduced time-complexity both for the elector and the ...
Antonio M. Larriba, Damián López
doaj +1 more source
McNie: A code-based public-key cryptosystem
In this paper, we suggest a code-based public key encryption scheme, called McNie. McNie is a hybrid version of the McEliece and Niederreiter cryptosystems and its security is reduced to the hard problem of syndrome decoding. The public key involves a random generator matrix which is also used to mask the code used in the secret key.
Jon-Lark Kim +4 more
openaire +2 more sources
A Quantum Circuit to Speed-Up the Cryptanalysis of Code-Based Cryptosystems [PDF]
The significant interest in cryptographic primitives providing sound security margins when facing attacks with quantum computers is witnessed by the ongoing USA National Institute of Standards and Technology Post-quantum Cryptography Standardization process.
S. Perriello, A. Barenghi, G. Pelosi
openaire +2 more sources
A Flexible NTT-Based Multiplier for Post-Quantum Cryptography
In this work an NTT-based (Number Theoretic Transform) multiplier for code-based Post-Quantum Cryptography (PQC) is presented, supporting Quasi Cyclic Low/Moderate-Density Parity-Check (QC LDPC/MDPC) codes.
Kristjane Koleci +3 more
doaj +1 more source
An Algebraic Attack on Rank Metric Code-Based Cryptosystems [PDF]
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic versions of it have been proposed recently, such as those in the submissions ROLLO and RQC currently at the second round of the NIST Post-Quantum Cryptography Standardization ...
Bardet, Magali +6 more
openaire +3 more sources
Single Trace Analysis against HyMES by Exploitation of Joint Distributions of Leakages
Beginning with the proposal of the McEliece cryptosystem in 1978, code-based cryptography has positioned itself as one of main categories in post-quantum cryptography (PQC).
ByeongGyu Park +4 more
doaj +1 more source
Scaling efficient code-based cryptosystems for embedded platforms [PDF]
We describe a family of highly efficient codes for cryptographic purposes and dedicated algorithms for their manipulation. Our proposal is especially tailored for highly constrained platforms, and surpasses certain conventional and post-quantum proposals (like RSA and NTRU, respectively) according to most if not all efficiency metrics.
Felipe P. Biasi +3 more
openaire +3 more sources

