[Libre-soc-bugs] [Bug 942] next things to work on -- bigint rsa mul algorithm for bigint presentation

[bugzilla-daemon at libre-soc.org]

https://bugs.libre-soc.org/show_bug.cgi?id=942

--- Comment #9 from Jacob Lifshay <programmerjake at gmail.com> ---
(In reply to Luke Kenneth Casson Leighton from comment #8)
> (In reply to Jacob Lifshay from comment #7)
> 
> > no, i mean like the matrix equivalent of 1 / x.
> > https://en.wikipedia.org/wiki/Invertible_matrix
> > it happens as part of generating the assembly program for toom-cook so using
> > svp64 isn't helpful there.
> 
> hey i remember doing those, urr 35 years ago so uhn not so helpful :)
> i have vague recollections about calculating them 
> 
> https://stackoverflow.com/questions/32114054/matrix-inversion-without-
> numpy#51214047
> 
> that looks pretty reasonable, still using matrix remap schedules,

except that the matrix ops will be executed while creating the assembly
program, not as part of the assembly program. this is essentially compile-time
computation, so svp64 matrix ops aren't needed, a plain python function will do
best.

-- 
You are receiving this mail because:
You are on the CC list for the bug.