Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Modified Montgomery modular multiplication and RSA exponentiation techniques
Modified Montgomery multiplication and associated RSA modular exponentiation algorithms and circuit architectures are presented. These modified multipliers use carry save adders (CSAs) to perform…
A VLSI architecture for variable block size video motion estimation
A new one-dimensional (1-D) very large-scale integration architecture for full-search VBSME (FSVBSME), which can process up to 41 MV sub-blocks (within a macroblock) in the same number of clock cycles.
Fast Montgomery modular multiplication and RSA cryptographic processor architectures
- C. Mclvor, M. McLoone, J. McCanny
- Computer ScienceThe Thrity-Seventh Asilomar Conference on Signals…
- 9 November 2003
New, generic silicon architectures for implementing Montgomery's multiplication algorithm are presented and it is shown that using a four-to-two CSA with two extra registers rather than a five- to- two CSA leads to a useful reduction in the critical path of the multiplier, albeit at the expense of a small increase in circuitry.
High Performance Single-Chip FPGA Rijndael Algorithm Implementations
High performance single-chip FPGA implementations of the new Advanced Encryption Standard (AES) algorithm, Rijndael are described, with a novel, generic, parameterisable RIJndael encryptor core capable of supporting varying key sizes.
Rijndael FPGA implementation utilizing look-up tables
- W. McLoone, J. McCanny
- Computer ScienceIEEE Workshop on Signal Processing Systems. SiPS…
- 26 September 2001
An FPGA Rijndael encryption design is presented, which utilizes look-up tables to implement the entire RIJndael Round function, which achieves a speed of 12 Gbits/sec, which is a factor 1.2 times faster than an alternative design.
High-performance FPGA implementation of DES using a novel method for implementing the key schedule
A generic, parameterisable key scheduling core is presented, which can be utilised in pipelinable private-key encryption algorithms and the broader applicability of the method to other encryption algorithms is illustrated.
A VLSI architecture for advanced video coding motion estimation
This work proposes a new 1-D VLSI architecture for full search variable block size motion estimation (FSVBSME), which can process up to 41 motion vector subblocks (within a macroblock) in a comparable number of clock cycles.
Hardware Elliptic Curve Cryptographic Processor Over$rm GF(p)$
- C. McIvor, M. O'Neill, J. McCanny
- Mathematics, Computer ScienceIEEE Transactions on Circuits and Systems I…
- 18 September 2006
A novel hardware architecture for elliptic curve cryptography (ECC) over GF(p) is introduced, based on a new unified modular inversion algorithm that offers considerable improvement over previous ECC techniques that use Fermat's Little Theorem for this operation.
Efficient single-chip implementation of SHA-384 and SHA-512
A novel highly efficient single-chip hardware design of the SHA-384 and SHA-512 authentication algorithms achieves a throughput of 479 Mbits/sec utilising a shift register design approach and look-up tables (LUTs).
High-radix systolic modular multiplication on reconfigurable hardware
- C. McIvor, M. O'Neill, J. McCanny
- Computer ScienceProceedings. IEEE International Conference on…
- 11 December 2005
Novel high radix systolic array Montgomery multiplier designs are presented, as it is believed that the inherent regular structure and absence of global interconnect associated with these, make them well-suited for implementation on modern FPGAs.