Cryptography/CompSecurity Question

  • Thread starter Thread starter FireStorm000
  • Start date Start date
FireStorm000
Messages
168
Reaction score
0
This is probably slightly outside the domain of these forums, but cryptography is a mathematical process so I'll ask: Generally keys are used to encrypt data, and another matching key is used to decrypt it, at least in public key cryptography (which is what I'm interested in). My question is whether or not it is possible to reverse engineer one of these keys given both the encrypted and unencrypted data streams? In other words, if an attacker has both the input and output of the encryption process, and know the internals of the algorithm could they attack the key and compromise it? Does it vary based on the encryption algorithm? If it can be done, how big of a risk does it pose to existing systems?
 
Mathematics news on Phys.org
Nevermind, I answered my own question. It's called a chosen cypher-text attack, http://en.wikipedia.org/wiki/Chosen-ciphertext_attack" .
 
Last edited by a moderator:
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.
Back
Top