Waseem Aslam

Waseem Aslam


Faculty of Information Technology.

Courses already taught

  • Computer Architecture
  • Digital Logic and Design
  • Computer Organization and Assembly Language
  • Basic Electronics
  • Operating System

Courses currently teaching

  • Computer Organization and Assembly Language


August 2014– Lecturer, Faculity of Information Technology, University of Central Punjab, Lahore. Present Teaching courses Computer Architecture and Network security
Feb 2013– Teaching Assistant, School of Electrical Engineering and Computer june 2013 Science, NUST, Islamabad.
Taught most of the lectures in the course Cryptography and Security Mechani.
Oct 2012– Research Assistant, Center of Excellence in FPGA and ASIC Research, March 2013 NUST, Islamabad.
Worked on HEC funded project Secure Dial in which my contribution is Serial communication between modem and FPGA using UART.


2011–2014 MS in Computer and Communication Security, National University of Science and Technology, Islamabad, GPA – 3.25/4.

  • Specialization in Information Security

2008–2010 Masters of Science in Electronics, Quaid-i-Azam University, Islamabad, Percentage – 62.5.

  • Specialization in Electronics


Title 1.Web of Trust Based Relationship Establishment in Online Social Networks Authorsors Dr.Zahid Anwar & Umara Noor & Yasir Mehmood & Waseem Aslam
Description We use OpenPGP digital certificates for authention of user accounts to avoid the fake friend request and accounts clone on social Networks
Title 2. On Fast Implementation of Eta-T pairing On FPGAs (Submitted)
Authors Waseem Aslam & Dr.Nazar Abbas Saqib
Description In this paper we computed pairing (key sharing protocol) parallel as well as we also prove the impact on calculation time by increasing number of coefficients processed per cycle by the multiplier

Master’s Thesis

Title: Key sharing protocol by using Elliptic Curve Cryptography on FPGAs
Advisor: Dr.Nazar Abbas Saqib
Description: We used parallel Karatsuba multiplier and reduction algorithm to optimize Eta-T pairing algorithm and we also proved at which specific value of D, calculation time starts increasing. In the end we compared our implementation results with previous research on Virtex-II


  • Cryptanalysis of Vigenere cipher and pin-wheel machine cipher (C++) { AES 256 bit Encryption (Verilog)
  • Digital stop watch (Verilog)
  • Particle pojectile motion to hit the target (C++) { ETA- T Pairing (Verilog)
  • Traffic light controller


Network Network security workshop in which I use Packet Tracer and GNS3 to configure ACL, Security VLAN, VPN, and FIREWAL

Technical skills

Programming  Verilog, VHDL, C/C++, Maple, Matlab,  Assembely Language
Tools Xilinx, Matlab, LATEX, Wireshark, NMap, X86 OllyDbg, Kiel, Linux[Ubuntu]

Major Courses

MS Computer and Communication Security

  • { Secure Communication and System De-sign
  • { Computer Security
  • { Cryptography and Security Mechanism
  • { Data Communication Networks and Se-curity
  • { Information and Coding Theory { Trusted Computing

M.Sc Electronics

  • { Digital Logic Design
  • { Digital Design Using Verilog HDL
  • { Microcontroller Based System Design
  • { Computer architecture
  • { Digital Communication Systems
  • { Computer Networks
  • { Computer Programming C/C++
  • { Digital Signal Processing


1:  WOTFace: Web of Trust Based Relationship Establishment in Online Social Networks
2: Thesis Work(Elliptic Curve Cryptography)
My MS thesis  is “On Fast Implementation of Eta-T pairing Algorithm on FPGA”  I choose Elliptic Curve Cryptography as my research topic because it gives more security as compared to symmetric key ciphers like (DES, AES) and the discrete logarithmic problem is very difficult on Elliptic Curves. I had implemented Eta T pairing algorithm (a key sharing protocol between three users by using Elliptic curves and bilinearity properties) on FPGA and optimize the algorithm to speed up the key sharing protocol and the whole system. I also love to analyze the LFSR based systems and want to know how input maps to output and how the system is vulnerable to some attacks and how we go back to the initial input.


  • { Cryptography
  • { Hardware Security
  • { Algorithm Optimization
  • { Formal Verification

Faculty of Information Technology, University of Central Punjab