We propose high speed architecture for Keccak using Look-Up Table (LUT) resources on FPGAs, to mi... more We propose high speed architecture for Keccak using Look-Up Table (LUT) resources on FPGAs, to minimize area of Keccak data path and to reduce critical path lengths. This approach allows us to design Keccak data path with minimum resources and higher clock frequencies. We show our results in the form of chip area consumption, throughput and throughput per area. At this time, the design presented in this work is the highest in terms of throughput for any of SHA-3 candidates, achieving a figure of 13.67Gbps for Keccak-256 on Virtex 6. This can enable line rate operation for hashing on 10Gbps network interfaces.
ABSTRACT With growing use of FPGAs it is becoming more and more crucial that how to effectively a... more ABSTRACT With growing use of FPGAs it is becoming more and more crucial that how to effectively and efficiently utilize the in-ternal resources of these devices. Normal coding techniques and synthesis tools implement every logic to a LUT based architecture. Which utilizes more ...
ABSTRACT Cryptographic hash functions are widely used in many information security applications l... more ABSTRACT Cryptographic hash functions are widely used in many information security applications like digital signatures, message authentication codes (MACs), and other forms of authentication. In response to recent advances in cryptanalysis of commonly used hash ...
Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Ke... more Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Key cryptography algorithms. Modular Exponentiation of large numbers requires excessive processing. An efficient implementation of modular exponentiation may help overcome the speed issues of public Key Cryptography. in this work, the most promising technique of Montgomery modular exponentiation and its optimizations have been deeply explored. We have been able to achieve performance results which are better than earlier published results. Full bit length modular exponentiations with different word sizes and radices are implemented and there results are shown.
We propose high speed architecture for Keccak using Look-Up Table (LUT) resources on FPGAs, to mi... more We propose high speed architecture for Keccak using Look-Up Table (LUT) resources on FPGAs, to minimize area of Keccak data path and to reduce critical path lengths. This approach allows us to design Keccak data path with minimum resources and higher clock frequencies. We show our results in the form of chip area consumption, throughput and throughput per area. At this time, the design presented in this work is the highest in terms of throughput for any of SHA-3 candidates, achieving a figure of 13.67Gbps for Keccak-256 on Virtex 6. This can enable line rate operation for hashing on 10Gbps network interfaces.
ABSTRACT With growing use of FPGAs it is becoming more and more crucial that how to effectively a... more ABSTRACT With growing use of FPGAs it is becoming more and more crucial that how to effectively and efficiently utilize the in-ternal resources of these devices. Normal coding techniques and synthesis tools implement every logic to a LUT based architecture. Which utilizes more ...
ABSTRACT Cryptographic hash functions are widely used in many information security applications l... more ABSTRACT Cryptographic hash functions are widely used in many information security applications like digital signatures, message authentication codes (MACs), and other forms of authentication. In response to recent advances in cryptanalysis of commonly used hash ...
Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Ke... more Modular Exponentiation is at the heart of various arithmetic architectures used in most Public Key cryptography algorithms. Modular Exponentiation of large numbers requires excessive processing. An efficient implementation of modular exponentiation may help overcome the speed issues of public Key Cryptography. in this work, the most promising technique of Montgomery modular exponentiation and its optimizations have been deeply explored. We have been able to achieve performance results which are better than earlier published results. Full bit length modular exponentiations with different word sizes and radices are implemented and there results are shown.
Uploads
Papers by Athar Mahboob