Name
Abstract | ||
|---|---|---|
The new modular multiplier structures proposed in this paper are based on a short precision magnitude comparison instead of the full magnitude comparison operation. Another feature of these structures is that the comparison operations are carried out first. Only once this has been achieved that the reduction operation takes place, while in previous work both the comparison and the reduction operations are interleaved. This has resulted in a reduction of the number of stages required for the implementation of the modular reduction operation. Serial implementations have shown that the new radix-2 algorithm has a better area usage than similar structures available in the literature while the proposed radix-4 algorithm exhibits better area usage than similar structures with relatively similar speed performances. The parallel implementation of these algorithms has also shown that the new radix-4 algorithm has the best area usage while its speed performances are similar to that of structures proposed in the literature. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.sigpro.2004.07.001 | Signal Processing |
Keywords | Field | DocType |
Modular multiplication,Cryptography,Serial-parallel systems,Computer arithmetic | Modular arithmetic,Computer science,Iterative method,Cryptography,Parallel computing,Algorithm,Implementation,Multiplier (economics),Multiplication,Modular design | Journal |
Volume | Issue | ISSN |
84 | 10 | 0165-1684 |
Citations | PageRank | References |
1 | 0.36 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Omar Nibouche | 1 | 89 | 13.50 |
| Mokhtar Nibouche | 2 | 50 | 11.87 |
| Ahmed Bouridane | 3 | 837 | 99.53 |