| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 10 months |
| seen | yesterday | |
| stats | profile views | 14 |
|
Jun 19 |
comment |
How to represent a 32-byte SHA2 hash in the shortest possible string? @fgrieu: good point. Rather than the original base64, Geotarget probably wants RFC 4648 'base64url' "Base64 with URL and Filename Safe Alphabet". In order to guarantee that a program won't generate a base filename of "con" or some other reserved filename, and to make human-generated filenames such as "readme" usually sort before program-generated filenames, I typically make program-generated filenames start with lowercase 'z'. |
|
Jun 13 |
answered | Encryption vs. decryption of same plaintext |
|
Jun 12 |
awarded | Editor |
|
Jun 12 |
revised |
Looking for cipher that uses one ciphertext link to related question/answer |
|
Jun 12 |
answered | Looking for cipher that uses one ciphertext |
|
May 21 |
comment |
Software implementation of a commutative cipher? possibly related: Algorithm Design for only Mutual Information Sharing |
|
May 3 |
answered | Software implementation of a commutative cipher? |
|
May 3 |
comment |
Software implementation of a commutative cipher? @IlmariKaronen: Yes, good point. |
|
May 1 |
awarded | Student |
|
May 1 |
answered | Software implementation of a commutative cipher? |
|
May 1 |
asked | Has there been any cryptanalysis of RC4-52? |
|
Nov 17 |
wiki | created sha1 description |
|
Oct 17 |
comment |
What is the difference between a stream cipher and a one-time-pad? Since the one-time-pad was actually used, it is not mythical. For example, the original Moscow–Washington hotline starting in 1967 used a one-time pad. |
|
Sep 2 |
comment |
Types of Cryptography for a 4-8 bit microcontroller +1: these look useful and relevant. Thank you. |
|
Sep 1 |
answered | Alphabetic Substitution with Symbols |
|
Sep 1 |
answered | Types of Cryptography for a 4-8 bit microcontroller |
|
Aug 31 |
comment |
How to collect, process, and transmit data securely? Does this data need to be secret (as in a secret ballot), or would it be OK if all of the data and all the final results were revealed to everyone? |
|
Aug 30 |
comment |
Looking for cryptographic secure hash algorithm(s) that produces identical root hash for differently sliced hash list @D.W. Good points. In the best case -- a segment of length 2^n blocks, and starts and ends on a boundary that is a multiple of 2^n blocks -- the user only needs to send 1 hash with (the encrypted version of) that segment to the server. In the worst case -- a segment of of length (2^n - 1) blocks -- the user needs to send O(log k) hashes, as you said, but the server doesn't need to "retain" any of them -- once it has all the hashes for all parts of the file, the server can calculate the one root hash and then discard all the other hashes. |
|
Aug 27 |
awarded | Teacher |
|
Aug 27 |
answered | About Cryptography in a Character Language |