Filters








5,340 Hits in 6.0 sec

A New Rank Metric Codes Based Encryption Scheme [chapter]

Pierre Loidreau
2017 Lecture Notes in Computer Science  
We design a new McEliece-like rank metric based encryption scheme from Gabidulin codes. We explain why it is not affected by the invariant subspace attacks also known as Overbeck's attacks.  ...  The idea of the design mixes two existing approaches designing rank metric based encryption schemes.  ...  We propose a new approach mixing original ideas such as the structure of the encryption scheme and more recent ideas who led to the design of Low Rank Parity-check Codes (LRPC) based encryption schemes  ... 
doi:10.1007/978-3-319-59879-6_1 fatcat:kqdhhgfszbfinpdfbdu24af6wy

An IND-CCA-Secure Code-Based EncryptionScheme Using Rank Metric [article]

Hamad Al Shehhi, Emanuele Bellini, Filipe Borba, Florian Caullery, Marc Manzano, Víctor Mateu
2019 IACR Cryptology ePrint Archive  
This IND-CCA PKE scheme based on rank metric does not use a hybrid construction KEM + symmetric encryption.  ...  The use of rank instead of Hamming metric has been proposed to address the main drawback of code-based cryptography: large key sizes.  ...  Therefore, code-based cryptosystems using rank metric require smaller key sizes.  ... 
dblp:journals/iacr/ShehhiBBCMM19 fatcat:yzbmabllezb4fk5q3ymkkolv3e

Two attacks on rank metric code-based schemes: RankSign and an Identity-Based-Encryption scheme [article]

Thomas Debris-Alazard, Jean-Pierre Tillich
2018 arXiv   pre-print
RankSign [GRSZ14a] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [AGHRZ17] and, moreover, is a fundamental building block of a new Identity-Based-Encryption  ...  Finally, we have also shown that if one replaces the rank metric in the [GHPT17a] IBE scheme by the Hamming metric, then a devastating attack can be found.  ...  It also proved to be a fundamental building block in the Identity-Based-Encryption (IBE) scheme based on the rank metric suggested in [GHPT17] . A new IBE scheme based on codes.  ... 
arXiv:1804.02556v2 fatcat:bypwdkfv5zhizgigg7lir574fq

Efficient Encryption from Random Quasi-Cyclic Codes [article]

Carlos Aguilar, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor
2016 arXiv   pre-print
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix.  ...  We propose two new cryptosystems instantiated within our framework: the Hamming Quasi-Cyclic cryptosystem (HQC), based on the Hamming metric, and the Rank Quasi-Cyclic cryptosystem (RQC), based on the  ...  A NEW ENCRYPTION SCHEME A. Encryption and Security Encryption Scheme.  ... 
arXiv:1612.05572v1 fatcat:up7iubangna3db2gd77tfi3ywe

A polynomial attack on a NIST proposal: RankSign, a code-based signature in rank metric [article]

Thomas Debris-Alazard, Jean-Pierre Tillich
2018 IACR Cryptology ePrint Archive  
RankSign [GRSZ14] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [AGH + 17] and, moreover, is a fundamental building block of a new Identity-Based-Encryption  ...  Finally, we have also shown that if one replaces the rank metric in the [GHPT17] IBE scheme by the Hamming metric, then a devastating attack can be found.  ...  It also proved to be a fundamental building block in the Identity-Based-Encryption (IBE) scheme based on the rank metric suggested in [GHPT17] . A new IBE scheme based on codes.  ... 
dblp:journals/iacr/Debris-AlazardT18 fatcat:k7hiki5i5ra4ramacbwirxxvvm

Two Attacks on Rank Metric Code-Based Schemes: RankSign and an IBE Scheme [chapter]

Thomas Debris-Alazard, Jean-Pierre Tillich
2018 Lecture Notes in Computer Science  
RankSign [29] is a code-based signature scheme proposed to the NIST competition for quantum-safe cryptography [5] and, moreover, is a fundamental building block of a new Identity-Based-Encryption (IBE)  ...  Finally, we have also shown that if one replaces the rank metric in the [25] IBE scheme by the Hamming metric, then a devastating attack can be found.  ...  It also proved to be a fundamental building block in the Identity-Based-Encryption (IBE) scheme based on the rank metric suggested in [25] . A new IBE scheme based on codes.  ... 
doi:10.1007/978-3-030-03326-2_3 fatcat:zh2tgmo7ivhkto3omjcmkulfke

McNie2-Gabidulin: An improvement of McNie public key encryption using Gabidulin code [article]

Jon-Lark Kim, Young-Sik Kim, Lucky Galvez, Myeong Jae Kim
2018 arXiv   pre-print
McNie is a code-based public key encryption scheme submitted as a candidate to the NIST Post-Quantum Cryptography standardization. In this paper, we present McNie2-Gabidulin, an improvement of McNie.  ...  We prove that this new cryptosystem is IND-CPA secure.  ...  Introduction McNie [8] is a code-based public key encryption (PKE) scheme based on the McEliece and Niederreiter cryptosystems.  ... 
arXiv:1812.05015v1 fatcat:cjuskymcj5e3nnnrjz6jmxva5y

An IND-CCA2 secure post-quantum encryption scheme and a secure cloud storage use case

Peng Zeng, Siyuan Chen, Kim-Kwang Raymond Choo
2019 Human-Centric Computing and Information Sciences  
For a fair comparison between our rank metric codes-based PKE scheme and Wang's scheme from Hamming metric codes [22] , we choose two new sets of parameters params 3 = (q = 2, m = 71, n = 69, k = 19,  ...  In this paper, we presented a new rank metric codes-based public key encryption scheme from Lau and Tan's scheme [18] , and hence inherits the latter's small public key and ciphertext size properties.  ... 
doi:10.1186/s13673-019-0193-6 fatcat:rag5kzgjs5euvn2een7m4bbdv4

Identity-Based Encryption from Codes with Rank Metric [chapter]

Philippe Gaborit, Adrien Hauteville, Duong Hieu Phan, Jean-Pierre Tillich
2017 Lecture Notes in Computer Science  
In this paper, we propose a new method, based on the hardness of learning problems with rank metric, to design the first code-based IBE scheme.  ...  In order to prove the security of our schemes, we introduced a new problem for rank metric: the Rank Support Learning problem (RSL).  ...  In 2014, a new signature scheme, the RankSign scheme, based on LRPC codes was introduced by Gaborit et al. at PQCrypto 2014, [26] .  ... 
doi:10.1007/978-3-319-63697-9_7 fatcat:wscwpb53mnbq3gvupqhivibf6e

Post-Quantum and Code-Based Cryptography—Some Prospective Research Directions

Chithralekha Balamurugan, Kalpana Singh, Ganeshvani Ganesan, Muttukrishnan Rajarajan
2021 Cryptography  
Some potential research directions that are yet to be explored in code-based cryptography research from the perspective of codes is a key contribution of this paper.  ...  The emergence of quantum computing poses a major threat to the modern cryptosystems based on modular arithmetic, whereby even the computationally hard problems which constitute the strength of the modular  ...  Such codes are called maximum rank distance (MRD) codes. − → x = a 1,1 a 1,2 a 1,n a 2,1 a 2,1 a 2,n a N,1 a N,1 a N,n Non-binary linear codes have been defined using rank-metric.  ... 
doi:10.3390/cryptography5040038 fatcat:wkb43zunwjagbnljc6brfou4ty

Rank-Metric Codes and Their Applications

Hannes Bartz, Lukas Holzbaur, Hedongliang Liu, Sven Puchinger, Julian Renner, Antonia Wachter-Zeh
2022 Foundations and Trends in Communications and Information Theory  
Codes designed for the rank metric have attracted considerable attention in recent years, reinforced by network coding and further motivated by a variety of applications.  ...  This survey gives a general introduction to rank-metric codes, explains their most important applications, and highlights their relevance to these areas of research.  ...  Section 3 gives an overview of rank-metric code-based quantumresistant encryption and authentication schemes.  ... 
doi:10.1561/0100000119 fatcat:4wh62agk5rczpjlfr5bp3km67u

Dual-Ouroboros: An improvement of the McNie scheme

Philippe Gaborit, ,University of Limoges, Limoges, France, Lucky Galvez, Adrien Hauteville, Jon-Lark Kim, Myeong Jae Kim, Young-Sik Kim, ,Sogang University, Seoul, South Korea, ,Chosun University, Gwangju, South Korea
2019 Advances in Mathematics of Communications  
McNie [8] is a code-based public key encryption scheme submitted to the NIST Post-Quantum Cryptography standardization [10] as a candidate.  ...  This new improved protocol permits, first, to avoid an attack proposed by Gaborit [7] and second permits to benefit from a reduction security to a standard problem (as the original Ouroboros protocol).  ...  Introduction McNie [8] is a code-based public key encryption scheme based on the McEliece and Niederreiter cryptosystems.  ... 
doi:10.3934/amc.2020021 fatcat:vnpz5ucgunaqbeawo4ngjdo77a

DRANKULA: A McEliece-like Rank Metric based Cryptosystem Implementation

Ameera Salem Al Abdouli, Mohamed Al Ali, Emanuele Bellini, Florian Caullery, Alexandros Hasikos, Marc Manzano, Victor Mateu
2018 Proceedings of the 15th International Joint Conference on e-Business and Telecommunications  
We present and analyze the performance of DRANKULA, a McEliece-like cryptosystem implementation using rank metric instead of Hamming distance.  ...  We propose a set of carefully selected parameters and we address several nontrivial issues when porting this scheme into real-world systems as, for example, the generation of errors of a given rank.  ...  Nevertheless, Loidreau has proposed a new McEliece-like rank metric based encryption scheme from Gabidulin codes that is not affected by the so-called Overbeck's attacks (Loidreau, 2017) .  ... 
doi:10.5220/0006838102300241 dblp:conf/icete/AbdouliABCHMM18 fatcat:kvohfmb4drfljkh6t3o7y47phq

A Novel Niederreiter-like cryptosystem based on the (u|u + υ)-construction codes

Roumaissa Mahdjoubi, Pierre Louis Cayrel, Sedat Akleylek, Guenda Kenza
2021 RAIRO - Theoretical Informatics and Applications  
The security is based on the hardness of the Rank Syndrome Decoding (RSD) problem and it presents a (u|u + υ)-construction code using two different types of codes: Ideal Low Rank Parity Check (ILRPC) codes  ...  In this paper, we present a new variant of the Niederreiter Public Key Encryption (PKE) scheme which is resistant against recent attacks.  ...  Motivation and contribution In this paper, we propose a new variant of the Niederreiter-PKE scheme based on the RSD problem.  ... 
doi:10.1051/ita/2021010 fatcat:b7z4ngmt4nhvrcbmlie7xdiz2m

McNie: A code-based public-key cryptosystem [article]

Jon-Lark Kim, Young-Sik Kim, Lucky Galvez, Myeong Jae Kim, Nari Lee
2019 arXiv   pre-print
In this paper, we suggest a code-based public key encryption scheme, called McNie.  ...  In particular, we apply rank-metric codes to McNie.  ...  new code-based public key encryption scheme, called McNie.  ... 
arXiv:1812.05008v2 fatcat:wsagwr4tofd3fdn2cxpp3vogte
« Previous Showing results 1 — 15 out of 5,340 results