I posted a question here back in March 2015:
click here
The question was closed by the mods. It is not listed in my profile and activity, however, and visible to myself only after I login and click ...

I was reading this question about generating primes for RSA keys. The answers point out that most implementations of of the algorithm use probabilistic prime-ness checking algorithms. The answer by ...

I'm aware that MD5 is broken, and collisions have been found for it. I'm interested in other hashes (SHA-1, SHA-2, SHA-3) when truncated to the same digest size, i.e. 128 bits.
The time complexity of ...

I read some papers saying a certain scheme is secure for offline brute force attacks, but vulnerable to online brute force attacks. I wonder the difference between the online and offline brute force ...

EFF - Electronic Frontier Foundation - built a DES cracker for a budget of 250K$ in July 1998. I assume that as of 2015 - the cost of such a DES breaker would be less, are there any estimations about ...

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition?
Is a cipher broken ...

According to Kerckhoffs's principle "A cryptosystem should be secure even if everything about the system, except the key, is public knowledge." Now I want to throw in a provoking formula of mine which ...

It is known that DES has the key-complementation property. That is, given any key $k$ and any
message $m\in\{0,1\}^{64}$
$$\operatorname{DES}_k(m)=\overline{\operatorname{DES}_\overline k(\overline ...

There are published techniques for cracking LCGs, but to my eye those techniques seem very brittle — very minor changes can add nonlinearity that renders techniques like the LLL algorithm unusable. ...

I have an encryption service in which the user decides the length and the type of key, so I would like to build a tool that educates the user on the brute force times for the key they created if using ...

I've read several articles about brute force cryptanalytic attacks, but none explicitly say what algorithm is being run for each attempt, nor what criteria is used to declare an attempt a success or a ...

I'm one of the developers of an application which uses SRP-6 as the authentication mechanism. The authentication part of the code is very old and uses N with only 256 bits (all arithmetic is done in ...

There is a cipher called PRINCE proposed in ASIACRYPT two years ago.
See the paper: “PRINCE – A Low-latency Block Cipher for
Pervasive Computing Applications”
The cipher divides the 128-bit key into ...

When performing a key search, I've always wondered how you reliably detect a successful decryption once you hit the right key. I assume that you have to analyze the data and look for patterns: words, ...

Is there way to make encryption scheme ASIC and GPU resistant, besides using a lot of memory?
And what is there ciphers or modes of use for such purpose? Including public keys algorithms maybe too, ...

Any public key decryption can be decrypted given enough time and computing power. Is there a metric or term for this? Something like
it would require on average 2^43 1024 bit hashes to find private ...

I'm trying to brute force a 3DES problem given a reduced keyspace (ie I know the first half of the key) but with an unknown IV. The code decrypts to plaintext. My first thought was that I could set ...

In the past year or so we have seen production of ASIC devices designed for mining of cryptocurrencies. These devices can perform SHA256 hashing at rates much higher than was seen in the past and are ...

Let the block length 64-bit, 256-bit key, cipher text accordingly - 64 bits. What is the strength of the block cipher, if any unknown attacks, which could reduce its strength. We can only brute force.
...

I'm curious what would happen in the following scenario:
Suppose an attacker gets a hold of a cipher-text of sufficiently large length. And suppose he has the means to verify a successful decryption.
...