Hi, this is my first post here, so sorry if I screw things up.
This post is rather similar to /forum/t-137688 (sorry, I can't link) from five (!) years ago.
I'm trying to find a way to perform the AND, OR, and XOR bitwise operations on 32-bit numbers very quickly. I've already written a method that does then in around 1.3 seconds, and further reduced that to 0.7 seconds by using a 16x16 matrix (transferred from the computer) to store the result for all AND/OR/XOR possibilities of 4 bits. (Getting desperate…)
So I was wondering if there's any way to do this faster? Maybe there is an assembly program that could help do this? Bitwise operations should be fairly fast for the processor, in fact, faster than adding, which makes this problem amusing.
(In case anyone is wondering, I'm trying to implement the SHA-1 hash algorithm. It uses a LOT of bitwise operators: my current program takes minutes to run vs milliseconds on a computer. I've seen calccrypto's work and it's pretty awesome!)