Questions tagged [parallelization]

This tag should be used for any question discussing around cryptographic algorithms that embed a non negligible level of parallelism.

Filter by
Sorted by
Tagged with
1 vote
2 answers

Factoring 350 to 400 bits long rsa number with a factor that has a known bitlength… But in less than 5 to 7 minutes and less than $100

the gnfs is the most efficient algorithm for factoring numbers formed of equal composites. But it’s sequential/Linea Algebra parts mean (If I’m not wrong), that it requires at least 10 minutes on ...
user2284570's user avatar
2 votes
0 answers

Easy-to-update parallelizable hashes

Do any parallelizable cryptographic hash algorithms that allow for quick—preferably constant-time—recalculation of a hash result upon updating a portion of the data input exist? I know that BLAKE3 is ...
Melab's user avatar
  • 3,655
6 votes
1 answer

argon2, is there a security cost to raising the parallelism too high?

I'm experimenting with the parameters for argon2, using argon2_cffi. Whereas the iteration count or time_cost, and the memory_cost have obvious bearings on the speed and security of the result. I've ...
Neil_UK's user avatar
  • 408
0 votes
3 answers

Do we want to allow/Have we allowed parallelization (e.g GPU programming) to enter the cryptographic field? What are the consequences?

With the term GPU programming, I'm referring to highly parallelizable computing in general. Lastly, I have built a bit of a background in cryptography. So I have started to wonder if/where GPU ...
tur11ng's user avatar
  • 962