Daniel B
Reputation
Top tag
Next privilege 250 Rep.
 Sep 24 awarded Autobiographer Nov 21 awarded Scholar Nov 21 accepted Time approximation of decrypting RSA algorithm Nov 20 comment Time approximation of decrypting RSA algorithm No, I am not sure it's exponential now when I have examined it closer with LogPlot. What function would you suggest to plot an exponential function that fits my values? Nov 20 awarded Supporter Nov 20 comment Time approximation of decrypting RSA algorithm I am not sure I get what you mean. Are you saying that my underlying data is not enough to estimate Length[N] = 100, even though I find an exponential function for it? My theoretical basis is to use FactorInteger-function to find the prime numbers of N values with a 28 < Length < 60. Nov 20 comment Time approximation of decrypting RSA algorithm Yes, as said above, it is just Mathematica shortening the value. Nov 20 awarded Student Nov 20 comment Time approximation of decrypting RSA algorithm It is a very small number; 0.00565328. Nov 20 asked Time approximation of decrypting RSA algorithm