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

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

From the reviews:

"The booklet includes 39 articles approximately computational algebraic quantity idea, mathematics geometry and cryptography. … The articles during this e-book mirror the vast curiosity of the organizing committee and the members. The emphasis lies at the mathematical idea in addition to on computational effects. we advise the booklet 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 Online or Download Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings PDF

Best international_1 books

Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 – July 2, 2008. Revised Papers

This ebook constitutes the completely refereed post-conference lawsuits of the thirty fourth foreign Workshop on Graph-Theoretic strategies in machine technology, WG 2008, held in Durham, united kingdom, in June/July 2008. The 30 revised complete papers awarded including three invited paper have been conscientiously reviewed and chosen from seventy six submissions.

InCIEC 2013: Proceedings of the International Civil and Infrastructure Engineering Conference 2013

The specific concentration of this continuing is to hide the parts of infrastructure engineering and sustainability administration. The state-of-the artwork info in infrastructure and sustainable concerns in engineering covers earthquake, bioremediation, synergistic administration, bushes engineering, flood administration and clever delivery structures.

The Cuban Embargo under International Law: El Bloqueo (Routledge Research in International Law)

The U.S. embargo opposed to Cuba was once imposed over fifty years in the past at first as a reaction to the recent progressive government's seizure people houses, which used to be considered through the united states as a contravention of foreign legislations. notwithstanding, whereas sanctions could be valid technique of imposing validated norms, the Cuban embargo itself seems to be the wrongful act, and its patience calls into query the significance and serve as of overseas legislation.

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

Example text

Moreover, since there is no non-generic algorithm for computing discrete logarithms on elliptic curves, it is possible to reach a high security level while using relatively short keys. However, in [27] Menezes, Okamoto and Vanstone showed that some special elliptic curves, called supersingular curves, are weaker than general elliptic curves. On these special curves, some additional properties allow an attacker to transport the discrete logarithm problem to a finite field where more efficient algorithms are available for discrete logarithm computation.

This idea of Hierarchical IBE is examined in [19] and a partial solution is proposed that works when collusion between the sub-authorities to break the scheme is limited. Remark: In identity based encryption, the key generation authority implicitly get the capability of an escrow agent. This shows that escrowed encryption protocols arise quite naturally when using pairings. This capability of pairing based cryptography was first described in [38]. Pairings and signatures. While identity based signatures and identification protocols do not require the use of pairings, they can also be implemented by using pairings (see [8,18,31]).

27. A. Menezes, T. Okamoto, and S. Vanstone. Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transaction on Information Theory, 39:1639– 1646, 1993. 28. V. Miller. Short programs for functions on curves. Unpublished manuscript, 1986. 29. V. Miller. Use of elliptic curves in cryptography. In H. Williams, editor, Advances in Cryptology — CRYPTO’85, volume 218 of Lecture Notes in Comput. , pages 417–428. Springer, 1986. 30. T. Okamoto and D. Pointcheval. The gap problems: a new class of problems for the security of cryptographic primitives.

Download PDF sample

Rated 4.01 of 5 – based on 5 votes