Skip to content

Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.

License

Notifications You must be signed in to change notification settings

sliedes/xor_factor

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Let p and q be two (large, unknown) primes. Moreover, let us know n=pq and x=p XOR q.

Given numbers n and x, this code efficiently (but slightly slowly, because it's Python) factors n and outputs p and q.

Usage:

./ xor_factor.py n x

The algorithm is the one described in this Math StackExchange answer.

About

Given p xor q and n=p*q for two unknown primes p and q, factor n and output p and q.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages