### Modification of the Coppersmith algorithm for matrix multiplication over GF(2)

#### Abstract

#### Full Text:

PDF (Russian)#### References

Albrecht, M. R., G. V. Bard, and W. Hart. "Efficient multiplication of dense matrices over GF (2). CoRR abs/0811.1714 (2008)."

Kriptograficheskie protokoly/ Cherepnjov M.A.// Moskva: MAKS Press, 2018.

Montgomery P.L. A Block Lanczos Algorithm for Finding Dependencies over GF(2)// Advances in Cryptology - EuroCrypt'95 / Louis C.Guillou and Jean-Jacques Quisquater, editors. Berlin: Springer-Verlag, Lect. Notes in Comp. Sci.-1995.-v.921- p.106-120.

Coppersmith D. Solving homogeneous linear systems over GF(2) via block Widemann algorithm.// Mathematics of Computation.-1994-v.62-no.205-p.333-350.

Ob jekonomnom postroenii tranzitivnogo zamykanija orientirovannogo grafa./ Arlazarov V.L., Dinic E.A., Kronrod M., Faradzhev I.A.//DAN SSSR.-1970.- t.194-#3-s.487-488.

Powers of tensors and fast matrix multiplication. / Le Gall F.// International Symposium on Symbolic and Algebraic Computation, pp. 296–303 (2014)

Multiplying matrices faster than coppersmith-winograd./ Virginia Vassilevska Williams// Proceedings of the 44th Symposium on Theory of Computing Conference, pp. 887–898 (2012)

### Refbacks

- There are currently no refbacks.

Abava Absolutech IT-EDU 2019

ISSN: 2307-8162