Bilal Habib
Contact
3100 Engineering Building George Mason University ECE Department, CERG 4400 University Drive, MS 1G5 Fairfax, VA 22030 |
Office: Engineering Building, Room 3231 Phone (lab): 703-993-1609 E-Mail: bhabib'at'masonlive.gmu.edu Curriculum Vitae: PDF Webpage: http://mason.gmu.edu/~bhabib/ |
Research Interest
- Physical Unclonable Functions
- Hardware Security
- Embedded Systems
- Efficient Design & Implementation of Low Area Cryptographic Hash Algorithms
- Design & implementation of Low power computer arithmetic
Advisor: Dr. Kris Gaj and Dr. Jens-Peter Kaps
Biography
Bilal graduated from George Mason University with the Ph.D. degree in Electrical and Computer Engineering in Summer 2016. He received his B.S. degree from University of Engineering & Technology, Peshawar in 2005 and MS degree from George Washington University in 2010.
Publications
- B. Habib and K. Gaj, A comprehensive set of schemes for PUF response generation, Microprocessors and Microsystems, volume 51, pages 239-251, June, 2017 [Bibtex]
- B. Habib, J.-P. Kaps, and K. Gaj, Implementation of efficient SR-latch PUF on FPGA and SoC devices, Microprocessors and Microsystems, volume 53, pages 92-105, Aug., 2017 [Bibtex]
- B. Habib and K. Gaj, A comprehensive set of schemes for PUF response generation, Applied Reconfigurable Computing, Lecture Notes in Computer Science, volume 9625, Springer International Publishing, pages 183194, March, 2016 [Bibtex]
- B. Habib, K. Gaj, and J.-P. Kaps, Efficient SR-latch PUF, Applied Reconfigurable Computing, 11th International Symposium, ARC 2015, LNCS, volume 9040, Springer, pages 205216, Apr., 2015 [accepted version, pdf] [Bibtex]
- B. Habib, K. Gaj, and J.-P. Kaps, FPGA PUF based on programmable LUT delays, 2013 Euromicro Conference on Digital System Design (DSD), pages 697704, 2013 [accepted version, pdf] [Bibtex]
- J.-P. Kaps, P. Yalla, K.K. Surapathi, B. Habib, S. Vadlamudi, S. Gurung, and J. Pham, Lightweight implementations of SHA-3 candidates on FPGAs, Progress in Cryptology INDOCRYPT 2011, Lecture Notes in Computer Science (LNCS), volume 7107, Springer Berlin / Heidelberg, pages 270289, Dec, 2011 [pre-print, pdf] [Bibtex]