Title: A New Fast Large-number Modular Multiplication Algorithm Based on Addition
Abstract: Researched on several recently widely used modular multiplication algorithms,adopted the ideal of window division,estimating quotient,and modular 2n easy to be calculated,which is used in Montgomery modular multiplication algorithm,a new fast calculating AB mod N algorithm based on addition is presented,which introduces pre-calculating by modular N.When the length of modular N is 1 024-bit and the length of window is 6,on the average,the new algorithm requires only 693 times 1 024-bit addition to calculate AB mod N.Comparing with current additional modular multiplication algorithm,the computing complexity is reduced largely.
Publication Year: 2007
Publication Date: 2007-01-01
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot