Arithmetic and geometric structures in cryptography
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Meeting the requirements of NIST’s new cryptographic standard ‘Suite B Cryptography’ means phasing out usage of 1024-bit RSA and 160-bit Elliptic Curve Cryptography (ECC) by the year 2010. This write-up comments on the vulnerability of these systems to an ...
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common zero of the polynom ...
Let K be a finite extension of Q(p), let L/K be a finite abelian Galois extension of odd degree and let D-L be the valuation ring of L. We define A(L/K) to be the unique fractional D-L-ideal with square equal to the inverse different of L/K. For p an odd p ...
This work deals with the study of projective Mackey functors. Mackey functors are algebraic structures with operations which behave like induction, restriction and conjugation in group representation theory. These objects have properties which generalize m ...
Assume that we have a (compact) Riemann surface S, of genus greater than 2, with S = D/Gamma, where D is the complex unit disc and Gamma is a surface Fuchsian group. Let us further consider that S has an automorphism group G in such a way that the orbifold ...
Adaptive filtering is a topic of immense practical and theoretical value, having applications in areas ranging from digital and wireless communications to biomedical systems. This book enables readers to gain a gradual and solid introduction to the subject ...
We describe Curves+, a new nucleic acid conformational analysis program which is applicable to a wide range of nucleic acid structures, including those with up to four strands and with either canonical or modified bases and backbones. The program is algori ...
In this paper we show that the Ate pairing, originally defined for elliptic curves, generalises to hyperelliptic curves and in fact to arbitrary algebraic curves. It has the following surprising properties: The loop length in Miller’s algorithm can be up t ...
Let p be a prime number, let K be a field of characteristic not p, containing the p-th roots of unity, and let r >= 1 be an integer. We compute the essential dimension of Z/p(r) Z over K (Theorem 4.1). In particular, i) We have edℚ(ℤ/8ℤ)=4, a result which ...
Let K be a field of characteristic different from 2. It is known that a quadratic Pfister form over K is hyperbolic once it is isotropic. It is also known that the dimension of an anisotropic quadratic form over K belonging to a given power of the fundamen ...
