Information Technology Reference
In-Depth Information
9. Stern, J.: A new identification scheme based on syndrome decoding. In Stinson,
D.R., ed.: Advances in Cryptology - Crypto '93, Berlin, Springer-Verlag (1993)
13-21 Lecture Notes in Computer Science Volume 773
10. Stern, J.: Designing identification schemes with keys of short size. In Desmedt, Y.,
ed.: Advances in Cryptology - Crypto '94, Berlin, Springer-Verlag (1994) 164-173
Lecture Notes in Computer Science Volume 839
11. Pointcheval, D.: A new identification scheme based on the perceptrons problem.
In Guillou, L.C., Quisquater, J.J., eds.: Advances in Cryptology - EuroCrypt '95,
Berlin, Springer-Verlag (1995) 319-328 Lecture Notes in Computer Science Volume
921
12. Caballero, P., Hernandez, C.: Strong Solutions to the Identification Problem. In
Wang, J., ed.: Computing and Combinatorics, Proceedings of the 7th Annual
International Computing and Combinatorics Conference COCOON'01, Berlin,
Springer-Verlag (2001) 257-261 Lecture Notes in Computer Science Volume 2108
13. Poupard, G.: A realistic security analysis of identification schemes based on combi-
natorial problems. European Transactions on Telecommunications
8, No. 5
(1997)
471-480
14. Karp, R.: The Probabilistic Analysis of Some Combinatorial Search Algorithms.
Academic Press, NY (1976) Referencia cruzada de art ıculo Levin Venkatesan
15. Wang, J.: Average-Case Intractable NP Problems. In Du, D., Ko, K., eds.: Ad-
vances in Languages, Algorithms and Complexity. Kluwer Academic Publishers
(1997) 313-378
16. Levin, L.: Average Case Complete Problems. SIAM Journal on Computing (1986)
285-286
17. Venkatesan, R., Levin, L.: Random Instances of a Graph Colouring Problem are
Hard. In: ACM Symposium on Theory of Computing. (1988) 217-222
18. Gurevich, Y.: Matrix decomposition problem is complete for the average case. In:
Proc. 31stAnnual Symposium on Foundations of Computer Science, IEEE Com-
puter Society Press (1990) 802-811
19. Venkatesan, R., Rajagopalan, S.: Average case intractability of diphantine and ma-
trix problem. In: Proc. Of the 24th Annual Symposium on Theory of Computing,
ACM Press (1992) 632-642
20. Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the Theory of Average Case
Complexity. Journal of Computer and System Sciences
44
(1992) 193-219
21. Freivalds, R.: Fast probabilistic algorithms. In Becvar, J., ed.: Proc. Volume 74
of Lecture Notes in Computer Science., Olomouc, Czechoslovakia, Springer (1979)
57-69
22. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progresions.
In: Proc. Nineteenth Annual ACM Symposium on Theory of Computing, New York
(1987) 1-6
23. Markov, A.:
On the problem of representability of matrices.
Z. Math. Logik
Grundlagen Math (in Russian)
4
(1958) 157-168
