Difficult:
How do we get x and y when using RSA for verification (6.6)? Are those arbitrary or are they calculated from the givens? In other encryption algorythms besides the ones discussed in the reading, is there always a trap door? I'm still confused on what a discreet log is and how it's related to mods.
Reflection:
It's neat to see an aspect of mathematics that is still improving and changing, such as methods to factor large primes. I have often thought of math as something static and unchanging. 2+2 is always going to equal 4. But things are continuing to evolve helping us solve more problems!
How do we get x and y when using RSA for verification (6.6)? Are those arbitrary or are they calculated from the givens? In other encryption algorythms besides the ones discussed in the reading, is there always a trap door? I'm still confused on what a discreet log is and how it's related to mods.
Reflection:
It's neat to see an aspect of mathematics that is still improving and changing, such as methods to factor large primes. I have often thought of math as something static and unchanging. 2+2 is always going to equal 4. But things are continuing to evolve helping us solve more problems!
No comments:
Post a Comment