Cryptanalysis of efficient controlled semi-quantum secret sharing protocol with entangled state [PDF]
Quantum secret sharing is a basic quantum cryptographic primitive, which plays an important role in robust key management and secure multiparty computation etc.
Shuang Li +4 more
doaj +2 more sources
Improving security of efficient multiparty quantum secret sharing based on a novel structure and single qubits [PDF]
Quantum secret sharing is a basic quantum cryptographic primitive, which has a lot of applications in information security and privacy preservation. An efficient multiparty quantum secret sharing protocol (Kuo et al. in EPJ Quantum Technol 10(1):29, 2023)
Xiao-Qiu Cai +3 more
doaj +2 more sources
DynBlock: dynamic data encryption with Toffoli gate for IoT [PDF]
The emergence of 6G networks, coupled with the expansion of smart devices, necessitates robust and efficient cryptography solutions to ensure secure communication.
Mubasher Haq +6 more
doaj +2 more sources
TTEA: designing a quantum-ready and energy-conscious encryption model for secure IoT environments [PDF]
The proliferation of resource-constrained IoT devices has intensified the conflict between robust security requirements and hardware limitations. Conventional lightweight encryption algorithms (e.g., TEA, Speck) often fail to resolve this tension ...
Mahmoud A. Abdelaal +3 more
doaj +2 more sources
Depth-Optimization of Quantum Cryptanalysis on Binary Elliptic Curves
This paper presents quantum cryptanalysis for binary elliptic curves from a time-efficient implementation perspective (i.e., reducing the circuit depth), complementing the previous research that focuses on the space-efficiency perspective (i.e., reducing
Dedy Septono Catur Putranto +4 more
doaj +1 more source
ALGEBRAIC CRYPTANALYSIS ON NTRU-HPS AND NTRU-HRSS
NTRU is a lattice-based public-key cryptosystem designed by Hoffstein, Pipher, and Silverman in 1996. NTRU published on Algorithmic Number Theory Symposium (ANTS) in 1998.
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +1 more source
Quantum algorithms for attacking hardness assumptions in classical and post‐quantum cryptography
In this survey, the authors review the main quantum algorithms for solving the computational problems that serve as hardness assumptions for cryptosystem.
J.‐F. Biasse +4 more
doaj +1 more source
Cryptanalysis of LowMC instances using single plaintext/ciphertext pair
Arguably one of the main applications of the LowMC family ciphers is in the post-quantum signature scheme PICNIC. Although LowMC family ciphers have been studied from a cryptanalytic point of view before, none of these studies were directly concerned ...
Subhadeep Banik +3 more
doaj +3 more sources
Optimized Implementation and Analysis of CHAM in Quantum Computing
A quantum computer capable of running the Grover search algorithm, which reduces the complexity of brute-force attacks by a square root, has the potential to undermine the security strength of symmetric-key cryptography and hash functions.
Yujin Yang +3 more
doaj +1 more source
Algebraic and quantum attacks on two digital signature schemes
In this article, we analyze two digital signature schemes, proposed in Moldovyan et al., that use finite noncommutative associative algebras as underlying platforms.
Roman’kov Vitaly +2 more
doaj +1 more source

