#8469: add "Number Theory and the RSA Public Key Cryptosystem" to "Thematic
Tutorials"
-------------------------------+--------------------------------------------
Reporter: mvngu | Owner: mvngu
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.4.2
Component: documentation | Keywords: RSA, public-key cryptosystem
Author: Minh Van Nguyen | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
-------------------------------+--------------------------------------------
Comment(by pang):
Two comments:
* In this tutorial, euler_phi(n) is called several times. The whole
security of RSA lies in the fact that euler_phi takes a long time if you
don't know the factorization. I'd suggest using a variable:
{{{
phi = (p-1)*(q-1)
}}}
When I've taught about RSA, I've used big primes:
{{{
p = next_prime(randint(10^100,10^101))
q = next_prime(randint(10^100,10^101))
}}}
and euler_phi would take for ever, of course. If this is reasonable to
you, I'll be glad to write a patch, of course.
* A missing space was generating a minor problem with latex. I attach a
patch only for that, waiting for your opinions on the first item.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/8469#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
