813 views

### Is there a proof for showing any cryptogram is crackable?

I commonly hear statements along the lines of "all cryptograms are crackable - it's only a matter of time". Is there a proof to show that any cryptogram is "crackable"? The proof may be of a more ...
3k views

### Is the cipher “Kalyna” with a 512-bit key length more secure AES with a 256-bit key?

Recently I have found out that Ukraine has its own symmetric encryption algorithm "Kalyna". Developers of this algorithm said that their algorithm is more secure than AES because of longer key length ...
1k views

### Is this test result sufficient to steer clear from this RNG for cryptographic applications?

I'm not really interested in this PRNG. I'm more interested in understanding what it takes to fail the security threshold for cryptographic applications. I'm taking the C PRNG as an example. ...
2k views

### How likely is a AES KDF bypass?

So I was wondering about some alternative attack scenario which I thought of when I started to understand KDF's . So lets say you have a cipher like AES and a strong KDF . And the legit user uses a ...
12k views

### ECDSA with SHA256 and sepc192r1 curve: Impossible, or how to calculate $e$?

I need to use ECDSA as the signing algorithm and SHA256 for hashing the message. I'm running into troubles verifying the signature calculated on two different platform (one is BouncyCastle, another ...
3k views

### ECC keys vulnerable to brute force attack?

I have started learning about Elliptic Curve Cryptography (ECC). Since the key size required in ECC is relatively smaller than the key size in RSA (to provide the same encryption strength), I wonder ...
8k views

### Algorithm for generating OAuth tokens

I'm trying to find a good algorithm for generating authorization codes, access tokens and refresh tokens in an API. Currently, I am looking into the following setup: Tokens are generated using the <...
2k views

### Why is AES unbreakable?

Why is it said that AES is unbreakable? Brute force attacks would take years to crack it, so is it possible to crack it if the computational speed of machines increase in the following decade?
1k views

### Diffie-Hellman key exchange - why is modulo operation necessary?

Could someone explain why it's necessary to have the modulo operation in the Diffie-Hellman key exchange? Let's imagine we do DH without the modulo operation ($A = g^a, B = g^b$). Would that not work,...
974 views

### Is there a truly safe signing algorithm?

After reading this question, I'm pretty shaken up. A determined attacker with \$100 in loose change can crack any RSA key in a couple of hours. After believing that these algorithms would take millions ...
913 views

### Can there be a need for 1024-bit (symmetric) encryption?

I think we are all aware of the CAESAR-competition. Now the aim of this competition is to select a (portfolio of) winner(s) which provide authenticated encryption. I'll now assume that the results ...
325 views

### Multi Factor Encryption?

I got an alert last night to the keywords above and was curious, so took a look at the tor site flagged which is the following one: http://nsrz5iogimqwgeax3clpp6hvfy6viom2woy7dghgxes4sqk63r7svoqd....
1k views

### Choice between AES-128 and AES-256 for password protection in MS Office

Why are we still using the default of AES-128 when password protecting a Microsoft Word document. My answer is and always has been - because its good enough and MS don't recommend changing to AES-256. ...
1k views

### How much processing power should you assume an attacker has?

The answer to this question says that you should assume an attacker can do one billion operations per second: Key Size for Symmetric Homomorphic Encryption Over the Integers Is that a single attacker ...
3k views

### Is AES256 the most secure encryption algorithm available at the moment? [closed]

I have had to edit this question because it was too broad (sorry didn't realise that was not allowed...), so, lets go with: Is AES256 the most secure encryption algorithm available at the moment? If ...

15 30 50 per page