[Libre-soc-bugs] [Bug 776] Documentation of designs, code, processes, and other relevant things as needed

[bugzilla-daemon at libre-soc.org]

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

Luke Kenneth Casson Leighton <lkcl at lkcl.net> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |lkcl at lkcl.net

--- Comment #5 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
(In reply to Konstantinos Margaritis (markos) from comment #3)

> I would pick the simplest and fastest to implement long-multiply method for
> this one, speed is not a requirement. We can always optimize later.

the top priority for the embedded application which is commercially
confidential is to fit within 1 to 2 L1 cache lines.

that is *real* tight.

optimisation for "speed" is very low priority indeed.

Knuth Algorithms D and M are perfectly fine and Jacob and I already
did the conversion when doing the madd dsld and divmod instructions.

but for ed25519 a totally different approach is needed because they
did carry-save.  please read the edited comment on that, raise the
bugreports so i can properly fill them in.

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