FINAL YEAR PROJECT'S AND GUIDANCE |
| Curves and Their Applications to Factoring Polynomials Posted: 09 Nov 2009 05:37 PM PST These are new methods for computing square roots and factorization of polynomials over finite fields. We also describe a method for computing in the Jacobian of a singular hyperelliptic curve. There is a compact representation of an element in the Jacobian of a smooth hyperelliptic curve over any field. This compact representation leads an efficient method for computing in Jacobians which is called Cantor's Algorithm. In one part of the dissertation, we show that an extension of this compact representation and Cantor's Algorithm is possible for singular hyperelliptic curves. Author:-Ozdemir, Enver University:- The University of Maryland DIRECT DOWNLOAD 
|
| You are subscribed to email updates from FREE FINAL YEAR PROJECT'S To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google Inc., 20 West Kinzie, Chicago IL USA 60610 | |
0 comments:
Post a Comment
Note: Only a member of this blog may post a comment.