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 条

[1] Design of Montgomery multiplication architecture based on programmable cellular automata
Jeon, JC
Park, HY
Yoo, KY
CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 1676 - 1679
[2] An efficient multiplication architecture using Montgomery algorithm based on programmable cellular automata
Park, HY
Jeon, JC
Oh, JB
Yoo, KY
COMPUTER APPLICATIONS IN INDUSTRY AND ENGINEERING, 2003, : 87 - 90
[3] Montgomery exponent architecture based on programmable cellular automata
Jeon, Jun-Cheol
Yoo, Kee-Young
MATHEMATICS AND COMPUTERS IN SIMULATION, 2008, 79 (04) : 1189 - 1196
[4] Programmable cellular automata based Montgomery hardware architecture
Jeon, Jun-Cheol
Yoo, Kee-Young
APPLIED MATHEMATICS AND COMPUTATION, 2007, 186 (01) : 915 - 922
[5] Design of Programmable Cellular Automata Based Cipher Scheme
Anghelescu, Petre
Ionita, Silviu
Bostan, Ionel
2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009), 2009, : 187 - 192
[6] New parallel architecture for modular multiplication and squaring based on cellular automata
Ku, KM
Ha, KJ
Kim, HS
Yoo, KY
APPLIED PARALLEL COMPUTING: ADVANCED SCIENTIFIC COMPUTING, 2002, 2367 : 359 - 369
[7] Parallel montgomery multiplication and squaring over GF(2m) based on cellular automata
Ku, Kyo Min
Ha, Kyeoung Ju
Yoo, Wi Hyun
Yoo, Kee Young
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2004, 3046 LNCS (PART 4): : 196 - 205
[8] Parallel Montgomery multiplication and squaring over GF(2m) based on cellular automata
Ku, KM
Ha, KJ
Yoo, WH
Koo, KY
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2004, PT 4, 2004, 3046 : 196 - 205
[9] A RNS Montgomery Multiplication Architecture
Schinianakis, Dimitris
Stouraitis, Thanos
2011 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), 2011, : 1167 - 1170
[10] A scalable architecture for Montgomery multiplication
Tenca, AF
Koç, ÇK
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS, 1999, 1717 : 94 - 108

← 1 2 3 4 5 →