Results 71 to 80 of about 2,437 (198)
Permutations preserving divisibility [PDF]
, 2001 We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x)
Le Dantec, Claude +2 more
core +1 more source
A survey on post‐quantum based approaches for edge computing security
WIREs Computational Statistics, Volume 16, Issue 1, January/February 2024.The distribution of reviewed papers by focused area. Abstract With the development of technology and its integration with scientific realities, computer systems continue to evolve as infrastructure. One of the most important obstacles in front of quantum computers with high‐speed processing is that its existing systems cause security vulnerabilities ...
Aykut Karakaya, Ahmet Ulu
wiley +1 more source
Secure DNA data compression using algebraic curves
Electronics Letters, Volume 51, Issue 18, Page 1466-1468, September 2015., 2015 A system that achieves compression using artificial DNA packaging with the support of two algebraic curves is presented, whereby the Hermitian channel code algorithm introduces gain and safety. Additionally, performance results are presented with a gain of 7 dB against uncoded quadrature phase shift keying and 1 dB against McEliece, for a bit error ...
I. Soto +3 more
wiley +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
Polynomial-Time Key Recovery Attack on the Faure-Loidreau Scheme based on Gabidulin Codes
, 2017 Encryption schemes based on the rank metric lead to small public key sizes of order of few thousands bytes which represents a very attractive feature compared to Hamming metric-based encryption schemes where public key sizes are of order of hundreds of ...
Gaborit, Philippe +2 more
core +3 more sources
Counting Extended Irreducible Goppa Codes
Journal of Discrete Mathematics, Volume 2014, Issue 1, 2014., 2014 We produce an upper bound on the number of extended irreducible Goppa codes over any finite field.
John A. Ryan, Stavros D. Nikolopoulos
wiley +1 more source
A Framework for Efficient Adaptively Secure Composable Oblivious Transfer in the ROM [PDF]
, 2017 Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of applications, in particular, as an essential building block for two-party and multi-party computation.
Barreto, Paulo S. L. M. +4 more
core +1 more source
Leaky McEliece: Secret Key Recovery From Highly Erroneous Side-Channel Information
Transactions on Cryptographic Hardware and Embedded SystemsThe McEliece cryptosystem is a strong contender for post-quantum schemes, including key encapsulation for confidentiality of key exchanges in network protocols.
Marcus Brinkmann +4 more
doaj +1 more source
Quantum Resistant Random Linear Code Based Public Key Encryption Scheme RLCE [PDF]
, 2015 Lattice based encryption schemes and linear code based encryption schemes have received extensive attention in recent years since they have been considered as post-quantum candidate encryption schemes.
Wang, Yongge
core +2 more sources
On Decoding Schemes for the MDPC-McEliece Cryptosystem [PDF]
, 2018 Recently, it has been shown how McEliece public-key cryptosystems based on moderate-density parity-check (MDPC) codes allow for very compact keys compared to variants based on other code families. In this paper, classical (iterative) decoding schemes for
Bartz, Hannes, Liva, Gianluigi
core +1 more source