Method of algorithm building for modular reducing by irreducible polynomial
- 1 October 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1476-1479
Abstract
In modern cryptosystems, there are many well-proven often used constructions, such as operations in binary fields. In this paper method of algorithm construction for modular reduction by fixed irreducible polynomial (trinomial or pentanomial) was proposed. This method applying allows to get a high performance algorithm of modular reduction for specified fixed polynomial and target platform while cryptosystems develop, for example elliptic curve cryptosystem.Keywords
This publication has 2 references indexed in Scilit:
- Modular Reduction in GF(2 n ) without Pre-computational PhaseLecture Notes in Computer Science, 2008
- Generic implementations of elliptic curve cryptography using partial reduction2002