Decoding Secret Credit Card Numbers & Phone Recharge Codes

debayan
Messages
7
Reaction score
0
how are the secret codes for recharging the credit of a phone or the secret credit card numbers gnerated? i hrd something with prime nos. any way to decode them?
 
Mathematics news on Phys.org
I assume you are talking about "trap door" codes- where you can be told how to encode a messsage but that doesn't help you decode it. I don't know all the details but essentially it uses the fact that while it is relatively easy to multiply two large (prime) numbers together, it is almost impossible to factor the product without knowing the two factors to begin with. Yes, it is possible to decode them:
(1) Know the correct factors to begin with
(2) Use very, very powerful computer for a very, very long time.
 
Well, it can be cracked, but there's no smooth way to do it.
If there were, http://www.rsa.com/rsalabs/node.asp?id=2092 wouldn't give out $30,000 to the one who factors a number of "just" 212 decimal digits (and $200,000 for a 600+ digit number) :)
 
Last edited by a moderator:
"RSA-640 is factored!

The factoring research team of F. Bahr, M. Boehm, J. Franke, T. Kleinjung continued its productivity with a successful factorization of the challenge number RSA-640, reported on November 2, 2005. The factors [verified by RSA Laboratories] are:

16347336458092538484431338838650908598417836700330
92312181110852389333100104508151212118167511579

and

1900871281664822113126851573935413975471896789968
515493666638539088027103802104498957191261465571

The effort took approximately 30 2.2GHz-Opteron-CPU years according to the submitters, over five months of calendar time. (This is about half the effort for RSA-200, the 663-bit number that the team factored in 2004.)
Top of Page
"

Remember what HallsofIvy was just saying XD
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
3
Views
4K
Replies
9
Views
2K
Replies
9
Views
4K
Replies
1
Views
1K
Replies
14
Views
1K
Replies
6
Views
3K
Replies
12
Views
3K
Back
Top