You are currently viewing a new version of our website. To view the old version click .

Cryptography, Volume 9, Issue 2

June 2025 - 26 articles

Cover Story: The scale and capabilities of quantum computing, combined with emerging fault-tolerant quantum chips, highlight the urgent need for advanced security and privacy solutions in the quantum artificial intelligence and Quantum Internet of Things (QIoT) era. Quantum physical unclonable functions offer a security solution by leveraging the inherent randomness of quantum hardware to generate unique and tamper-resistant cryptographic fingerprints based on quantum mechanics. This work explores integrating QPUF within a Security-by-Design framework for industrial cyber–physical systems (I-CPS). We propose a sustainable and scalable security architecture for trusted attestation of the Quantum-Industrial Internet of Things (QIIoT). Evaluations on IBM and Google quantum platforms validate the strong potential of quantum computing-driven I-CPS security for future smart industrial applications. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (26)

  • Review
  • Open Access
1 Citations
2,296 Views
24 Pages

Review of Modular Multiplication Algorithms over Prime Fields for Public-Key Cryptosystems

  • Hai Huang,
  • Jiwen Zheng,
  • Zhengyu Chen,
  • Shilei Zhao,
  • Hongwei Wu,
  • Bin Yu and
  • Zhiwei Liu

Modular multiplication is a pivotal operation in public-key cryptosystems such as RSA, ElGamal, and ECC. Modular multiplication design is crucial for improving overall system performance due to the large-bit-width operation with high computational co...

  • Article
  • Open Access
1,033 Views
18 Pages

Among the multiple important properties that characterize strong S-boxes for symmetric cryptography and are used in their designs, this study focuses on two: the non-linearity property, a classical security metric, and the confusion coefficient varia...

  • Article
  • Open Access
1,004 Views
18 Pages

We propose a new framework for compile-time ciphertext synthesis in fully homomorphic encryption (FHE) systems. Instead of invoking encryption algorithms at runtime, our method synthesizes ciphertexts from precomputed encrypted basis vectors using on...

  • Editorial
  • Open Access
771 Views
5 Pages

Advances in Authentication, Authorization and Privacy for Securing Smart Communications

  • Cheng-Chi Lee,
  • Tuan-Vinh Le,
  • Chun-Ta Li,
  • Dinh-Thuan Do and
  • Agbotiname Lucky Imoize

Recent advancements in wireless communication systems have facilitated the development of cutting-edge applications in modern architecture, and these systems are rapidly transforming our daily activities and enabling critical industrial processes [...]

  • Article
  • Open Access
1,052 Views
21 Pages

Differential cryptanalysis is one of the fundamental cryptanalysis techniques to evaluate the security of the block cipher. In many cases, resistance to differential cryptanalysis is proven through the upper bound of the differential characteristic p...

  • Article
  • Open Access
1 Citations
748 Views
20 Pages

With the rapid development of the automotive industry, research on the internet of vehicles (IoV) has become a hot topic in the field of automobiles. Considering the privacy of data collected from vehicles, this paper proposes a novel multiparty homo...

  • Article
  • Open Access
1,158 Views
16 Pages

An Improved Attack on the RSA Variant Based on Cubic Pell Equation

  • Mohammed Rahmani,
  • Abderrahmane Nitaj,
  • Abdelhamid Tadmori and
  • Mhammed Ziane

In this paper, we present a novel method to solve trivariate polynomial modular equations of the form x(y2+Ay+B)+z≡0 (mod e). Our approach integrates Coppersmith’s method with lattice basis reduction to efficiently solve the for...

  • Article
  • Open Access
2,273 Views
23 Pages

Traditional key derivation techniques, including the widely adopted PBKDF2, operate with static parameters that do not account for contextual factors such as device capabilities, data sensitivity, or password strength. In this paper, we propose a nov...

  • Article
  • Open Access
1 Citations
5,999 Views
21 Pages

Security and Performance Analyses of Post-Quantum Digital Signature Algorithms and Their TLS and PKI Integrations

  • Manohar Raavi,
  • Qaiser Khan,
  • Simeon Wuthier,
  • Pranav Chandramouli,
  • Yaroslav Balytskyi and
  • Sang-Yoon Chang

Quantum computing challenges the mathematical problems anchoring the security of the classical public key algorithms. For quantum-resistant public key algorithms, the National Institute of Standards and Technology (NIST) has undergone a multi-year st...

  • Article
  • Open Access
1,501 Views
29 Pages

The broadening adoption of interconnected systems within smart city environments is fundamental for the progression of digitally driven economies, enabling the refinement of city administration, the enhancement of public service delivery, and the fos...

of 3

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Cryptography - ISSN 2410-387X