Cryptanalysis protection

 Bloom-Blum-Shub

The Bloom-Blum-Shub algorithm is very interesting and, if certain conditions are met, allows you to generate crypto-resistant pseudo-random numbers of large size. But if you generate numbers of 1024 bits or 2048 bits, then all the prime numbers that you can use in this algorithm have long been known. The required pairs of prime numbers for the algorithm are even smaller. And there is a risk of successful cryptanalysis of your protected data.

It makes sense to use multiple layers of data encryption so that decoded at one layer does not give a meaningful view of the data. And at each level, use algorithms to improve data quality. This is of little use for stream encryption. But for storing personal data, master keys, passwords, PIN codes, tokens it can be very, very successful.

And at the same time synchronicity is maintained. Those. multiple generators will create the same keys (numbers) on any number of generator instances.

The downside is that generator instances need to be very well protected from cryptanalysis. Although... There are ideas for this case too

PS. Bloom-Blum-Shub algorithm is not crypto-resistant

Master keys

Comments

Popular posts from this blog

Czech Entropy PRNG

UAV Coordinates

Global Photo Web Cam