Name
Abstract | ||
|---|---|---|
We present a cryptography-oriented reconfigurable array called CryptoRA that efficiently supports very long-integer addition and subtraction. We first describe the CryptoRA architecture and show that extending the dedicated carry chains of modern FPGAs over the orthogonal direction, followed by merging two FPGA columns to create computing tiles that support both generate and propagate signals of a carry-lookahead network, provides a reduction in operation latency. Then, we show that splitting a tile's Look-Up Table into two halves provides additional benefits in terms of latency and flexibility in using the dedicated generate and propagate chains. According to our estimations, long-integer addition widely used in cryptography is more than 22% faster on CryptoRA than on Virtex-II Pro FPGA. This improvement has a large positive impact on implementing cryptography applications in embedded environments. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1145/1366110.1366127 | ACM Great Lakes Symposium on VLSI |
Keywords | Field | DocType |
look-up table,cryptora architecture,very-long arithmetic,propagate signal,operation latency,fpga column,long-integer addition,cryptography application,propagate chain,reconfigurable solution,carry-lookahead network,additional benefit,embedded systems,field programmable gate arrays,embedded system,reconfigurable computing,field programmable gate array,cryptography,look up table | Reconfigurable array,Cryptography,Latency (engineering),Computer science,Parallel computing,Field-programmable gate array,Real-time computing,Electronic engineering,Merge (version control),Subtraction,Reconfigurable computing | Conference |
Citations | PageRank | References |
1 | 0.40 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ambrose Chu | 1 | 1 | 1.07 |
| Scott Miller | 2 | 1 | 0.73 |
| Mihai Sima | 3 | 95 | 16.66 |