[Libre-soc-bugs] [Bug 1157] Implement poly1305

[bugzilla-daemon at libre-soc.org]

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

--- Comment #5 from Luke Kenneth Casson Leighton <lkcl at lkcl.net> ---
    "This form is the most parallel possible. We could compute every
     product in parallel, then sum everything, map-reduce style.
     There’s only one problem: we need to compute r squared, cubed,
     and so on. To avoid this, we can take a hybrid approach, with two
     applications of Horner’s rule instead of just one:"

https://loup-vaillant.fr/tutorials/poly1305-design?

sadoon we have Parallel Prefix REMAP for doing these cascading
multiplies but i am not sure it s worth it here.

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