-8
votes
0answers
114 views

Visualizing The Crack of The RSA Cryptosystem [closed]

Q: how would you illustrate the RSA Cryptosystem with the new fast factorization technique? Side Note: This question is about Mathematica but it is not a home work. So, feel free do not publish your ...
2
votes
2answers
128 views

FactorInteger over UFDs

How can I factor 'integers' over other quadratic number fields (not just gaussian integers). For instance, how could I factor $7 = (3 + ω)(2 − ω)$ over Eisenstein integers ($ω = \frac{-1+ I ...
1
vote
1answer
169 views

How to represent very long integers with at-most-8-digit(base-10) short integers with * and +

I need an algorithm in Mathematica, which can represent any very long integer, prime or not, into the the product operation "*" and sum "+" forms by short integers (not more than 8 decimal digits). ...
5
votes
1answer
359 views

Time approximation of decrypting RSA algorithm

I've written a function that encrypts a text using the RSA algorithm. It then decrypts it using prime factorization, and takes the time it took to decrypt it and puts it in a vector together with the ...