Encryption Algorithm MLOL: Security and Efficiency Enhancement Based on the LOL Framework

Authenticated encryption with associated data (AEAD) schemes based on stream ciphers, such as ASCON and MORUS, typically use nonlinear feedback shift registers (NFSRs) and linear feedback shift registers (LFSRs) to generate variable-length key streams. While these methods ensure message confidential...

Full description

Saved in:
Bibliographic Details
Main Authors: Xinyue Zhang, Daoguang Mu, Wenzheng Zhang, Xinfeng Dong
Format: Article
Language:English
Published: MDPI AG 2025-03-01
Series:Cryptography
Subjects:
Online Access:https://www.mdpi.com/2410-387X/9/1/18
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Authenticated encryption with associated data (AEAD) schemes based on stream ciphers, such as ASCON and MORUS, typically use nonlinear feedback shift registers (NFSRs) and linear feedback shift registers (LFSRs) to generate variable-length key streams. While these methods ensure message confidentiality and authenticity, they present challenges in security analysis, especially when automated evaluation is involved. In this paper, we present MLOL, a novel AEAD algorithm based on the LOL framework. MLOL combines authenticated encryption with optimizations to the LFSR structure to enhance both security and efficiency. The cost evaluation demonstrates that on specialized CPU platforms without SIMD instruction set support, MLOL achieves better performance in authenticated encryption speed compared to LOL-MINI with GHASH. Our security analysis confirms that MLOL provides 256-bit security against current cryptanalytic techniques. Experimental results demonstrate that MLOL not only inherits the excellent performance of LOL but also reduces the time complexity of the authenticated encryption process, providing more reliable security guarantees. It significantly simplifies security evaluation, making it suitable for automated analysis tools, and offers a feasible new approach for AEAD algorithm design.
ISSN:2410-387X