![]() I need to do some aws sig4 request signing in ruby in order to send a signed request to AWS, the AWS docs only list examples in python ![]() How could do I implement that/is there already an implementation of it out there? I don't want to make people generate GPG keys either, I just want an implementation in python. I don't care about encryption speeds as long as they're under like a minute or so, I don't mind it being being heavy-ish as long as it doesn't need like 999GB of ram and 87 cores. I tried implementing it myself, but failed, I am bad at cryptography. I want to encrypt some binary data which stores some credencials + some extra stuff with a user set password, but cannot find anything, if I find something good it's not with a user set passwrd and if I find something good it does not have the user set password feature. Implementation, but I cannot find a secure one. I have been looking for a proper good python encryption TL DR I want a good encryption implementation in python with a user-set password, can't find a proper implementation or module for that, do you have any good implementation of it? It seems like there should be a better way then my approach of using cylinder to take the X & Y data, interpolate between points (to fill Z where data isn't), rotate it, and put the result into a matrix Z. When I try = cylinder(X,Y) I get, error: linspace: N must be a scalar. This is, I assume, because I'm using cylinder(Y). surf(u,v,w) plots almost correctly - the scaling on the (u, v) axes ranges from instead of. I've tried using the cylinder function, = cylinder(Y) thinking I could extract the data or create a matrix Z from. My need is to sweep the X, Y data completly around the Z axis and put the resulting swept data values into a matrix Z of size (51, 51). I cannot get a good fit to the data from fitting a function (I've tried quite a few). X does not increase uniformly - as x approaches a value of 0, data sampling density increases from increments of 2.5 to increments of 1. R = block_size(length(block_size)/2+1:length(block_size)) ![]() L = block_size(1: (length(block_size)/2)) Please check my code if it is correct or not: for i=1:1000 %the number of roundsīlock_size = ones(1,128) %block size : 128 bits (The input is one block of all 1s and The secret key is set as all 1s). I want to do the encryption and the decryption. I have Block size: 128-bit, Key size: 128-bit, and Number of rounds: 1000. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
January 2023
Categories |