1991
DOI: 10.1109/4.92018
|View full text |Cite
|
Sign up to set email alerts
|

Regular VLSI architectures for multiplication modulo (2/sup n/+1)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
23
0

Year Published

1999
1999
2017
2017

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 53 publications
(23 citation statements)
references
References 4 publications
0
23
0
Order By: Relevance
“…These group components operate on pairs of 16-bit subblocks and mix them. The three algebraic operations are: (i) 16-bit XOR, (ii) modulo addition 2 16 and )iii) modulo multiplication 2 16 [8]. The proposed IDEA architecture is illustrated in detail in the following Figure 2.…”
Section: Bulk Encryption Unitmentioning
confidence: 99%
“…These group components operate on pairs of 16-bit subblocks and mix them. The three algebraic operations are: (i) 16-bit XOR, (ii) modulo addition 2 16 and )iii) modulo multiplication 2 16 [8]. The proposed IDEA architecture is illustrated in detail in the following Figure 2.…”
Section: Bulk Encryption Unitmentioning
confidence: 99%
“…Various multiplication schemes were defined in Curiger et al (1991). Curiger's design used the multiplication scheme with modulo (2 n + 1) adders in which one of the operands (say X) was in diminished-1 representation proposed in Leibowitz (1976) and another operand was in normal weighted form which can be given as: Zimmermann et al (1994), a new approach was taken to avoid high computation time and area.…”
Section: Various Implementations Of Ideamentioning
confidence: 99%
“…There has been a lot of academic activity in researching an optimum implementation of the modulo (2 16 + 1) multiplier [12], [13], [14], but the research has been limited to full-custom design.…”
Section: Modulo (2 16 + 1) Multiplicationmentioning
confidence: 99%