Reputation
Next privilege 125 Rep.
Vote down
Badges
1
Newest
 Supporter
Impact
0 people reached

  • 0 posts edited
  • 0 helpful flags
  • 2 votes cast
Nov
24
comment Writing my own encryption algorithm
Let us continue this discussion in chat.
Nov
24
comment Writing my own encryption algorithm
"if you state your assumptions that doesn't make your algorithm more secure" -- it does, if your assumptions are strong and you prove a link between your assumptions and your algo's security
Nov
24
comment Writing my own encryption algorithm
@Mehrdad: I think you are misunderstanding me. I did not say that there is a proof that RSA is "secure". I said there is a proof that RSA is secure, given certain well understood assumptions. I am trying to answer your initial question "why should a student believe his/her algorithm is any worse [than RSA]" -- it is because the assumptions used in these proofs are very strong and much stronger than just a vague claim of "no-one has broken student X's crypto yet".
Nov
24
comment Writing my own encryption algorithm
@Mehrdad: yes, wikipedia has the citations: "Miller has shown that – assuming the Extended Riemann Hypothesis – finding d from n and e is as hard as factoring" via en.wikipedia.org/wiki/… . As I stated before, the cryptographers have stated their assumptions: i.e. Extended Riemann Hypothesis and difficult prime factorisation, and then proven RSA secure under these assumptions. My point is that these assumptions are much better understood and more likely to be true than just any old "but X isn't broken yet" claim.
Nov
24
comment Writing my own encryption algorithm
@mbrt: No, my point was that RSA's strength relies on factorization not being broken yet, which is a far stronger claim than "X not being broken yet" for any new cipher X, because factorization is much better understood than X. As I said in my comment, there are assumptions involved, but those assumptions can be spelled out and quantified and are much stronger than just "no-one has broken mbrt's cipher #7 yet".
Nov
24
comment Writing my own encryption algorithm
@Mehrdad -- cryptographers do have reason to believe that RSA is secure other than just "it is not broken yet". By studying the underlying mathematics they can prove that breaking RSA is very difficult. There are assumptions involved (such as that prime factorisation is slow), but those assumptions can be spelled out and quantified and are much stronger than just "no-one has found a hack yet". A good introductory mathematical crypto book should explain this in detail, or try searching for e.g. "why RSA is secure".
Mar
30
awarded  Supporter