Linked Questions

2
votes
1answer
56 views

Do 64-bit ciphers 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
37 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?
1
vote
1answer
118 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
77 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
57 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
75 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
313 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
7k 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-...
4
votes
3answers
3k views

Has AES-128 been fully broken?

Has AES-128 been broken over the full 10 rounds? If so, by what means? By a commercial entity? By a supercomputer? If not, why is AES-256 used to replace AES-128 so frequently?
1
vote
1answer
115 views

Supercomputer to crash hash

For NVIDIA TESLA V100 I know a hashcat performance for SHA1: it is about 17000 MH/s. Performance index for V100 is FP32 5120, FP64 2560. But what about supercomputers? For example Summit ...
1
vote
1answer
55 views

Algorithm/encryption technique which outputs a set number of numerical digits e.g. 20 digits from a given input

What the name of the algorithm/encryption technique which outputs a set number of numerical digits e.g. 20 digits based on some input. You can input some data e.g. text or numbers but the output is ...
0
votes
1answer
68 views

Calculating DES key knowing message before and after encryption [duplicate]

I've 8 bytes before encryption (for example: 01 02 03 04 05 06 07 08) and 8 bytes after DES encryption: ...
1
vote
2answers
105 views

AES-128 with doubled 8Byte key

Assuming I encrypt data with AES-128 and a random 8-byte key x in the following way: ...
0
votes
1answer
90 views

Finding and matching SHA512 Unsalted Hash

We are given a list of possible strings, there are $32^{16}$ ($=2^{80}$) to be exact. We also have the unsalted SHA512 of the original target string. How long would it take to go through those ...
1
vote
2answers
254 views

Hash collisions in sha512 hash of secp256k1 public keys

For a sha512 hash of a secp256k1 public key, how many other public keys could generate that hash? I would assume zero since the key size is equal to the hash length (secp256k1 public keys are 64 bytes,...

15 30 50 per page