Introduction At present the prime numbers are widely used both in cryptography as digital signatures, it would be nice to have an algorithm or set of algorithms capable of efficiently generate, cousins of large lengths. Although these algorithms have, there may be some problems, and it may happen that we are generating prime numbers does not serve us, so we must consider several points. We must ensure that the numbers we are creating are really cousins or with a high probability they are. Check if a number is composite or prime, can be treated in several ways, is to factor a very simple and just show the prime factors, convince without having to show a complex theory or auxiliary arguments. Another way would be quite similar to find a splitter that number, it would show a simple way anyone. But persuade someone if the number is prime, a for this we must turn to auxiliary theories, which are simple or complex depending on the level of strength of our algorithm, which demonstrate the conditions that must meet a number to be prime or not, in this way would verify and, if fulfilled or not, we would know it is prime or composite, sometimes with security and others with a high probability.

Another feature of the numbers that we generate, is that no one can get, even with knowledge of the workings of our algorithms. This can be achieved with the use of functions that generate random numbers. Once a guaranteed both, can we trust the prime numbers obtained.

Another feature of the numbers that we generate, is that no one can get, even with knowledge of the workings of our algorithms. This can be achieved with the use of functions that generate random numbers. Once a guaranteed both, can we trust the prime numbers obtained.

Posted by: |