* Henry Baker <hbaker1@pipeline.com> [Jul 17. 2017 08:55]:
FYI -- Almost everything you ever wanted to know about bit-hacking on Intel processors for implementing binary finite fields.
Yes, squaring and square roots are easy -- even in a polynomial (rather than a normal basis) representation.
Aranha talks about multiple-precision operations on 64-bit and 128-bit registers, so we're talking about big fields here with hundreds and thousands of bits.
Notice that the number of views of this video today is only *41* (including mine)!
The video takes 1 hour 22 minutes, it may be more convenient to just look at the slides: https://www.researchgate.net/publication/292157857_Efficient_Software_Implem... http://caramel.loria.fr/sem-slides/201109291030.pdf (same) In other news the intel SIMD intruction set is the horrible mess that manages to make the x86 intruction set look clean and orthogonal. Best regards, jj
Clearly, it is far easier to get around crypto than to break crypto; only 41 people cared enough to find out what's going on!
https://www.youtube.com/watch?v=Zr7htuOurI4
Efficient Software Implementation of Binary Field Arithmetic Using Vector Instruction Sets
Microsoft Research
41 views Published on Jul 27, 2016
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun