You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I see that a bitsliced AES implementation is in the "Future Plans" list.
This is something I've toyed with in the past, and would be interested in contributing.
Just to check that we're talking about the same concept, the idea is to pack n 128-bit message blocks into 128 n-bit python bigints, and then perform a bitsliced AES algorithm in pure-python, before unpacking the message back into bytes.
If I implemented this, would it be a useful contribution?
P.S. How fast should it be, ideally, to be considered practical?
The text was updated successfully, but these errors were encountered:
I see that a bitsliced AES implementation is in the "Future Plans" list.
This is something I've toyed with in the past, and would be interested in contributing.
Just to check that we're talking about the same concept, the idea is to pack n 128-bit message blocks into 128 n-bit python bigints, and then perform a bitsliced AES algorithm in pure-python, before unpacking the message back into bytes.
If I implemented this, would it be a useful contribution?
P.S. How fast should it be, ideally, to be considered practical?
The text was updated successfully, but these errors were encountered: