Abstracts

Implementation of Modulo operations needed in contemporary cryptography

P.V.Ananda Mohan Life Fellow IEEE

Formerly with CDAC, Bangalore  as Technology Adviser

Efficient implementation of modulo addition, subtraction and multiplication is needed in most cryptographic systems.  In algorithms like Rivest- Shamir- Adleman (RSA) operands are of the size of 2048 bits  and and for  Elliptic curve cryptography around 160-324bits. Here interest is to design architectures which simplify the hardware as well as reduce the computation time.  On the other hand, there are other post Quantum cryptography algorithms like CRSTALS-KYBER , DILITHIUM  where the modulus bit length ranges from 12 bits  to 23 bits. In some other applications big word length operations are made as small word length operations using a set of moduli. The choice of the moduli set  so as to lead to efficient implementation has been of great interest. The focus in the lecture is on efficient hardware implementations. The ideas of course can be used in software implementations as well.