tag:blogger.com,1999:blog-1492032797816588166.post3719743244449956941..comments2023-12-02T02:36:04.776-06:00Comments on Juan Carlos Espinosa Ceniceros: [SC] 5. RSA AuthenticationJuan Carlos Espinosa Ceniceroshttp://www.blogger.com/profile/10122977539877115129noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-1492032797816588166.post-86390566317629438042013-07-11T19:48:32.466-05:002013-07-11T19:48:32.466-05:00very well !
it's nice with python , Thanks al...very well !<br /><br />it's nice with python , Thanks alot ><br /><br />زائرhttps://www.blogger.com/profile/04739827920957662254noreply@blogger.comtag:blogger.com,1999:blog-1492032797816588166.post-19191176747155961002012-09-13T10:42:04.139-05:002012-09-13T10:42:04.139-05:00"a is the result of GCD(a,b)"... That pa..."a is the result of GCD(a,b)"... That part doesn't make much sense and will cost you a point for sloppiness. You could also make your modular exponentiation more efficient. 6 pts.Elisahttps://www.blogger.com/profile/18352845640659510670noreply@blogger.com