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.
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...
If L/K is a finite Galois extension of local fields, then we say that the valuation criterion VC(L/K) holds if there is an integer d such that every element x is an element of L with valuation d generates a normal basis for L/K. Answering a question of Byo ...
In this article we prove that there exists a Dixmier map for nilpotent super Lie algebras. In other words, if we denote by Prim(U(g)) the set of (graded) primitive ideals of the enveloping algebra U(g) of a nilpotent Lie superalgebra g and Ad0 the adjoint ...
We use Masser's counting theorem to prove a lower bound for the canonical height in powers of elliptic curves. We also prove the Galois case of the elliptic Lehmer problem, combining Kummer theory and Masser's result with bounds on the rank and torsion of ...
We investigate the effect of H adsorption on the magnetic properties of individual Co atoms on Pt(111) with scanning tunneling microscopy. For pristine Co atoms, we detect no inelastic features in the tunnel spectra. Conversely, CoH and CoH2 show a number ...
We describe a cell processor implementation of Pollard’s rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in deta ...
Elliptic curve cryptosystems (ECCs) are utilised as an alternative to traditional public-key cryptosystems, and are more suitable for resource-limited environments because of smaller parameter size. In this study, the authors carry out a thorough investiga ...
Zerfo field splitting plays an important role in determining the electron spin relaxation of Gd(III) in solution. We understand the ZFS as an effect depending on the f electron structure and treat it in the framework of ligand field-density functional theo ...
We present an algorithm for generating all polynomial invariants of P-solvable loops with assignments and nested conditionals. We prove termination of our algorithm. The proof relies on showing that the dimensions of the prime ideals from the minimal decom ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010
We prove new equidistribution results for Galois orbits of Heegner points with respect to single reduction maps at inert primes. The arguments are based on two different techniques: primitive representations of integers by quadratic forms and distribution ...