On the design of modulo 2n±1 adders

被引：0

作者：

Efstathiou, C ^{[1
]}

Vergos, HT ^{[1
]}

Nikolos, D ^{[1
]}

机构：

[1] TEI Athens, Dept Informat, Athens 12210, Greece

来源：

ICECS 2001: 8TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS AND SYSTEMS, VOLS I-III, CONFERENCE PROCEEDINGS | 2001年

关键词：

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In this paper we present new architectures for the design of modulo 2(n)+/-1 adders, which are based on the use of the same design block. Our design block incorporates a parallel-prefix carry computation unit with a carry increment stage. VLSI implementations of the proposed architectures in a static CMOS technology reveal their superiority against all already known architectures when the area * time(2) product is used as a metric and n > 8.

引用

页码：517 / 520

页数：4

共 50 条

[31] Fast modulo 2n+1 multi-operand adders and residue generators
Vergos, H. T.
Bakalis, D.
Efstathiou, C.
INTEGRATION-THE VLSI JOURNAL, 2010, 43 (01) : 42 - 48
[32] Influence of addition modulo 2n on algebraic attacks
Oleksandr Kazymyrov
Roman Oliynykov
Håvard Raddum
Cryptography and Communications, 2016, 8 : 277 - 289
[33] Simulation and microcontroller implementation of an integrated modulo (2n ± 1) residue adder
Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata -700032, India
Adv. Modell. Anal. A, 2007, 1-2 (35-46): : 35 - 46
[34] Improved modulo-( 2n ± 3) multipliers
Ahmadifar, H.
Jaberipur, G.
2013 17TH CSI INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND DIGITAL SYSTEMS (CADS 2013), 2013, : 31 - 35
[35] A new formulation of fast diminishedone multioperand modulo 2n + 1 adder
Cao, B. (caobin@pmail.ntu.edu.sg), Circuits and Systems Society, IEEE CASS; Science Council of Japan; The Inst. of Electronics, Inf. and Communication Engineers, IEICE; The Institute of Electrical and Electronics Engineers, Inc., IEEE (Institute of Electrical and Electronics Engineers Inc.):
[36] On the best linear approximation of addition modulo 2n
Xue, Shuai
Qi, Wen-Feng
Yang, Xiao-Yuan
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2017, 9 (05): : 563 - 580
[37] High -Performance Multiplication Modulo 2n - 3
Seidel, Peter-Michael
2018 CONFERENCE RECORD OF 52ND ASILOMAR CONFERENCE ON SIGNALS, SYSTEMS, AND COMPUTERS, 2018, : 130 - 134
[38] On the best linear approximation of addition modulo 2n
Shuai Xue
Wen-Feng Qi
Xiao-Yuan Yang
Cryptography and Communications, 2017, 9 : 563 - 580
[39] On Modulo 2n+1 Adder Design
Vergos, Haridimos T.
Dimitrakopoulos, Giorgos
IEEE TRANSACTIONS ON COMPUTERS, 2012, 61 (02) : 173 - 186
[40] Influence of addition modulo 2n on algebraic attacks
Kazymyrov, Oleksandr
Oliynykov, Roman
Raddum, Havard
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2016, 8 (02): : 277 - 289

← 1 2 3 4 5 →