Determining environmentally-and economically-optimal energy systems designs and
operations is complex. In particular, the integration of weather-dependent renewable energy …

The advent of quantum computing threatens to break many classical cryptographic
schemes, leading to innovations in public key cryptography that focus on post-quantum …

We present an algorithm that computes the product of two n-bit integers in O(nlog\,n) bit
operations, thus confirming a conjecture of Schönhage and Strassen from 1971. Our …

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a
modern and active area of computer science. Every computer scientist and every …

Polynomial multiplication algorithms such as Toom-Cook and the Number Theoretic
Transform are fundamental building blocks for lattice-based post-quantum cryptography. In …

Poincaré's program for the global analysis of a dynamical system starts by considering
simple solutions, such as equilibria and periodic orbits, together with their corresponding …

Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently
performing arithmetic operations such as addition, multiplication and division, and their …

The design of algorithms and hardware implementation for signal processing systems has
received considerable attention over the last few decades. The primary area of application …

Mix-nets are used in e-voting schemes and other applications that require anonymity.
Shuffles of homomorphic encryptions are often used in the construction of mix-nets. A shuffle …

For more than 35 years, the fastest known method for integer multiplication has been the
Schönhage-Strassen algorithm running in time O (n log n log log n). Under certain restrictive …