In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence is absent are considered. It is shown ...
Code-based cryptography includes all cryptosystems, symmetric or asymmetric, whose security relies, partially or totally, on the hardness of decoding in a linear error correcting code, possibly chosen with some particular structure or in a specific family (for instance, quasi-cyclic codes or Goppa c...
QC-LDPC Code-Based Cryptosystems Abstract In this chapter, the use of QC-LDPC codes in public key cryptosystems inspired to the McEliece and Niederreiter systems is studied. Both the case in which the private and the public code are permutation equivalent and that in which such an equivalence...
One main construct for code-based public key cryptosystems is the McEliece framework that hedges upon the hardness of decoding arbitrary linear codes. Based on Goppa codes, the original McEliece cryptosystem however, suffers from having very large public keys. To alleviate this problem, we define...
One main reason is that it is widely believed that code-based cryptosystems like McEliece do not allow practical digital signatures. Although X.M. Wang presented a code-based signature scheme in 1990, some authors find that it is not secure. Recently, T.Courtois et al}. show a new way ...
Thus, huge transmission or storage space is occupied by encoding one input image in GI-based systems compared with other types of cryptosystems, such as DRPE-based systems [8], PTFT-based systems [9] and interference-based systems [10,11]. To address this issue, some algorithms such as ...
Shor's quantum algorithm and its variants can be used for breaking most of the curre√ntly used public-key cryptosystems. In 1996, Grover proposed an O( N)-query complexity of quantum algorithm for functions with N-bit domains [17]. This quantum algorithm once realized on quantum ...
In this section, we recall the definition of rank metric, which is the core of rank metric code based cryptosystems. We also introduce the Decisional Rank Syndrome Decoding problem, a hard problem in coding theory for our encryption scheme. We name the known best generic attacks on the Rank ...
Our results demonstrate that some of today's Lattice-based cryptosystems can already have efficient JavaScript implementations and hence are ready for use on... Y Yuan,CM Cheng,S Kiyomoto,... - Third International Symposium on Computing & Networking 被引量: 6发表: 2015年 Portable Implementation ...
Biometric cryptosystems is a group of emerging technologies that securely bind a digital key to a biometric so that no biometric image or template is stored. Focusing on iris biometrics several approaches have been proposed to bind keys to binary iris-codes where the majority of these approaches ...