Linked Questions

7
votes
1answer
2k 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 ...
3
votes
1answer
24k views

Is SHA-256 safe and difficult to crack? [duplicate]

I am trying to crack a SHA-256 hash but I am not sure how to approach this in an efficient way. The following is known of the original non-hashed content: 64 characters long only consists 0-9 and a-z ...
4
votes
3answers
1k 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 ...
4
votes
2answers
10k 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 ...
4
votes
2answers
6k 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 <...
1
vote
1answer
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?
3
votes
1answer
2k views

ECC keys vulnerable to brute force attack?

I have started learning about Elliptic curve cryptography. Since the key size required in ECC is relatively lesser than the key size in RSA to provide the same amount of strong encryptions, I wonder ...
5
votes
1answer
802 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 ...
2
votes
2answers
664 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,...
6
votes
1answer
1k views

AES128 and 256 Microsoft Office

I realise this is kind of a basic question but its one I must have an answer too. One of the questions I have had thrown at me recently is why are we still using the default of AES128 when password ...
2
votes
3answers
785 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 ...
-3
votes
2answers
836 views

Breaking Ransomware encryption

Recent news reports show that the UK's NHS (Nation Health Service) has suffered a major ransomware attack which is also affecting other parts of the world especially Spain and Russia, the effect is to ...
-4
votes
1answer
2k 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 ...
5
votes
1answer
2k views

Can cryptocurrency mining devices be used for cryptanalysis?

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 ...
2
votes
2answers
330 views

Is there a metric (term) for work required to decrypt a public key?

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 ...

15 30 50 per page