Một số thuật toán liên quan đến ma trận có hệ số trong trường hữu hạn và độ phức tạp tính toán của chúng

Tóm tắt

Lượt tải theo tháng

Cách trích dẫn

Pablo Freyre Arrozarena, Freyre Echevarría Alejandro, Dominguez Fiallo Ernesto, Rodríguez Aulet Ramses, Alzugaray Vizcaino Samir (2024). Một số thuật toán liên quan đến ma trận có hệ số trong trường hữu hạn và độ phức tạp tính toán của chúng. Tạp chí Khoa học và Công nghệ trong lĩnh vực An toàn thông tin, 1(21), 16-30. https://doi.org/10.54654/isj.v1i21.1032

Tài liệu tham khảo

1. 1.Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C.: “Introduction to Algorithms”. MIT Press, Massachusetts, 2022.
2. 2.Alman, J. and Williams, V. V.: “A refined laser method and faster matrix multiplication”. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 522–539, 2021.
3. 3.Li, Y.-X., Li, D.-X., and Wu, C.-K.: “How to generate a random nonsingular, matrix in McEliece’s public-key cryptosystem”. In Proceedings Singapore ICCS/ISITA92, pp. 268–269, IEEE, 1992.
4. 4.Randall, D.: “Efficient generation of random nonsingular matrices”. Random Structures & Algorithms, Vol. 4(1), pp. 111–118, 1993.
5. 5.Freyre, P., Díaz, N. and Morgado, E.: “Fast algorithm for the multiplication of a row vector by a randomly selected matrix A”. Journal of Discrete Mathematical Sciences and Cryptography, Vol. 12(5), pp. 533–549, 2009.
6. 6.Murray, S.H.: “The Schereier-Sims algorithm”. Essay submitted to the Department of Mathematics of the Australian National University, 2003.
7. 7.Holt, D.F., Eick, B. and O’Brien, E.A.: “Handbook of computational group theory”. CRC Press, 2005.
8. 8.Cannon, J. “A computational toolkit for finite permutation groups”. In Proceedings of the Rutgers Group Theory Year, Vol. 1984, pp. 1–18, 1983.
9. 9.Green, J. A.: “Sets and groups: A first course in algebra”. Springer, 1988.
10. 10.Peterson, W.W. and Weldon, E.J.: “Error-correcting codes”. MIT Press, Massachusetts, 1972.
11. 11.Harvey, D. and Der Hoeven, J.: “Faster polynomial multiplication over finite fields using cyclotomic coefficient rings”. Journal of Complexity, Vol. 54, pp. 101404, 2019.
12. 12.Cantor, D.G. and Kaltofen, E.: “On fast multiplication of polynomials over arbitrary algebras”. Acta Informatica, Vol. 28(7), pp. 693–701, 1991.
13. 13.Brent, R.P. and Zimmermann, P.: “Modern Computer Arithmetic”. Cambridge University Press, 2010.
14. 14.Althoen, S.C., Mclaughlin, R.: “Gauss-jordan reduction: A brief history”. The American Mathematical Monthly, Vol. 94(2), pp. 130–142, 1987.
15. 15.Press, W.H., Teukolsky, S.A., Vetterling W.T. and Flannery, B.P.: “Numerical recipes: the art of scientific computing”. Cambridge University Press, 1992.
16. 16.Krishnamoorthy, A. and Menon, D.: “Matrix inversion using Cholesky decomposition”. In 2013 Signal Processing: Algorithms, Architectures, Arrangements and Applications, pp. 70–72, IEEE, 2013.
17. 17.Vajargah, B.F.: “A way to obtain Monte Carlo matrix inversion with minimal error”. Applied Mathematics and Computation, Vol. 191(1), pp. 225–233, 2007.
18. 18.Huang, Y. and McColl, W.: “Analytical inversion of general tridiagonal matrices”. Journal of Physics A: Mathematical and General, Vol. 30(22), 1997.
19. 19.Ries, F., De Marco, T. and Guerrieri, R.: “Triangular matrix inversión on heterogeneous multicore systems”. IEEE Transactions on parallel and distributed systems, Vol. 23(1), pp. 177 – 184, 2011.
20. 20.Strassen, V. et. al.: “Gaussian elimination is not optimal”. Numerische Mathematik, Vol. 13(4), pp. 354 – 356, 1969.
21. 21.Coppersmith, D. and Winograd, S.: “On the asymptotic complexity of matrix multiplication”. SIAM Journal on Computing, Vol. 11(3), pp. 472 – 492, 1982.
22. 22.Traub, J.F.: “Associated polynomials and uniform methods for the solution of linear problems”. SIAM Review, Vol 8(3), pp. 277 – 301, 1966.

Bài viết liên quan

• Efficient multiplication of a vector by a matrix MDS
• A new look in the representation of AES like S-box