Linked Questions
35 questions linked to/from How reassuring is 64-bit (in)security?
1
vote
2answers
94 views
How long would it take all of the supercomputers or cloud computing on Earth to bruteforce a significantly long password?
I was arguing with a colleague who thinks that SHA256 (password + 64 character static salt) is "insecure." My argument is that nothing in cryptography is "secure," it's all a ...
1
vote
5answers
267 views
Is it theoretically possible to create an unbreakable cipher?
I know this question might sound strange, but is it theoretically possible to create an unbreakable cipher if we don't consider bruteforce? Some of us believe that it is possible to create ciphers and ...
4
votes
1answer
706 views
Is Mega.nz encryption vulnerable to brute force cracking by quantum computers?
I am interested in Mega.nz cloud storage.
It is using end-to-end encryption.
It says that it uses AES-128 to encrypt files
And there are more details in their white paper
But I saw that quantum ...
1
vote
2answers
96 views
Recovery Passphrase Collission for BIP-39 and BIP-44
Referring to the standards of [BIP-39] and [BIP-44]: a 'master password' consisting of 12 words uniformly selected from a 2048-word dictionary corresponds to 128 bits of entropy, that is then used as ...
2
votes
3answers
290 views
3DES security when K1=K3
I am mainly looking for security on 2-key $\operatorname{3DES}$ implementation where $K_1=K_3$.
How hard or easy is it to crack $\operatorname{3DES}$ when $K_1=K_3$?
2
votes
1answer
216 views
How long would it take to brute force a 32 or 16 bit integer and which type of processor would brute force this in the shortest period of time
I was actually wondering... How long would it take to crack/brute force a 32 bit key/encryption and a 16 bit key/encryptions respectively on a 4GHZ and a 2GHZ PC. I know that a 32 bit integer has 4,...
1
vote
1answer
132 views
How to calculate time needed for decryption of 64-bit key
I am having trouble figuring out how long it takes to decrypt a 64-bit key, given that a computer can do 1 billion trials per second. I know that there are $2^{64} = 1.844 \times 10^{19}$ possible ...
3
votes
1answer
124 views
Do ciphers with a key size of 64 bits still have use under very limited attack models?
If we have a very performance critical interactive session, like a video game, running on a trusted platform (video game console).
If our goal is to prevent exfiltration of up to date information (...
1
vote
0answers
42 views
Can Trivium ciphertext be decrypted by an adversary if the key is known, but the IV is not?
Suppose that the adversary is able to recover the key of Trivium cipher. But the associated IV is unknown to him. Will he be able to decrypt the ciphertexts without any complexity?
2
votes
1answer
222 views
80-bit security and attack time
Many designer claimed that their cryptography scheme has 80-bit security. So how to calculate the time of attcking this 80-bit security cryptography scheme, such as 80-bit security RSA using a kind of ...
2
votes
1answer
163 views
SHA-256 security for initial 32 bits
I have concerns regarding truncated SHA-256 hashes in an application I am building at the moment:
Nomenclature
secret - the full 256-bit SHA-256 result of hashing ...
1
vote
1answer
61 views
MD5 hash: retrieve an element of a source string
Suppose you have a string, precisely an MD5 hash string, which basically it is computed in the following way:
"element1:element2:element3"
So, in order to get ...
1
vote
1answer
83 views
Good pre-image resistance value for hash visualization
I want to do "hash visualization", i.e. derive a human-meaningful information from a hash, like a phrase or an avatar. But the current techniques usually don't use many bits, for example tripphrases ...
7
votes
4answers
345 views
Can I replace SHA-1 with SHA-512/160 to address Shambles?
The destination is software (within a remote trust boundary) that expects SHA-1 results. Would it be safer for the source (that's within my own trust boundary) to replace my SHA-1 computation at my ...
16
votes
1answer
10k views
In 2020, SHA-1 practically broken in chosen-prefix collision (CP-collision). Can double SHA-1 hashing prevent CP-collision?
In a recent study SHA-1 is a Shambles - First Chosen-Prefix Collision on SHA-1 and Application to the PGP Web of Trust by Gaëtan Leurent and Thomas Peyrin. 2020, they showed the first practical chosen-...