Quotients of E^n by A_{n+1} and Calabi-Yau manifolds

We give a simple construction, starting with any elliptic curve E, of an n-dimensional Calabi-Yau variety of Kummer type (for any n>1), by considering the quotient Y of the n-fold self-product of E by a natural action of the alternating group A_{n+1} (in n+1 variables). The vanishing of H^m(Y, O_Y) for 0<m<n follows from the non-existence of (non-zero) fixed points in certain representations of A_{n+1}. For n<4 we provide an explicit crepant resolution X in characteristics different from 2,3. The key point is that Y can be realized as a double cover of P^n branched along a hypersurface of degree 2(n+1).Comment: 9 page

Curves on Heisenberg invariant quartic surfaces in projective 3-space

This paper is about the family of smooth quartic surfaces $X \subset \mathbb{P}^3$ that are invariant under the Heisenberg group $H_{2,2}$. For a very general such surface $X$, we show that the Picard number of $X$ is 16 and determine its Picard group. It turns out that the general Heisenberg invariant quartic contains 320 smooth conics and that in the very general case, this collection of conics generates the Picard group.Comment: Updated references, corrected typo

qDSA: Small and Secure Digital Signatures with Curve-based Diffie–Hellman Key Pairs

International audienceqDSA is a high-speed, high-security signature scheme that facilitates implementations with a very small memory footprint, a crucial requirement for embedded systems and IoT devices, and that uses the same public keys as modern Diffie–Hellman schemes based on Montgomery curves (such as Curve25519) or Kummer surfaces. qDSA resembles an adaptation of EdDSA to the world of Kummer varieties, which are quotients of algebraic groups by ±1. Interestingly, qDSA does not require any full group operations or point recovery: all computations , including signature verification, occur on the quotient where there is no group law. We include details on four implementations of qDSA, using Montgomery and fast Kummer surface arithmetic on the 8-bit AVR ATmega and 32-bit ARM Cortex M0 platforms. We find that qDSA significantly outperforms state-of-the-art signature implementations in terms of stack usage and code size. We also include an efficient compression algorithm for points on fast Kummer surfaces, reducing them to the same size as compressed elliptic curve points for the same security level