TL;DRAbstract
In this chapter our main topic is modular arithmetic, i.e. how to compute efficiently modulo a given integer N. In most applications, the modulus N is fixed, and special-purpose algorithms benefit from some precomputations, depending only on N, to speed up arithmetic modulo N.
Chat with Paper
AI Agents for this Paper
In this chapter our main topic is modular arithmetic, i.e. how to compute efficiently modulo a given integer N. In most applications, the modulus N is fixed, and special-purpose algorithms benefit from some precomputations, depending only on N, to speed up arithmetic modulo N.
Keywords
ModuloArithmeticModular arithmeticModulo operationFast Fourier transformModular designInteger (computer science)Mathematics
Chat
Click to start Chat