Skip to content

Prime backdooring procedure to allow fast factorization of semiprimes

License

Notifications You must be signed in to change notification settings

cryptolu/primes-backdoor

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 
 
 

Repository files navigation

About

This repository contains a SageMath implementation of the prime generation procedure and factorization attack detailed in the paper

Factoring Primes to Factor Moduli: Backdooring and Distributed Generation of Semiprimes

by Giuseppe Vitto.

Functionalities

The script gen_prime.sage generates a random prime p so that a twist of the Complex Multiplication curve defined over the finite field of size p has smooth order with respect to a certain input factor base. Optionally, the safe_prime option can be set to True to output safe primes instead of just primes.

The script attack.sage attempts factorisation of an odd input composite integer N, using the attack outlined in the paper. In case N has one of its prime factors backdoored as above, this prime will be returned.

About

Prime backdooring procedure to allow fast factorization of semiprimes

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages