Skip to content

jmpe4x/CHALLENGE-Asymmetric-Cryptography

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 

Repository files navigation

CHALLENGE-Asymmetric-Cryptography

A terrible exponent x has been chosen in the below example. It is 5-smooth, meaning that x can be factored into powers of 2, 3 and 5. Challenge: find x

p = 2^1024 - 1093337

g = 7

y = g^x mod p

y = 61866201876285640738560054986039646277183235081464596666803083888384286111662629​82406518313438601892255572681999822014453307246463068376384156176082291268395302​92767965862079731217551387118069961755120098787914485625672341107972067385487537​14646123243712070687176172027733573067386801703238975473191649230385

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published