[ Pobierz całość w formacie PDF ]

tions, Communications in Algebra, 27(5), pp. 2207-2222, 1999. Available at
http://www.usdsi.com/public.ps
[46] T.T. Moh, A fast public key system with signature and master key functions, in
Proceedings of CrypTEC 99, International Workshop on Cryptographic Tech-
niques and E-commerce, Hong-Kong City University Press, pages 63-69, July
1999. Available at http://www.usdsi.com/cryptec.ps
[47] The US Data Security Public-Key Contest, available at
http://www.usdsi.com/contests.html
Liniowe kryptosystemy wielu zmiennych
[48] Nicolas Courtois, Matthieu Finiasz and Nicolas Sendrier: How to
achieve a McEliece-based Digital Signature Scheme; Preprint available at
http://www.minrank.org/mceliece/
[49] R.J. McEliece: A public key cryptosystem based on algebraic coding theory;
DSN Progress Report42-44, Jet Propulsion Laboratory, 1978, pp. 114-116.
[50] Hans Niederreiter: Knapsack-type cryptosystems and algebraic coding theory;
In Probl. Contr. and Information Theory, 1986.
Problem MinRank i trudne problemy teorii kodów
[51] E.R. Berlekamp, R.J. McEliece, H.C.A. van Tilborg: On the inherent in-
tractability of certain coding problems; IEE Trans. Inf. Th., It-24(3), pp. 384-
386, May 1978.
31
[52] Anne Canteaut, Florent Chabaud: A new algorithm for finding minimum-
weight words in a linear code: application to McEliece s cryptosystem and to
BCH Codes of length 511;
[53] http://www.minrank.org, a non-profit web site dedicated to MinRank and Mul-
tivariate Cryptography in general.
[54] Jeffrey O. Shallit, Gudmund S. Frandsen, Jonathan F. Buss: The Com-
putational Complexity of Some Problems of Linear Algebra problems,
BRICS series report, Aaarhus, Denmark, RS-96-33, available on the net
http://www.brics.dk/RS/96/33/.
[55] Jacques Stern, Florent Chabaud: The cryptographic security of the syndrome
decoding problem for rank distance codes. In Advances in Cryptology, Asi-
acrypt 96, LNCS 1163, pp. 368-381, Springer-Verlag.
Problemy IP, MP i Tensor Rank
[56] Don Coppersmith, Shmuel Winograd, Matrix multiplication via arithmetic pro-
gressions, J. Symbolic Computation (1990), 9, pp. 251-280.
[57] Nicolas Courtois, Louis Goubin, Jacques Patarin: Improved Algorithms for
Isomorphism of Polynomials; Eurocrypt 1998, Springer-Verlag.
[58] patrz [33].
[59] Volker Strassen: Gaussian elimination is not optimal; Numerishe Mathematik
13, 1969, pp. 354-356.
Schematy wiedzy zerowej
[60] Kefei Chen: A new identification algorithm. Cryptography Policy and algo-
rithms conference, vol. 1029, LNCS, Springer-Verlag, 1996.
[61] Nicolas Courtois: The power of MinRank and practical Zero-knowledge. Paper
in preparation.
[62] N. Courtois: The Minrank problem. MinRank, a new Zero-knowledge scheme
based on the NP-complete problem. Presented at the rump session of Crypto
2000, available at http://www.minrank.org/minrank/.
[63] Amos Fiat, Adi. Shamir: How to prove yourself: Practical solutions to iden-
tification and signature problems. In Advances in Cryptology, Crypto  86, pp.
186-194, Springer-Verlag, 1987.
[64] Adi Shamir: An efficient Identification Scheme Based on Permuted Kernels,
In Advances in Cryptology, Proceedings of Crypto 89, LNCS 435, pp.606-609,
Springer-Verlag.
[65] Jacques Stern: A new identification scheme based on syndrome decoding;
In Advances in Cryptology, Proceedings of Crypto 93, LNCS 773, pp.13-21,
Springer-Verlag.
32 [ Pobierz całość w formacie PDF ]