[Libre-soc-bugs] [Bug 1155] O(n^2) multiplication REMAP mode(s)

[bugzilla-daemon at libre-soc.org]

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

Jacob Lifshay <programmerjake at gmail.com> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
         Resolution|---                         |FIXED
             Status|IN_PROGRESS                 |RESOLVED

--- Comment #81 from Jacob Lifshay <programmerjake at gmail.com> ---
After doing some research, it looks like we only promised NLnet that we'd work
on demos of cryptographic algorithms, not which specific ones we'd work on, or
what kind of demos those would be. NLnet only has #773 on the MOU, which this
bug is part of. Therefore I think we can say that the mul_remap.py source code
and the discussion on this bug qualifies as a demo, so we can close this bug as
completed.

https://git.libre-soc.org/?p=openpower-isa.git;a=blob;f=src/openpower/test/bigint/mul_remap.py;h=d11ef619650882df2234a4c75d64fa17638a063b;hb=9500dc9b04f3f80bd3f0fbf1c83887f07548818c

For additional work outside of the cryptorouter grant, we can create a new bug
if/when we get around to that.

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