2007•Computer Engineering and Applications JournalRequires access

Macroscopy addition and modular algorithm speed up digital signature

Yiqun Chen

Abstract

This paper presents a new algorithm to realize modular exponentiation multiplication by converting multiplication and modular operation into the simple shift and addition operation,thus avoiding modular operation on large number.Experiment shows that our algorithm speeds up the modular exponentiation multiplication remarkably:it realize A×B mod N in n/2 times n-bit addition operation.It's time cost for C=me is a half of the Montgomery algorithm.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Modular exponentiation, Modular design, Modular arithmetic, Multiplication (music), Digital Signature Algorithm, Computer science, Multiplication algorithm, Signature (topology)