cypher tools preview, unsigned 32bits
I've been working on a small toolkit for creating cyphers.
So far included: a Feistel utility (you provide the F-function routine ID),
an S-box function, a sequence shuffler, and a latin square builder/shuffler.
In the works: hash function(s), entropy hooks.
I intend to release an early, highly unoptimised but well documented
version of the library within a week. I'm open to suggestions if there's
anything else you'd like to see included, but I will not include actual
encryption algorithms.
My question: is there a way to perform bitwise operations on 32bit UNSIGNED
integers(actually a sequence of integers)? I need to alternate between
32bit bitwise and standard arithmetic operations. The best idea I've
thought of is to allocate enough memory to accommodate the sequence, then
use a poke4() followed by a peek4u() to coax the interpreter into
interpreting the values as I'd like it to, but this is inefficient.
I would suggest one or both of the following additions to the language: A
set of unsigned bitwise logical operators, such as xor_ubits, not_ubits,
etc. A pair of functions, signed_32() and unsigned_32(), which would force
32bit values to be interpreted as signed or unsigned.
any suggestions would be appreciated,
isaac
|
Not Categorized, Please Help
|
|
