ANTS-8 Poster Abstracts [2] J. Silverman, J. Suzuki, Elliptic curve discrete logarithms and the index calculus, Ad- vances in CryptologyASIACRYPT98, Beijing, October 1998, ed. by K. Ohta and D. Pei, Lecture Notes in Computer Science 1514, Springer-Verlag, Berlin, 1998, 110125 [3] http://www.certicom.com/index.php?action=company,press archive&view=307 [4] http://www.certicom.com/index.php?action=ecc,ecc challenge [5] N.Koblitz.CMcurves with good cryptographic properties, Proc. Crypto 91, Springer-Verlag (1992) pp. 279 287 [6] P.C. van Oorschot, M.J. Wiener, Parallel collision search with cryptanalytic appli- cations, Journal of Cryptology, vol 12, num 1, pp 1-28, Winter 1999, Springer-Verlag. [7] M. J. Wiener and R. Zuccherato, Faster Attacks on Elliptic Curve Cryptosystems, Selected Areas of Cryptography, Springer, LNCS 1556, pp. 190200, 1999. [8] http://cristal.inria.fr/ harley/ecdl7/readMe.html [9] http://www.inria.fr/presse/pre67.en.html [10] http://www.certicom.com/index.php?action=ecc,ecc challenge [11] D. Hankerson, A. J. Menezes, and S. Vanstone. Guide to Elliptic Curve Cryptography. SpringerVerlag, 2004. [12] R.Gallant, R.Lambert,and S.Vanstone, Improving the parallelized Pollard lambda search on anomalous binary curves. Math. Comp. 69 (2000), no. 232, 16991705 A Straight Line Program Computing the Integer Greatest Common Divisor Sidi Mohamed Sedjelmaci, Universit´ Paris-Nord, sms@lipn.univ-paris13. e fr While NC algorithms have been discovered for the basic arithmetic operations, the parallel complexity of some fundamental problems as integer gcd is still open, since rst being
End of preview. The entire article is 3 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/a-straight-line-program-computing-the-integer-greatest-common-divisor-WMFlDNJThk
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
A straight line program computing the integer greatest common divisor (abstract only)
Sedjelmaci, Sidi Mohamed
Follow ACM Communications in Computer Algebra
, Volume 42 (1-2)
Association for Computing Machinery – Jul 25, 2008
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
