network profile
| bio | website | |
|---|---|---|
| location | London, UK | |
| age | 61 | |
| visits | member for | 1 year, 5 months |
| seen | Apr 28 at 12:15 | |
| stats | profile views | 7 |
Retired suit
|
Nov 30 |
awarded | Yearling |
|
Nov 28 |
awarded | Nice Answer |
|
Nov 22 |
comment |
detecting ROT13/base64 encryption @fgrieu: technically, ROT13 is a cypher, albeit a very weak one. It is a Caesar cypher with a key (=shift) of 13. The problem being that the key is not really a secret. |
|
Oct 29 |
comment |
“Padless” One-time-Pad encryption And if the "secret algorithm" is shorter than the message, then you no longer have a One Time Pad. If the "secret algorithm" is longer than the message, then why not use a plain OTP? |
|
Oct 29 |
comment |
Crack SHA1 hash code Brute force will do it. How long it takes depends on how many bits there are in the constant value. |
|
Oct 9 |
comment |
How to encrypt a short string and keep the length secret @Erik: I was giving the standard definition of bit padding, which is defined in terms of bits. My last sentence in that section, "In byte terms..." gives the byte version. |
|
Oct 7 |
answered | How to encrypt a short string and keep the length secret |
|
Aug 25 |
answered | Making a cipher (ex: Vigenere) harder to break |
|
Jun 5 |
comment |
Removing Padded Value in Decrypted Message PKCS#7 padding can always be removed because the last byte of the padded message tells you how much padding there is. If your original message is 02 02 02 ... 02 02, and the padded message is 02 02 02 ... 02 02 02 02, then you know that the last two bytes, and only the last two bytes, are padding. The other bytes are the actual message. |
|
Dec 31 |
answered | Why not use an algorithm's code rather than data itself for one time pads? |
|
Dec 16 |
answered | How to choose a padding mode with AES |
|
Dec 11 |
awarded | Supporter |
|
Dec 5 |
comment |
How to generate a list of unique random strings? Agreed, but for most uses pseudo-random is going to be sufficient. With a requirement for non-repetition, each successive use is 'less random' since it is being picked from a smaller pool. The last number picked has no randomness at all - it is fully determined by the preceding numbers. |
|
Dec 5 |
comment |
How can I make my cipher show the avalanche effect? Cypher/cipher is a UK/US thing. |
|
Dec 1 |
answered | How to generate a list of unique random strings? |
|
Nov 30 |
awarded | Teacher |
|
Nov 28 |
answered | How can I make my cipher show the avalanche effect? |
|
Nov 18 |
answered | Encryption technique performance evaluation |
|
Oct 30 |
answered | Decrypting DES with decrypted and encrypted data |
|
Aug 10 |
answered | How can I improve a password generation scheme based on a shared secret and URL? |
