ECC 2005
Speaker Daniel J. Bernstein Title New Speed Records for Point Multiplication Speaker Claus Diem Title Index Calculus in Class Groups of Plane Curves of Small Degree AbstractWe present a novel index calculus algorithm for the discrete logarithm problem (DLP) in degree 0 class groups of curves over finite fields. A heuristic analysis of our algorithm indicates that asymptotically for varying F_{q} can be solved in an expected time
of Õ^{2 -2/(d-2)})SpeakerSteven Galbraith TitlePairings on Hyperelliptic Curves AbstractI will give a survey of new results relating to pairings on curves in cryptography. In particular, I will discuss some implementation results on supersingular genus 2 curves which lead to cryptographic protocols which are faster than comparable protocols for elliptic curves. Much of this talk will be about joint work with Barreto, O hEigeartaigh and Scott. SpeakerRob Gallant TitleThe Static Diffie-Hellman Problem AbstractIn this talk we describe an algorithm for finding the discrete logarithm of an arbitrary group element SpeakerFlorian Hess TitleArithmetic on General Curves and Applications AbstractThe talk surveys various algorithms for computing in the divisor class groups of general curves and discusses some applications. SpeakerLars R. Knudsen TitleCryptographic Hash Functions - Latest Developments SpeakerPeter Landrock TitlePractical Electronic Voting Schemes AbstractCryptomathic have - together with the research group of Ivan Damgaard at Aarhus University - been working on cost saving and practical yet secure Electronic Voting Schemes since 2001. The presentation will highlight the cryptographic features we have focused on as well as a number of practical challenges. Electronic Voting offers quite intriguing applications of cryptographic techniques, including homomorphic encryption, where elliptic curves are particularly attractive and thus can play a fundamental role in building effective solutions. It is however important to choose the parameters right, as we need to be able to solve the discrete log problem to exploit the homomorphic property! SpeakerKenneth G. Paterson TitleIdentity-Based Cryptography: Panacea or Pandemonium? AbstractIn this talk, we will examine some of the practical key management problems that arise when using public key cryptography. We will then discuss how these problems can be addressed by traditional, certificate-based PKIs, and by identity-based and related infrastructures. Along the way, we'll look at some of the applications that have been proposed for identity-based cryptography. SpeakerChristophe Ritzenthaler Titlep-adic Methods in Cryptography AbstractWe are going to show how p-adic (actually 2-adic) methods can be used to construct cryptosystems based on curves in two ways : by fast point counting in genus 1,2 and 3 or by CM-construction in genus 2. These two different constructions are based on the Arithmetic-Geometric-Mean algorithms. SpeakerTakakazu Satoh TitleOn Interpolation of Inverse Pairing Maps AbstractIf we can construct an efficient algorithm for a group homomorphism from a subgroup of the multiplicative group of a finite field to an elliptic curve (an inverse pairing map), we can conclude that the ECDLP for the curve is not easier than the finite field DLP. However, in EuroCrypt 2001, E. Verheul proved that the existence of such algorithm implies that both DLP and ECDLP are efficiently solved. Since then, it is widely believed that there is no such efficient algorithm. In my talk, I prove some non-vanishing theorems of coefficients in interpolation of an inverse pairing map. SpeakerMartijn Stam TitleCyclotomic Subgroups in Cryptography AbstractIn this talk we will discuss the cryptographic applications of cyclotomic subgroups of finite fields. These subgroups can be regarded as algebraic tori and are the basis of the cryptosystems LUC and XTR. They also appear naturally in pairing-based cryptography, since pairings typically map into the cyclotomic subgroup (and not the full finite field). Recent advances (CEILIDH and beyond) concerning compression of elements in cyclotomic subgroups are also discussed. SpeakerRainer Steinwandt TitleDedicated Hardware to Solve Sparse Systems of Linear Equations: State of the Art & Application to Integer Factoring AbstractThe talk surveys recent hardware designs proposed for solving sparse systems of linear equations as occurring in NFS-based integer factoring. The main focus is on a recent proposal of Geiselmann, Shamir, Tromer and S. Based on current parameter estimates for the NFS, it appears realistic that this design allows to handle the linear algebra step of an NFS-based 1024 bit factorization. For applying the proposed design to sparse systems of linear equations over (small) ground fields different from SpeakerScott Vanstone TitleDeployments of Elliptic Curve Cryptography AbstractECC is being used to secure many applications in wireless communications, classified government communications, digital rights management, digital postal marks, and check clearing. In this talk we will discuss the technical merits and advantages of using ECC in selected applications that are being deployed in Canada and the US. Speaker Andre Weimerskirch TitleEfficient and Secure ECC on Embedded Devices AbstractToday, there are more and more applications planned where security is an enabler, in particular for low-cost 8 or 16-bit micro-controllers in the consumer market. The cryptographic implementation must be efficient and secure without raising the device's cost. It is well known that ECC is a good match for such a scenario. We derive requirements for an ECC implementation running on low-cost devices and show how to combine efficiency with a secure implementations, e.g. to prevent side-channel attacks. Furthermore, we give an overview of performance values. |