9,586 reputation
12347
bio website github.com/CodesInChaos
location Frankfurt, Germany
age
visits member for 3 years, 1 month
seen 9 hours ago

Aug
30
comment Proof of work for standard computers
For hamming distance, I don't know what data structure the worker should use to efficiently check if a near-collision occurred. If you think hamming distance works well, please post an answer describing how it would work in practice @DavidSchwartz.
Aug
30
comment Proof of work for standard computers
For prefix collisions it's properties are much worse than a prefix pre-image with the same hash function(scrypt or plain hash). An attacker who as large shared memory and many small parallel If you want to use high memory requirement to give an advantage to a CPU, the worker must not be able to share that memory between cores. That's because a PC has a lot of memory per core, but the total amount of memory isn't larger than that of the attacker.
Aug
30
revised Proof of work for standard computers
added 9 characters in body
Aug
29
reviewed Approve suggested edit on ntru tag wiki
Aug
29
reviewed Approve suggested edit on proof-of-work tag wiki excerpt
Aug
29
reviewed Approve suggested edit on ntru tag wiki excerpt
Aug
29
reviewed Approve suggested edit on proof-of-work tag wiki
Aug
29
comment Can you help me with this Random Number Generator function?
Please don't cross post. Nobody suggested you should. Someone suggested a migration, and even that was dubious.
Aug
29
comment Is this a good way to encrypt a file?
Your salt encryption step doesn't make much sense. Why not just include the plain salt?
Aug
29
comment Why is ciphertext from low entropy plaintext not compressible?
The problem is that the actual entropy of the ciphertext isn't higher than the entropy of plaintext and key. It's just difficult to exploit this redundancy for compression.
Aug
27
comment Secure Hash Function based on AES
You can build a MAC with a similar technique (CBC-MAC) but building a good hash function is harder.
Aug
27
awarded  Enlightened
Aug
27
awarded  Nice Answer
Aug
27
comment Storage of Private Keys
@JordanArseno For spending the coins you use a smaller hot wallet. There is no reason to have users spend their own coins.
Aug
27
comment Is it OK to use a data-encryption key for key wrapping, too?
@StoverFlo I assumed the anonymous edit was you not being logged in. If it wasn't feel free to revert.
Aug
27
reviewed Approve suggested edit on Is it OK to use a data-encryption key for key wrapping, too?
Aug
27
revised malleability wiki excerpt
deleted 1 characters in body
Aug
26
comment How is block cipher padding verified for consistancy?
Another annoying thing in this context are padding-oracles, where an attacker can figure out if a text decrypted correctly(i.e. the padding was valid) and use that to decrypt the whole message. Padding oracles are one of the reasons why MACs are strongly recommended.
Aug
26
comment How is block cipher padding verified for consistancy?
Depends on the padding in question, and on how the validation routine works. But should be around 1/256 resulting in a message that has length (blocksize-1) mod blocksize.
Aug
26
suggested suggested edit on malleability tag wiki excerpt