Algorytmy transformacji wielomianowych i ich zastosowania

Bibliografia76 (3), 327––339.Fiat, A. i Naor, M. (1993). Broadcast encryption. Lecture Notes in ComputerScience, 773 , 480––491.Fichtenholz, G. M. (2002). Rachunek różniczkowy i całkowy. Tom 1 . PWN.Frigo, M. i Johnson, S. G. (1997).Technical Report: TR-728 .The fastest Fourier transform in the West.Frigo, M. i Johnson, S. G. (2005). The design and implementation of FFTW3.Proceedings of the IEEE, 93 (2), 216––231.Fujioka, A., Okamoto, T., i Ohta, K. (1993). A practical secret voting scheme forlarge scale elections. Lecture Notes in Computer Science, 718 , 248–259.Fürer, M. (2007). Faster integer multiplication. SIAM Journal on Computing, 39 (3),979–1005.Gasca, M. (1989). Multivariate polynomial interpolation. Computation of curvesand surfaces. Kluwer Academic Publisher, 215 – 236.Gerhard, J. (2000). Modular algorithms for polynomial basis conversion and greatestfactorial factorization. RWCA’00 , 125––141.Ghodosi, H., Pieprzyk, J., i Safavi-Naini, R. (1998). Secret sharing in multilevel andcompartmented groups. Lecture Notes in Computer Science, 1438 , 367–378.Goldwasser, S., Micali, S., i Rackoff, C. (1989). The knowledge complexity of interactiveproof systems. SIAM Journal on Computing, 18 (1), 186 – 208.Gontarz, A. (2006). Częstochowa głosowała elektronicznie. Computerworld. URLhttp://www.computerworld.pl/news/91529.html. 5 kwiecień 2006.Hołubiec, J. i Mercik, J. W. (2006). Techniki i tajniki głosowania. Warszawa: EXIT.Hwang, R., Lee, W., i Chang, C. (1999). A concept of designing cheater identificationmethods for secret sharing. The Journal of Systems and Software, 46 , 7 – 11.Iftene, S. (2007). General secret sharing based on the chines remainder theorem87