2005
DOI: 10.1007/11545262_6
|View full text |Cite
|
Sign up to set email alerts
|

Energy-Efficient Software Implementation of Long Integer Modular Arithmetic

Abstract: Abstract. This paper investigates performance and energy characteristics of software algorithms for long integer arithmetic. We analyze and compare the number of RISC-like processor instructions (e.g. singleprecision multiplication, addition, load, and store instructions) required for the execution of different algorithms such as Schoolbook multiplication, Karatsuba and Comba multiplication, as well as Montgomery reduction. Our analysis shows that a combination of Karatsuba-Comba multiplication and Montgomery … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
58
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 41 publications
(62 citation statements)
references
References 15 publications
(26 reference statements)
1
58
0
Order By: Relevance
“…A simple and easy-to-implement technique for multi-precision multiplication is the operand scanning method [10], also known as schoolbook method [7]. The operand scanning method, as specified in [7,Algorithm 1], has a characteristic nested-loop structure with an outer loop iterates through the s words b i of the operand B, starting with the least-significant word b 0 .…”
Section: Operand Scanning Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…A simple and easy-to-implement technique for multi-precision multiplication is the operand scanning method [10], also known as schoolbook method [7]. The operand scanning method, as specified in [7,Algorithm 1], has a characteristic nested-loop structure with an outer loop iterates through the s words b i of the operand B, starting with the least-significant word b 0 .…”
Section: Operand Scanning Methodsmentioning
confidence: 99%
“…The operand scanning method, as specified in [7,Algorithm 1], has a characteristic nested-loop structure with an outer loop iterates through the s words b i of the operand B, starting with the least-significant word b 0 . In the inner loop, b i is multiplied with a word a j of operand A and the 2w-bit product is added to the intermediate result obtained so far.…”
Section: Operand Scanning Methodsmentioning
confidence: 99%
See 3 more Smart Citations