Nicolas Courtois  Home/Search
Context
Related
| iacr.org/2001/058.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Several zero-knowledge schemes have been proposed since 1984, and the most practical ones rely on factoring and discrete log. Still there are practical schemes based on NP-complete problems. Among them, the problem SD of decoding linear codes is in spite of more than 20 years of research effort, still exponential to solve. We study a more general problem called MinRank that contains, not only the SD problem but also some other well known hard problems. It is also used in cryptanalysis of such... (Update)
Similar documents (at the sentence level):
64.7%: Ecient Zero-knowledge Authentication Based - On Linear Algebra (2001) (Correct)
Active bibliography (related documents): More All
0.7: The security of Hidden Field Equations (HFE) - Courtois (Correct)
0.5: Syndrome Decoding Problem For Rank Distance Codes - Chabaud, Stern (Correct)
0.5: The Cryptographic Security of the Syndrome Decoding Problem.. - Chabaud, Stern (1996) (Correct)
Similar documents based on text: More All
0.8: Higher Order Correlation Attacks, XL algorithm and Cryptanalysis .. - Courtois (2002) (Correct)
0.8: On the Security of HFE, HFEv- and Quartz - Courtois, Daum, Felke (2002) (Correct)
0.7: On the Goubin-Courtois Attack on TTM - Moh, Chen (2001) (Correct)
BibTeX entry: (Update)
@article{ courtois01efficient,
author = "Nicolas T. Courtois",
title = "Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem {MinRank}",
journal = "Lecture Notes in Computer Science",
volume = "2248",
pages = "402+",
year = "2001",
url = "citeseer.ist.psu.edu/courtois01efficient.html" }
Citations (may not include all citations):531 The knowledge Complexity of interactive proof systems; SIAM .. (context) - Goldwasser, Micali et al. - 1997
67 Definitions and properties of Zero-knowledge proof systems - Goldreich, Oren - 1994
26 Shamir: How to prove yourself: Practical solutions to identi.. (context) - Fiat - 1987
21 cient Algorithms for solving Overdefined Systems of Multivar.. (context) - Courtois, Shamir et al. - 2000
17 Theory of codes with maximum rank distance (context) - Gabidulin - 1985
14 The Security of the Birational Permutation Signature Schemes - Coppersmith, Stern et al. - 1997
14 An observation on the security of McEliece's public-key cryp.. (context) - Lee, Brickell - 1988
10 cient Identification Scheme Based on Permuted Kernels (context) - Shamir
7 orange script (context) - Patarin, Goubin et al.
7 Jacques Patarin: Hidden Fields Equations (context) - Hidden, HFE et al.
6 Paris 6 University (context) - Courtois, of et al. - 2001
5 Aviad Kipnis: Cryptanalysis of the HFE Public Key Cryptosyst.. (context) - Shamir
4 three pass identification protocol using coding theory; Adva.. (context) - Girault, non-practical
4 A new authentication algorithm (context) - Harari - 1989
3 cient signature schemes based on birational permutations; Cr.. (context) - Shamir
3 Serge Vaudenay: Attacks on the birational permutation signat.. (context) - Coppersmith, Stern
2 Nicolas Courtois Cryptanalysis of the TTM Cryptosystem; Adva.. (context) - Goubin - 2000
2 Springer-Verlag (context) - Stern, for et al.
2 van Tilborg: On the inherent intractability of certain codin.. (context) - Berlekamp, McEliece - 1978
2 Shai Halevi: The Random Oracle Methodology (context) - Canetti, Goldreich - 1998
2 Cryptography Policy and algorithms conference (context) - Chen, identification - 1996
2 Tretjakov: Ideals over a NonCommutative Ring and their Appli.. (context) - Gabidulin, Paramonov - 1991
2 Security of cryptographic schemes based on rank problems; wo.. (context) - Courtois, Gabidulin
2 Florent Chabaud: The cryptographic security of the syndrome .. (context) - Stern
2 Caen University (context) - Pointcheval, de connaissance et al. - 1996
1 Buss: The Computational Complexity of Some Problems of Linea.. (context) - rey, Shallit et al.
1 Ivan Damgard: Zero-Knowledge Proofs for Finite Field Arithme.. (context) - Cramer
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC