Linked Questions

2
votes
2answers
334 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 ...
1
vote
1answer
1k views

Creating a random password based off of a prime number

So I am making an application that basically creates strings that must be encrypted before they are stored on a user's device. If the user blindly starts running the application without creating a ...
3
votes
2answers
336 views

can a weak cipher in a cascade weaken the result?

So i am a real beginner . And I use AES(TWOFISH(Serpent))) for my veracrypt file . So I asked myselfe a Question : When a Cascade is made the Key is split in parts for each algorythm . So if We ...
1
vote
1answer
1k views

Using HMAC-SHA256 with short passwords and sliced outputs for short-lived secure hashing

I don't have much background in cryptography, so forgive me if I'm using the wrong mathematical terms to explain my needs. Following this question, I learned that taking a random secret 16-bytes <...
3
votes
1answer
578 views

Order of multiple encryption algorithms

as you can see on image above, in VeraCrypt you can select either Serpent -> Twofish -> AES or ...
0
votes
2answers
1k views

How to calculate a private key from public key on elliptic curve? [duplicate]

Provided, that you have to multiply a well known G by the private key to obtain the public key, why not keep adding G to itself until you reach the public key. The private key should be the number of ...
4
votes
3answers
959 views

How confident can we be that nobody will crack a 128-bit key?

In a context involving a block cipher like AES-128, excluding quantum computers, cryptanalytic breakthrough on AES and implementation attacks (poor TRNG, DPA..), and wrench, how confident can we be ...
2
votes
1answer
170 views

Why is 128-bit considered “medium term” security?

Why is 128-bit encryption considered good enough for medium term security only? How is expected to be eventually broken? Quantum computing or brute force attack?
3
votes
2answers
238 views

Recovering key in AES - Infinitely many known plaintext ciphertext pairs

Is it possible to recover key/algorithm in AES encryption more efficiently than via brute force given attacker has access to arbitrarily many plaintext ciphertext pairs. If so, are there other known ...
0
votes
1answer
303 views

Perfect secrecy of block ciphers

Is it right that all block ciphers don't provide perfect secrecy like AES? If it's true, how can we prove that? If it's not true can you tell me a sample? Any reference or guidance would be ...
-2
votes
1answer
355 views

SHA256 - Which is less impossible?

To generate every possible hash would be ... impractical. To work backwards from any given hash is also incredibly labor intensive. Of the two, which is less impossible? Why?
1
vote
1answer
181 views

Encryption using matrix transformations

I have been thinking lately about a block cipher which takes a block of bits and arranges them in a square matrix. Then defining transforms on submatrices of the square matrix to scramble the bits. ...
0
votes
2answers
335 views

Can an AES-256 key be generated for a large number of cribs? [duplicate]

I have a question in regards to Ransomware type viruses. I know that a number of these viruses use the AES-256 algorithm to encrypt user's files using a randomly generated key. I work in IT support ...
0
votes
1answer
246 views

How can I study the math behind cryptography? [closed]

I am a junior in high school and I am currently studying algebra 2. Where can I go to learn about the mathematics behind cryptography? I have a very basic knowledge of cryptography, but I am really ...
0
votes
2answers
132 views

Is there a way of increasing the time to brute force a cipher, but by increasing the ciphertext size instead of the key size?

If you have a symmetric-key algorithm that is limited to using a small key size (say 40-bits) is there any way you could increase the resistance to brute force attacks without increasing the key size? ...

15 30 50 per page