YSYasir Ali Shah

Yasir Ali Shah

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Yasir Ali Shah has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Securing the IoT ecosystem: ASIC-based hardware realization of Ascon lightweight cipher

    by Safiullah Khan, Kashif Inayat, Fahad Bin Muslim, Yasir Ali Shah, Muhammad Atif Ur Rehman, Ayesha Khalid, Malik Imran, Akmalbek Abdusalomov

    The Internet of Things (IoT) nodes consist of sensors that collect environmental data and then perform data exchange with surrounding nodes and gateways. Cybersecurity attacks pose a threat to the data security that is being transmitted in any IoT network. Cryptographic primitives are widely adopted to address these threats; however, the substantial computation demands limit their applicability in the IoT ecosystem. In addition, each IoT node varies with respect to the area and throughput (TP) requirements, thus demanding flexible implementation for encryption/decryption processes. To solve these issues, this work implements the NIST lightweight cryptography standard, Ascon, on a SAED 32 nm process design kit (PDK) library by employing loop folded, loop unrolled and fully unrolled architectures. The fully unrolled architecture can achieve the highest TP but at the cost of higher area utilisation. Unrolling by a lower factor results in lower area implementations, enabling the exploration of design space to tackle the trade-off between area and TP performance of the design. The implementation results show that, for loop folded architecture, Ascon-128 and Ascon-128a require 36.7k $$\upmu \textrm{m}^{2}$$ μ m 2 and 38.5k $$\upmu \textrm{m}^{2}$$ μ m 2 chip area, respectively compared to 277.1k $$\upmu \textrm{m}^{2}$$ μ m 2 and 306.6k $$\upmu \textrm{m}^{2}$$ μ m 2 required by their fully unrolled implementations. The proposed implementation strategies can adjust the number of rounds to accommodate the varied requirements of IoT ecosystems. An implementation with an open-source 45 nm PDK library is also undertaken for enhanced generalization and reproducibility of the results.


  • Evaluating NTT/INTT Implementation Styles for Post-Quantum Cryptography

    by Malik Imran, Safiullah Khan, Ayesha Khalid, Ciara Rafferty, Yasir Ali Shah, Samuel Pagliarini, Muhammad Rashid, Máire O’nEill

    Unifying the forward and inverse operations of the number theoretic transform (NTT) into a single hardware module is a common practice when designing polynomial coefficient multiplier accelerators as used in the post-quantum cryptographic algorithms. This work experimentally evaluates that this design unification is not always advantageous. In this context, we present three NTT hardware architectures: (i) A forward NTT (FNTT) architecture, (ii) An inverse NTT (INTT) architecture and (iii) A unified NTT (UNTT) architecture for computing the FNTT and INTT computations on a single design. We benchmark our throughput/area and energy/area evaluations on Xilinx Virtex-7 FPGA and 28nm ASIC platforms. The standalone FNTT and INTT designs, on average on FPGA, exhibit 4.66× and 3.75× higher throughput/area and energy/area values respectively than the UNTT design. Similarly, the individual FNTT and INTT designs, on average on ASIC, achieve 1.25× and 1.09× higher throughput/area and energy/area values respectively, compared to the UNTT design.


  • Open Access

    LUT‐based high‐speed point multiplier for Goldilocks‐Curve448

    by Yasir A. Shah, Khalid Javeed, Muhammad I. Shehzad, Shoaib Azmat

    Recent studies have shown that existing elliptic curve‐based cryptographic standards provide backdoors for manipulation and hence compromise the security. In this regard, two new elliptic curves known as Curve448 and Curve25519 are recently recommended by IETF for transport layer security future generations. Hence, cryptosystems built over these elliptic curves are expected to play a vital role in the near future for secure communications. A high‐speed elliptic curve cryptographic processor (ECCP) for the Curve448 is proposed in this study. The area of the ECCP is optimised by performing different modular operations required for the elliptic curve Diffie–Hellman protocol through a unified architecture. The critical path delay of the proposed ECCP is optimised by adopting the redundant‐signed‐digit technique for arithmetic operations. The segmentation approach is introduced to reduce the required number of clock cycles for the ECCP. The proposed ECCP is developed using look‐up‐tables (LUTs) only, and hence it can be ported to any field‐programmable gate array family or standard ASIC libraries. The authors' ECCP design offers higher speed without any significant area overhead to recent designs reported in the literature.


  • Open Access

    Design and Optimization of Complementary Field Excited Linear Flux Switching Machine With Unequal Primary Tooth Width and Segmented Secondary

    by Noman Ullah, Abdul Basit, Faisal Khan, Yasir Ali Shah, Amir Khan, Osama Waheed, Ali Usman

    Linear flux switching machines (LFSMs) are one of the recently emerging and competitive candidates for long stroke applications due to high thrust force density, low cost and robust secondary, and high reliability. In the past decade, permanent magnet linear flux switching machines (PMLFSMs) with continuous secondary is researched by numerous researchers. However, cost of rare earth permanent magnet and iron material for continuous secondary in case of long stroke application makes PMLFSMs not an economical choice. In order to incorporate advantages of segmented secondary, such as: less use of stator iron, high power factor, and less critical saturation, a novel complementary dual mover field excited linear flux switching machine (FELFSMs) with segmented secondary and parallel magnetic structure is proposed and investigated in this paper. Furthermore, geometry-based deterministic optimization approach based on finite element analysis (FEA) is adopted to uplift overall thrust force profile, reduce secondary iron volume, and balance magnetic circuit of the machine. During optimization process, magnitude difference of flux flow between ac winding tooth and dc winding tooth is observed, that compel designers to go for unequal primary teeth design. Finally, optimal ac and dc current densities of geometrically optimized model and without any cooling arrangements are investigated for maximum average thrust force and minimum thrust force ripple ratio.


  • A high‐speed RSD‐based flexible ECC processor for arbitrary curves over general prime field

    by Yasir Ali Shah, Khalid Javeed, Shoaib Azmat, Xiaojun Wang

    Summary: This workpresents a novel high‐speed redundant‐signed‐digit (RSD)‐based elliptic curve cryptographic (ECC) processor for arbitrary curves over a general prime field. The proposed ECC processor works for any value of the prime number and curve parameters. It is based on a new high speed Montgomery multiplier architecture which uses different parallel computation techniques at both circuit level and architectural level. At the circuit level, RSD and carry save techniques are adopted while pre‐computation logic is incorporated at the architectural level. As a result of these optimization strategies, the proposed Montgomery multiplier offers a significant reduction in computation time over the state‐of‐the‐art. At the system level, to further enhance the overall performance of the proposed ECC processor, Montgomery ladder algorithm with (X,Y)‐only common Z coordinate (co‐Z) arithmetic is adopted. The proposed ECC processor is synthesized and implemented on different Xilinx Virtex (V) FPGA families for field sizes of 256 to 521 bits. On V‐6 platform, it computes a single 256 to 521 bits scalar point multiplication operation in 0.65 to 2.6 ms which is up to 9 times speed‐up over the state‐of‐the‐art.


  • A high speed redundant-signed-digit based montgomery modular multiplier

    by Yasir Ali Shah, Safiullah Khan, Khalid Javeed, Shoaib Azmat

    Modular multiplication is the most crucial operation in the cryptographic systems that are based on the public key cryptography. In this work, a new architecture for radix-2 Montgomery Modular Multiplier (MMM) is proposed. The proposed design utilizes Redundant-Signed-Digit (RSD) arithmetic to optimize the critical path at the arithmetic level. The incorporation of the RSD arithmetic has significantly reduced the critical path of the proposed MMM. However, RSD arithmetic increases the area of the MMM. In order to compensate the increase in area, a new architecture for MMM is proposed that is based on a single adder instead of two as required in conventional MMM. The proposed design is implemented on Virtex-6 platform for various field sizes. It can perform a 256 bit modular multiplication in 0.73us and utilizes 3.8k Look-Up Tables. The proposed design achieves higher speed than other counterparts and occupies competitive area.


  • Open Access

    K ‐means based multiple objects tracking with long‐term occlusion handling

    by Muhammad Imran Shehzad, Yasir A. Shah, Zahid Mehmood, Abdul Waheed Malik, Shoaib Azmat

    This study presents a novel multiple objects tracking (MOT) approach that models object's appearance based on K ‐means, while introducing a new statistical measure for association of objects after occlusion. The proposed method is tested on several standard datasets dealing complex situations in both indoor and outdoor environments. The experimental results show that the proposed model successfully tracks multiple objects in the presence of occlusion with high accuracy. Moreover, the presented work has the capability to deal long term and complete occlusion without any prior training of the shape and motion model of the objects. Accuracy of the proposed method is comparable with that of the existing state‐of‐the‐art techniques as it successfully deals with all MOT cases in the standard datasets. Most importantly, the proposed method is cost effective in terms of memory and/or computation as compared with that of the existing state‐of‐the‐art techniques. These traits make the proposed system very useful for real‐time embedded video surveillance platforms especially those that have low memory/compute resources.


  • A wide range all-digital delay locked loop for video applications

    by Muhammad Touqir Pasha, Yasir Ali Shah, Jacob Wikner

    An all-digital delay locked loop (DLL) for use in an analog video front end (AFE) is presented. The DLL is designed for a wide input frequency range of 40-300 MHz to cater to a range of different video standards currently in use. The proposed DLL has a closed loop architecture that tracks PVT variations and locks to the input signal in a maximum of nine clock cycles. At its output, the DLL generates 32 uniformly distributed phases of the input clock to provide an optimal sampling point for the analog to digital conversion of the input signal in the AFE.