|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
|
|
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
|
|
|
|
|
|