Sciweavers

138 search results - page 9 / 28
» Very Compact FPGA Implementation of the AES Algorithm
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
13 years 11 months ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
CHES
2007
Springer
126views Cryptology» more  CHES 2007»
14 years 1 months ago
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
This paper describes a modular exponentiation processing method and circuit architecture that can exhibit the maximum performance of FPGA resources. The modular exponentiation arch...
Daisuke Suzuki
DAC
1995
ACM
13 years 11 months ago
A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
Ted Stanion, Carl Sechen
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 7 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 19 days ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak