How to generate a large random prime number in Python?

by | Apr 10, 2021 | Cryptography And Python, Encryption, Exclusive Articles, Featured

We may need to generate a large random prime number in Python for various reasons. When we generate RSA keys, the module internally generates two large prime numbers from which the RSA private key and the public key are generated. When we need to generate a large random prime number for cryptographic purposes, we need to ensure that the prime number is random enough (What is entropy in cryptography?)

In our previous article, we discussed how to generate a random number for cryptographic purposes. In this article, we would discuss how to generate a large random prime number that is secure enough for cryptographic purposes.

How to generate a prime number in Python?

Firstly, we would try a simple approach to generate a prime number in Python. And then we would discuss why this method is not good for generating a large prime number.

We know that a prime number is divisible only by 1 and the number itself. So, if we take a number and try to divide it by numbers less than the number itself, we would get all its factors. And, when the generated number has only two factors, we know that the number is a prime number.

So, let’s try to generate all prime numbers using this method. We would take a number n and then try to divide n by i where i < n. In fact, we do not need to divide n by all i < n. We can divide n by all i < n that are prime numbers. In other words, we can divide n by all prime numbers less than n. But, if a number has two factors and one of the factors is more than sqrt(n), then the other factor is definitely going to be less than sqrt(n). So, we do not need to divide n by all primes less than n. We can divide n by all prime numbers that are less than sqrt(n). If we get a factor of n that is not 1 or n, then we know that n is a composite number.

So, let’s try to use this logic to generate the first 1000 prime numbers. We would start with 2. As 2 is a prime number, we would add 2 to a list. Then we would increment the number by 1 and check its prime factors. If the number is prime, we would add the number to the list of prime numbers. And, when we would check the prime factors of a number, we would take the prime numbers from the generated list.

import math
import secrets

def isPrime(number, primes):

    root = math.sqrt(number)
    for i in range(len(primes)):
        if(primes[i] > root):
            return True
        if(number % primes[i] == 0):
            return False


primes = list()
primes.append(2)
i = 1
ITERATION = 100

for j in range(1000):
    i += 2
    if(isPrime(i, primes)):
        primes.append(i)
print("All prime numbers are generated")

If we run the program, we would see the program can generate 100,000 prime numbers very easily using a standard desktop computer. But, let’s say we want to generate 2048-bit RSA keys for which we need 2 1024-bit random prime numbers. One way to do so is to generate a 1024-bit random number and then check its primality using the above method. But, that would be very slow. So, we need some efficient method to generate a large random prime number.

This article is accessible to premium members only. To access this article, please purchase The Security Buddy Premium Membership Plan.

Facebooktwitterredditpinterestlinkedinmail

Calculate the pseudoinverse of a matrix using Python

What is the pseudoinverse of a matrix? We know that if A is a square matrix with full rank, then A-1 is said to be the inverse of A if the following condition holds: $latex AA^{-1}=A^{-1}A=I $ The pseudoinverse or the Moore-Penrose inverse of a matrix is a...

Cholesky decomposition using Python

What is Cholesky decomposition? A square matrix A is said to have Cholesky decomposition if it can be written as a product of a lower triangular matrix and its conjugate transpose. $latex A=LL^{*} $ If all the entries of A are real numbers, then the conjugate...

Tensor Hadamard Product using Python

In one of our previous articles, we already discussed what the Hadamard product in linear algebra is. We discussed that if A and B are two matrices of size mxn, then the Hadamard product of A and B is another mxn matrix C such that: $latex H_{i,j}=A_{i,j} \times...

Perform tensor addition and subtraction using Python

We can use numpy nd-array to create a tensor in Python. We can use the following Python code to perform tensor addition and subtraction. import numpy A = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) B = numpy.random.randint(low=1, high=10, size=(3, 3, 3)) C =...

How to create a tensor using Python?

What is a tensor? A tensor is a generalization of vectors and matrices. It is easily understood as a multidimensional array. For example, in machine learning, we can organize data in an m-way array and refer it as a data tensor. Data related to images, sounds, movies,...

How to combine NumPy arrays using horizontal stack?

We can use the hstack() function from the numpy module to combine two or more NumPy arrays horizontally. For example, we can use the following Python code to combine three NumPy arrays horizontally. import numpy A = numpy.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]]) B =...

How to combine NumPy arrays using vertical stack?

Let’s say we have two or more NumPy arrays. We can combine these NumPy arrays vertically using the vstack() function from the numpy module. For example, we can use the following Python code to combine three NumPy arrays vertically. import numpy A = numpy.array([[1, 2,...

Singular Value Decomposition (SVD) using Python

What is Singular Value Decomposition (SVD)? Let A be an mxn rectangular matrix. Using Singular Value Decomposition (SVD), we can decompose the matrix A in the following way: $latex A_{m \times n}=U_{m \times m}S_{m \times n}V_{n \times n}^T $ Here, U is an mxm matrix....

Eigen decomposition of a square matrix using Python

Let A be a square matrix. Let’s say A has k eigenvalues λ1, λ2, ... λk. And the corresponding eigenvectors are X1, X2, ... Xk. $latex X_1=\begin{bmatrix} x_{11} \\ x_{21} \\ x_{31} \\ ... \\ x_{k1} \end{bmatrix} \\ X_2=\begin{bmatrix} x_{12} \\ x_{22} \\ x_{32} \\ ......

How to calculate eigenvalues and eigenvectors using Python?

In our previous article, we discussed what eigen values and eigenvectors of a square matrix are and how we can calculate the eigenvalues and eigenvectors of a square matrix mathematically. We discussed that if A is a square matrix, then $latex (A- \lambda I) \vec{u}=0...

Amrita Mitra

Author

Ms. Amrita Mitra is an author, who has authored the books “Cryptography And Public Key Infrastructure“, “Web Application Vulnerabilities And Prevention“, “A Guide To Cyber Security” and “Phishing: Detection, Analysis And Prevention“. She is also the founder of Asigosec Technologies, the company that owns The Security Buddy.

0 Comments

Submit a Comment

This site uses Akismet to reduce spam. Learn how your comment data is processed.

Not a premium member yet?

Please follow the link below to buy The Security Buddy Premium Membership.

Featured Posts

Translate »