Algorithmic Number Theory: 5th International Symposium, by Manjul Bhargava (auth.), Claus Fieker, David R. Kohel (eds.) PDF

By Manjul Bhargava (auth.), Claus Fieker, David R. Kohel (eds.)

ISBN-10: 3540438637

ISBN-13: 9783540438632

ISBN-10: 3540454551

ISBN-13: 9783540454557

From the reviews:

"The e-book comprises 39 articles approximately computational algebraic quantity conception, mathematics geometry and cryptography. … The articles during this ebook mirror the wide curiosity of the organizing committee and the individuals. The emphasis lies at the mathematical conception in addition to on computational effects. we suggest the e-book to scholars and researchers who are looking to examine present learn in quantity thought and mathematics geometry and its applications." (R. Carls, Nieuw Archief voor Wiskunde, Vol. 6 (3), 2005)

Show description

Read or Download Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings PDF

Similar international_1 books

Download e-book for kindle: Advances in Cryptology - ASIACRYPT 2013: 19th International by Gaëtan Leurent, Thomas Peyrin, Lei Wang (auth.), Kazue Sako,

The two-volume set LNCS 8269 and 8270 constitutes the refereed court cases of the nineteenth overseas convention at the thought and alertness of Cryptology and data, Asiacrypt 2013, held in Bengaluru, India, in December 2013. The fifty four revised complete papers offered have been rigorously chosen from 269 submissions.

Modeling, Simulation and Optimization of Complex Processes - by Hans Georg Bock, Xuan Phu Hoang, Rolf Rannacher, Johannes P. PDF

This lawsuits quantity gathers a variety of papers provided on the 5th foreign convention on excessive functionality clinical Computing, which happened in Hanoi on March 5-9, 2012. The convention used to be equipped through the Institute of arithmetic of the Vietnam Academy of technology and know-how (VAST), the Interdisciplinary middle for medical Computing (IWR) of Heidelberg collage, Ho Chi Minh urban college of expertise, and the Vietnam Institute for complex research in arithmetic.

Extra info for Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings

Sample text

One of its main drawback is the fact that in some cases it does not reach the optimal value for r defined above. On the other hand, the Tate pairing always reaches this optimal value. For this reason, Frey, M¨ uller and R¨ uck proposed in [15] to use it as a replacement for the Weil pairing. Moreover, it is somewhat less costly from a computational point of view (see [3,17]). In cryptographic applications, the terms of Weil and Tate pairings are also used, somewhat abusively, to denote various modified pairings based upon the original ones.

P ≡ 3[4] p+1 2 p ≡ 2[3] p+1 2 p ≡ 2[3] p2 − p + 1 3 n ≡ ±1[12] 3n + 3 n+1 2 +1 6 n ≡ ±5[12] 3n − 3 n+1 2 +1 6 n ≡ ±1[12] 3n − 3 n+1 2 +1 6 n ≡ ±5[12] 3n + 3 n+1 2 +1 6 Fig. 1. Some supersingular curves and their distorsions Another approach is to use non-supersingular curves. In that case, the pairings are still defined, however, in general, the security parameter r is so large that computations in Fqr cannot be performed. Yet, using complex multiplication techniques, it is possible to construct curves with reasonably small values of r.

1, 249–253.

Download PDF sample

Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings by Manjul Bhargava (auth.), Claus Fieker, David R. Kohel (eds.)


by Steven
4.3

Rated 4.20 of 5 – based on 32 votes