|
|
|
|
|
Rameez Asif
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 almost ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Bertrand Cambou, Michael Gowanlock, Bahattin Yildiz, Dina Ghanaimiandoab, Kaitlyn Lee, Stefan Nelson, Christopher Philabaum, Alyssa Stenberg and Jordan Wright
Using physical unclonable functions (PUFs), in support of networks secured with a public key infrastructure, to generate, on demand, the key pairs needed for lattice and code PQC algorithms.
|
|
|
|
|
|
|
|
|
|
|
Arnaud Sipasseuth, Thomas Plantard and Willy Susilo
At PKC 2008, Plantard et al. published a theoretical framework for a lattice-based signature scheme, namely Plantard?Susilo?Win (PSW). Recently, after ten years, a new signature scheme dubbed the Diagonal Reduction Signature (DRS) scheme was presented in...
ver más
|
|
|
|
|
|
|
|
|
|
|
Takeo Hagiwara and Tatsuie Tsukiji
Langton?s ant is a deterministic cellular automaton studied in many fields, artificial life, computational complexity, cryptography, emergent dynamics, Lorents lattice gas, and so forth, motivated by the hardness of predicting the ant?s macroscopic behav...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou and Hui Ma
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Jheng-Jia Huang, Yi-Fan Tseng, Qi-Liang Yang and Chun-I Fan
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 quantum a...
ver más
|
|
|
|
|
|