View in EDS

Formal Verification of Lightweight Encryption Algorithms for Secure IoT Operations

Saved in:
Bibliographic Details
Title: Formal Verification of Lightweight Encryption Algorithms for Secure IoT Operations
Authors: Teena Rathore, S Revathi
Source: Lightweight Cryptographic Algorithms for Secure IoT Devices ISBN: 9789349552302
Publisher Information: RADemics Research Institute, 2025.
Publication Year: 2025
Description: The rapid proliferation of Internet of Things (IoT) devices has intensified the demand for lightweight encryption algorithms that can ensure robust security within constrained computational and energy environments. While traditional testing approaches remain limited in detecting edge-case vulnerabilities and implementation-specific flaws, formal verification offers a mathematically rigorous framework for validating the correctness and security properties of cryptographic designs. This chapter presents a comprehensive exploration of formal verification techniques—model checking, theorem proving, and symbolic execution—highlighting their application to lightweight cryptography for secure IoT operations. Case studies of historical cryptographic failures are examined to underscore the inadequacies of empirical testing and the critical need for formal assurance. The discussion also addresses the verification of side-channel resistance and fault tolerance, emphasizing the necessity for exhaustive analysis to counter implementation-level threats. Challenges associated with integrating formal verification in agile development lifecycles are assessed, alongside its impact on IoT security policies, regulatory compliance, and design best practices. By bridging the gap between theoretical security and practical implementation, this chapter establishes formal verification as an essential pillar in the development of trustworthy IoT cryptographic systems.
Document Type: Part of book or chapter of book
DOI: 10.71443/9789349552302-16
Accession Number: edsair.doi...........df9c1d2d80bba7b68a56d8fcb716d2f3
Database: OpenAIRE
Description
Abstract:The rapid proliferation of Internet of Things (IoT) devices has intensified the demand for lightweight encryption algorithms that can ensure robust security within constrained computational and energy environments. While traditional testing approaches remain limited in detecting edge-case vulnerabilities and implementation-specific flaws, formal verification offers a mathematically rigorous framework for validating the correctness and security properties of cryptographic designs. This chapter presents a comprehensive exploration of formal verification techniques—model checking, theorem proving, and symbolic execution—highlighting their application to lightweight cryptography for secure IoT operations. Case studies of historical cryptographic failures are examined to underscore the inadequacies of empirical testing and the critical need for formal assurance. The discussion also addresses the verification of side-channel resistance and fault tolerance, emphasizing the necessity for exhaustive analysis to counter implementation-level threats. Challenges associated with integrating formal verification in agile development lifecycles are assessed, alongside its impact on IoT security policies, regulatory compliance, and design best practices. By bridging the gap between theoretical security and practical implementation, this chapter establishes formal verification as an essential pillar in the development of trustworthy IoT cryptographic systems.
DOI:10.71443/9789349552302-16