Design of Montgomery multiplication architecture based on programmable cellular automata

被引：11

作者：

Jeon, JC ^{[1
]}

Yoo, KY ^{[1
]}

机构：

[1] Kyungpook Natl Univ, Dept Comp Engn, Taegu 702701, South Korea

来源：

COMPUTATIONAL INTELLIGENCE | 2004年 / 20卷 / 03期

关键词：

multiplication; irreducible all one polynomial; programmable cellular automata; public-key cryptosystem;

D O I：

10.1111/j.0824-7935.2004.00248.x

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This study presents a Montgomery multiplication architecture that uses an irreducible all one polynomial (AOP) in GF(2(m)) based on a programmable cellular automata (PCA). The proposed architecture has the advantage of high regularity and a reduced latency based on combining the characteristics of the irreducible AOP and PCA. The proposed architecture can be used to implement modular exponentiation, division, and inversion architectures.

引用

页码：495 / 502

页数：8

共 50 条

[21] Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
Chen, Donald Donglong
Yao, Gavin Xiaoxu
Cheung, Ray C. C.
Pao, Derek
Koc, Cetin Kaya
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (01) : 147 - 160
[22] An efficient CSA architecture for montgomery modular multiplication
Zhang, Yuan-Yang
Li, Zheng
Yang, Lei
Zhang, Shao-Wu
[J]. MICROPROCESSORS AND MICROSYSTEMS, 2007, 31 (07) : 456 - 459
[23] A Prediction-Based Scalable Design for Montgomery Modular Multiplication
Chen, De-Sheng
Li, Huan-Teng
Wang, Yi-Wen
[J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON ELECTRIC AND ELECTRONICS, 2013, : 46 - 50
[24] Efficient Design of Elliptic Curve Point Multiplication based on Fast Montgomery Modular Multiplication
Mohammadi, Maryam
Molahosseini, Amir Sabbagh
[J]. PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON COMPUTER AND KNOWLEDGE ENGINEERING (ICCKE 2013), 2013, : 424 - 429
[25] Automated Design Architecture for 1-D Cellular Automata Using Quantum Cellular Automata
Mardiris, Vassilios A.
Sirakoulis, Georgios Ch.
Karafyllidis, Ioannis G.
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2015, 64 (09) : 2476 - 2489
[26] Cellular Automata as a learning process in Architecture and Urban design
Jensen, Mads Brath
Foged, Isak Worre
[J]. FUSION: DATA INTEGRATION AT ITS BEST, VOL 1, 2014, : 297 - 302
[27] A new RSA encryption architecture and hardware implementation based on optimized Montgomery multiplication
Fournaris, AP
Koufopavlou, O
[J]. 2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS, 2005, : 4645 - 4648
[28] Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
Dai, Wangchen
Chen, Donald Donglong
Cheung, Ray C. C.
Koc, Cetin Kaya
[J]. IEEE TRANSACTIONS ON COMPUTERS, 2017, 66 (03) : 375 - 388
[29] Encryption Algorithm for Block Ciphers Based on Programmable Cellular Automata
Ray, Abhishek
Das, Debasis
[J]. INFORMATION PROCESSING AND MANAGEMENT, 2010, 70 : 269 - 275
[30] Secure Systolic Architecture for Montgomery Modular Multiplication Algorithm
Yang, Qi
Hu, Xiaoting
Qin, Zhongping
[J]. 2013 IEEE 10TH INTERNATIONAL CONFERENCE ON ASIC (ASICON), 2013,

← 1 2 3 4 5 →