Skip to Content

39 Results Found

  • Article
  • Open Access
21 Citations
10,232 Views
25 Pages

Evaluation and Comparison of Lattice-Based Cryptosystems for a Secure Quantum Computing Era

  • Maria E. Sabani,
  • Ilias K. Savvas,
  • Dimitrios Poulakis,
  • Georgia Garani and
  • Georgios C. Makris

The rapid development of quantum computing devices promises powerful machines with the potential to confront a variety of problems that conventional computers cannot. Therefore, quantum computers generate new threats at unprecedented speed and scale...

(This article belongs to the Special Issue Quantum Computation and Its Applications)
  • Review
  • Open Access
154 Citations
28,443 Views
21 Pages

5 February 2021

The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems alm...

(This article belongs to the Special Issue Cyber Security and Privacy in IoT)
  • Article
  • Open Access
1 Citations
3,331 Views
12 Pages

20 December 2021

Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios. Most of the current KDM security schemes are based on traditional hard mathematical...

  • Article
  • Open Access
27 Citations
12,505 Views
28 Pages

Learning with Errors: A Lattice-Based Keystone of Post-Quantum Cryptography

  • Maria E. Sabani,
  • Ilias K. Savvas and
  • Georgia Garani

13 April 2024

The swift advancement of quantum computing devices holds the potential to create robust machines that can tackle an extensive array of issues beyond the scope of conventional computers. Consequently, quantum computing machines create new risks at a v...

  • Article
  • Open Access
3 Citations
2,389 Views
33 Pages

29 October 2024

The RSA cryptosystem has been a cornerstone of modern public key infrastructure; however, recent advancements in quantum computing and theoretical mathematics pose significant risks to its security. The advent of fully operational quantum computers c...

  • Proceeding Paper
  • Open Access
3 Citations
2,059 Views
4 Pages

Efficient PRNU Matching in the Encrypted Domain

  • Alberto Pedrouzo-Ulloa,
  • Miguel Masciopinto,
  • Juan Ramón Troncoso-Pastoriza and
  • Fernando Pérez-González

Photoresponse Non-Uniformity (PRNU) is becoming particularly relevant within digital media forensics, as a means to effectively determine the source camera of a given image. Most of the practical applications in digital media forensics involve dealin...

(This article belongs to the Proceedings of The 2nd XoveTIC Conference (XoveTIC 2019))
  • Article
  • Open Access
2,237 Views
9 Pages

Security Analysis of DBTRU Cryptosystem

  • Xiaofei Tong,
  • Jingguo Bi,
  • Yufei Duan,
  • Lixiang Li and
  • Licheng Wang

23 September 2022

DBTRU was proposed by Thang and Binh in 2015. As a variant of NTRU, the integer polynomial ring is replaced by two binary truncated polynomial rings GF(2)[x]/(xn+1). DBTRU has some advantages over NTRU in terms of security and performance. In this pa...

  • Review
  • Open Access
3,199 Views
25 Pages

A Survey on Classical Lattice Algorithms

  • Tongchen Shen and
  • Xiangxue Li

The rapid advancement of quantum computing poses a severe threat to traditional public key cryptosystems. Lattice-based cryptography has emerged as a core candidate for post-quantum cryptography due to its presumed quantum resistance, robust security...

(This article belongs to the Section Cryptography Reviews)
  • Article
  • Open Access
4 Citations
5,092 Views
14 Pages

A Lattice-Based Group Authentication Scheme

  • Jheng-Jia Huang,
  • Yi-Fan Tseng,
  • Qi-Liang Yang and
  • Chun-I Fan

15 June 2018

Authentication has been adopted in many areas, but most of these authentication schemes are built using traditional cryptographic primitives. It is widely believed that such primitives are not resistant to quantum algorithms. To deal with those quant...

(This article belongs to the Special Issue Selected Papers from the 2017 International Conference on Inventions)
  • Review
  • Open Access
1 Citations
3,746 Views
17 Pages

In 1994, P. Shor discovered quantum algorithms that can break both the RSA cryptosystem and the ElGamal cryptosystem. In 2007, D-Wave demonstrated the first quantum computer. These events and further developments have brought a crisis to secret commu...

(This article belongs to the Section Cryptography Reviews)
  • Article
  • Open Access
28 Citations
6,262 Views
16 Pages

3 October 2018

The Gaussian sampler is an integral part in lattice-based cryptography as it has a direct connection to security and efficiency. Although it is theoretically secure to use the Gaussian sampler, the security of its implementation is an open issue. The...

(This article belongs to the Special Issue Side Channel Attacks)
  • Article
  • Open Access
921 Views
27 Pages

An Extended Coppersmith-Based Attack on RSA

  • Mohammed Rahmani,
  • Abderrahmane Nitaj and
  • Mhammed Ziane

Lattice-based cryptanalysis has become one of the most powerful tools for evaluating the security of the RSA cryptosystem. Most existing attacks rely on the classical key equation ed−kφ(N)=1 and are effective mainly when the decryption expo...

  • Article
  • Open Access
2 Citations
2,243 Views
16 Pages

Research on Quantum-Attack-Resistant Strong Forward-Secure Signature Schemes

  • Fengyin Li,
  • Junhui Wang,
  • Mengxue Shang,
  • Dandan Zhang and
  • Tao Li

2 August 2023

The security of digital signatures depends significantly on the signature key. Therefore, to reduce the impact of leaked keys upon existing signatures and subsequent ones, a digital signature scheme with strong forward security could be an effective...

(This article belongs to the Special Issue Quantum and Classical Physical Cryptography)
  • Article
  • Open Access
22 Citations
6,041 Views
26 Pages

19 November 2020

Security of currently deployed public-key cryptography algorithms is foreseen to be vulnerable against quantum computer attacks. Hence, a community effort exists to develop post-quantum cryptography (PQC) algorithms, most notably the NIST PQC standar...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
8 Citations
5,505 Views
26 Pages

Lightweight Computational Complexity Stepping Up the NTRU Post-Quantum Algorithm Using Parallel Computing

  • Ghada Farouk Elkabbany,
  • Hassan I. Sayed Ahmed,
  • Heba K. Aslan,
  • Young-Im Cho and
  • Mohamed S. Abdallah

21 December 2023

The Nth-degree Truncated polynomial Ring Unit (NTRU) is one of the famous post-quantum cryptographic algorithms. Researchers consider NTRU to be the most important parameterized family of lattice-based public key cryptosystems that has been establish...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
3 Citations
4,184 Views
18 Pages

14 March 2025

Many public key cryptosystems in use today run the risk of being broken as quantum computing develops, affecting the security of popular commercial applications. Although there are possible defenses against quantum assaults, their complexity and inef...

(This article belongs to the Topic Trends and Prospects in Security, Encryption and Encoding)
  • Proceeding Paper
  • Open Access
4 Citations
3,607 Views
5 Pages

Code-based cryptography is a promising candidate for post-quantum cryptography due to its strong security guarantees and efficient implementations. In this paper, we explore the use of code-based cryptography for multi-party computation and digital s...

(This article belongs to the Proceedings of The 3rd International Day on Computer Science and Applied Mathematics)
  • Article
  • Open Access
5 Citations
2,724 Views
11 Pages

Quantum Misuse Attack on Frodo

  • Yaru Wang,
  • Haodong Jiang and
  • Zhi Ma

4 October 2022

Research on the security of lattice-based public-key encryption schemes against misuse attacks is an important part of the cryptographic assessment of the National Institute of Standards and Technology (NIST) post-quantum cryptography (PQC) standardi...

(This article belongs to the Special Issue Quantum Computation and Quantum Information)
  • Article
  • Open Access
1 Citations
4,479 Views
19 Pages

8 July 2021

The security of lattice-based cryptosystems is based on solving hard lattice problems such as the shortest vector problem (SVP) and the closest vector problem (CVP). Various cryptanalysis algorithms such as (Pro)GaussSieve, HashSieve, ENUM, and BKZ h...

(This article belongs to the Special Issue Mathematics Cryptography and Information Security 2021)
  • Article
  • Open Access
1,224 Views
20 Pages

A Hybrid Attack on Small Private Exponent RSA via Continued Fractions and Lattices

  • Mengce Zheng,
  • Yansong Feng,
  • Abderrahmane Nitaj and
  • Yanbin Pan

In this study, we propose a hybrid cryptanalytic technique targeting the RSA cryptosystem when instantiated with small private exponents. By integrating the continued fraction approach with Coppersmith’s lattice-based technique, we formulate a...

  • Article
  • Open Access
2,622 Views
20 Pages

Application of Discrete Pruned Enumeration in Solving BDD

  • Luan Luan,
  • Yanan Shi,
  • Chunxiang Gu and
  • Yonghui Zheng

28 January 2023

The bounded distance decoding (BDD) is a fundamental problem in lattice-based cryptography which is derived from the closest vector problem (CVP). In this paper, we adapt the lattice enumeration with discrete pruning, a burgeoning method for the shor...

(This article belongs to the Section A: Computer Science)
  • Article
  • Open Access
5 Citations
3,053 Views
18 Pages

An RSA generalization using complex integers was introduced by Elkamchouchi, Elshenawy and Shaban in 2002. This scheme was further extended by Cotan and Teșeleanu to Galois fields of order n≥1. In this generalized framework, the key equation...

  • Article
  • Open Access
1 Citations
320 Views
25 Pages

24 September 2026

Wireless sensor networks (WSNs) are pervasively employed in critical domains such as smart healthcare, industrial automation, and environmental surveillance, where secure access control is essential. User authentication protocols are vital for thwart...

(This article belongs to the Special Issue New Advances in Quantum Communication and Networks, 2nd Edition)
  • Article
  • Open Access
7 Citations
4,063 Views
21 Pages

26 June 2022

The Rivest–Shamir–Adleman (RSA) cryptosystem is currently the most influential and commonly used algorithm in public-key cryptography. Whether the security of RSA is equivalent to the intractability of the integer factorization problem is...

(This article belongs to the Special Issue Recent Advances in Security, Privacy, and Applied Cryptography)
  • Article
  • Open Access
63 Citations
8,502 Views
21 Pages

Secure IoT in the Era of Quantum Computers—Where Are the Bottlenecks?

  • Maximilian Schöffel,
  • Frederik Lauer,
  • Carl C. Rheinländer and
  • Norbert Wehn

24 March 2022

Recent progress in quantum computers severely endangers the security of widely used public-key cryptosystems and of all communication that relies on it. Thus, the US NIST is currently exploring new post-quantum cryptographic algorithms that are robus...

(This article belongs to the Special Issue Lightweight Security Integrity and Confidentiality for Internet of Things (IoT))
  • Article
  • Open Access
8 Citations
3,333 Views
22 Pages

Benchmarking Post-Quantum Signatures and KEMs on General-Purpose CPUs Using a TCP Client–Server Testbed

  • Jesus Algar-Fernandez,
  • Andrea Villacís-Vanegas,
  • Ysabel Amaro-Aular and
  • Maria-Dolores Cano

9 February 2026

Quantum computing threatens widely deployed public-key cryptosystems, accelerating the adoption of Post-Quantum Cryptography (PQC) in practical systems. Beyond asymptotic security, the feasibility of PQC deployments depends on measured performance on...

  • Review
  • Open Access
4 Citations
5,185 Views
43 Pages

Unfolding Post-Quantum Cryptosystems: CRYSTALS-Dilithium, McEliece, BIKE, and HQC

  • Vaghawan Prasad Ojha,
  • Sumit Chauhan,
  • Shantia Yarahmadian and
  • David Carvalho

3 September 2025

The advent of quantum computers poses a significant threat to the security of classical cryptographic systems. To address this concern, researchers have been actively investigating the development of post-quantum cryptography, which aims to provide e...

(This article belongs to the Section E1: Mathematics and Computer Science)
  • Article
  • Open Access
19 Citations
4,512 Views
12 Pages

A Post-Quantum Digital Signature Using Verkle Trees and Lattices

  • Maksim Iavich,
  • Tamari Kuchukhidze and
  • Razvan Bocu

6 December 2023

Research on quantum computers has advanced significantly in recent years. If humanity ever creates an effective quantum computer, many of the present public key cryptosystems can be compromised. These cryptosystems are currently found in many commerc...

  • Article
  • Open Access
365 Views
26 Pages

Performance and Overflow Analysis of Polynomial Multiplication with Lazy Reduction in LightSaber

  • Suchart Khummanee,
  • Chanwit Suwannapong,
  • Sarutte Atsawaraungsuk,
  • Chalida Sanemueang and ,
  • Thipwimon Chompookham and
  • Kritsanapong Somsuk
  • + 1 author+ 0 author

15 August 2026

Polynomial multiplication is the main operation in lattice-based cryptography. Modular reduction is required to maintain the correctness within finite rings. In this study, the application of lazy reduction is chosen to reduce the frequency of modula...

  • Article
  • Open Access
13 Citations
3,483 Views
15 Pages

Post-Quantum Secure Identity-Based Proxy Blind Signature Scheme on a Lattice

  • Fengyin Li,
  • Mengjiao Yang,
  • Zhihao Song,
  • Ping Wang and
  • Guoping Li

2 August 2023

Blind signatures have been widely applied when privacy preserving is required, and the delegation of blind signature rights and a proxy blind signature (Proxy-BS) become necessary when the signer cannot sign. Existing Proxy-BS schemes are based on tr...

(This article belongs to the Special Issue Quantum and Classical Physical Cryptography)
  • Article
  • Open Access
4 Citations
2,086 Views
24 Pages

6 August 2025

Proxy re-signature enables transitive authentication of digital identities across different domains and has significant application value in areas such as digital rights management, cross-domain certificate validation, and distributed system access c...

(This article belongs to the Special Issue IoT Network Security (Second Edition))
  • Article
  • Open Access
9 Citations
3,787 Views
25 Pages

Nowadays, quantum computing is developing at an unprecedented speed. This will pose a serious threat to the security of widely used public-key cryptosystems in the near future. Scientists are actively looking for ways to protect against quantum attac...

(This article belongs to the Topic Intelligent Optimization, Decision-Making and Privacy Preservation in Cyber–Physical Systems)
  • Article
  • Open Access
9 Citations
3,434 Views
22 Pages

Intelligent Bio-Latticed Cryptography: A Quantum-Proof Efficient Proposal

  • Ohood Saud Althobaiti,
  • Toktam Mahmoodi and
  • Mischa Dohler

8 November 2022

The emergence of the Internet of Things (IoT) and the tactile internet presents high-quality connectivity strengthened by next-generation networking to cover a vast array of smart systems. Quantum computing is another powerful enabler of the next tec...

(This article belongs to the Special Issue Security, Communication and Privacy in Internet of Things: Symmetry and Advances)
  • Article
  • Open Access
1 Citations
5,104 Views
16 Pages

Factoring the Modulus of Type N = p2q by Finding Small Solutions of the Equation er − (Ns + t) = αp2 + βq2

  • Muhammad Asyraf Asbullah,
  • Normahirah Nek Abd Rahman,
  • Muhammad Rezal Kamel Ariffin and
  • Nur Raidah Salim

17 November 2021

The modulus of type N=p2q is often used in many variants of factoring-based cryptosystems due to its ability to fasten the decryption process. Faster decryption is suitable for securing small devices in the Internet of Things (IoT) environment or sec...

(This article belongs to the Special Issue Mathematics Cryptography and Information Security 2021)
  • Article
  • Open Access
3 Citations
964 Views
47 Pages

9 July 2026

With the development of quantum computing, classical cryptosystems (RSA, ECDSA) that ensure the security of distributed ledgers face an existential threat. This paper examines protocols for protecting personal data (PD) in blockchain, taking into acc...

(This article belongs to the Section Computer Science, Mathematics and AI)
  • Article
  • Open Access
2 Citations
7,131 Views
15 Pages

In this paper, we gave an attack on RSA (Rivest–Shamir–Adleman) Cryptosystem when φ ( N ) has small multiplicative inverse modulo e and the prime sum p + q is of the form p + q = 2 n k 0 + k 1 , where n is...

  • Article
  • Open Access
14 Citations
3,661 Views
22 Pages

A Novel Intermittent Jumping Coupled Map Lattice Based on Multiple Chaotic Maps

  • Rong Huang,
  • Fang Han,
  • Xiaojuan Liao,
  • Zhijie Wang and
  • Aihua Dong

22 April 2021

Coupled Map Lattice (CML) usually serves as a pseudo-random number generator for encrypting digital images. Based on our analysis, the existing CML-based systems still suffer from problems like limited parameter space and local chaotic behavior. In t...

(This article belongs to the Special Issue Cryptography and Its Applications in Information Security)
  • Article
  • Open Access
466 Views
22 Pages

New Cryptanalysis of Two Families of RSA-like Schemes

  • Brahim Chnioune,
  • Mohammed Rahmani,
  • Abderrahmane Nitaj and
  • Mhammed Ziane

19 July 2026

In certain variants of the RSA cryptosystem with a modulus N=pq, the public exponent e and the private exponent d are related by the equation ed≡1(modφn(N)) or ed≡1(modψn(N)), where φn(N)=(pn−1)(qn−1) and ψn(N)...

(This article belongs to the Special Issue Computational Algebra, Coding Theory and Cryptography: Theory and Applications, 3rd Edition)
  • Article
  • Open Access
1 Citations
1,353 Views
17 Pages

Ethernet Passive Mutual Authentication Scheme on Quantum Networks

  • Jianuo Tian,
  • Panke Qin,
  • Zongqu Zhao and
  • Baodong Qin

27 January 2025

In the context of increasing demand for secure and efficient communication networks, addressing the issue of mutual authentication in ethernet passive optical networks (EPONs) has become both valuable and practically significant. This paper proposes...

(This article belongs to the Section Quantum Information)