http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Method of Algorithm Building for Modular Reducing by Irreducible Polynomial
Andrew Okhrimenko,Maria Kovtun,Tomasz Gancarczyk,Volodymyr Karpinskyi,Sergiy Gnatyuk 제어로봇시스템학회 2016 제어로봇시스템학회 국제학술대회 논문집 Vol.2016 No.10
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.