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.
Let X be a finite set and let k be a commutative ring. We consider the k-algebra of the monoid of all relations on X, modulo the ideal generated by the relations factorizing through a set of cardinality strictly smaller than Card(X), called inessential rel ...
This paper describes carry-less arithmetic operations modulo an integer 2^M − 1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implemen ...
The calculation of the inverse scalelengths R/LT, R/Ln may depend on the choice of the radial variable, depending on the definition of the scalelength. The value of λT and λn, as defined in [O. Sauter {\it et al}, Phys. Plasmas {\bf ...
We examine how, in prime characteristic p, the group of endotrivial modules of a finite group G and the group of endotrivial modules of a quotient of G modulo a normal subgroup of order prime to p are related. There is always an inflation map, but examples ...
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 ...
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is such that modular reduction is extremely efficient, thus making them an attrac ...
In this paper we present a new multiplication algorithm for residues modulo the Mersenne prime 2521−1. Using this approach, on an Intel Haswell Core i7-4770, constant-time variable-base scalar multiplication on NIST’s (and SECG’s) curve P-521 requires ...
We show that, in a restricted range, the divisor function of integers in residue classes modulo a prime follows a Gaussian distribution, and a similar result for Hecke eigenvalues of classical holomorphic cusp forms. Furthermore, we obtain the joint distri ...
This paper describes carry-less arithmetic operations modulo an integer 2^M-1 in the thousand-bit range, targeted at single instruction multiple data platforms and applications where overall throughput is the main performance criterion. Using an implementa ...
The progress made in understanding spontaneous toroidal rotation reversals in tokamaks is reviewed and current ideas to solve this ten-year-old puzzle are explored. The paper includes a summarial synthesis of the experimental observations in AUG, C-Mod, KS ...