Apr 19
Work through RSA implementation: big picture, and all the details.
RSA :
Finding d such that e*d = 1 mod (p-1)(q-1)
I spent too much time on the attached code ... which
still doesn't quite work. Hit lots of issues with
quiet overflows. Moral: do this with a bigint library,
or use very small numbers.
The last bit that isn't working is getting the bytes
from strings to integers and back consistently.
Discuss homework; perhaps write some python to do a version of this
if other folks don't have working code.
![[paper clip]](/courses/source/wiki_images/paper_clip_tilt.png)
name last modified size
