Abstract
In this paper we modify the cryptosystem presented in [16] based on the problem of decoding in rank metric. We design a cryptosystem more secure than the original one with a better transmission rate. We show that this system resists to the message resend and reaction attacks, and can be used with a small public-key (around 10kbits). © Springer-Verlag 2004.
Cite
CITATION STYLE
Berger, T., & Loidreau, P. (2004). Designing an efficient and secure public-key cryptosystem based on reducible rank codes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3348, 218–229. https://doi.org/10.1007/978-3-540-30556-9_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
