Attacking cryptosystems by means of virus machines
Abstract The security that resides in the public-key cryptosystems relies on the presumed computational hardness of mathematical problems behind the systems themselves (e.g. the semiprime factorization problem in the RSA cryptosystem), that is because there is not known any polynomial time (classica...
Main Authors: | Mario J. Pérez-Jiménez, Antonio Ramírez-de-Arellano, David Orellana-Martín |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2023-12-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-023-49297-6 |
Similar Items
-
GCD attack on the LUC4 cryptosystem.
by: Wong, Tze Jin, et al.
Published: (2009) -
The extensions on algebraic attack in AES cryptosystem
by: RezaeiPour, Davood, et al.
Published: (2009) -
On the hastad's attack to LUC4,6 cryptosystem and compared with other RSA-type cryptosystem
by: Wong, Tze Jin, et al.
Published: (2013) -
Torsion point attacks on ‘SIDH‐like’ cryptosystems
by: Péter Kutas, et al.
Published: (2023-03-01) -
Timing attack analysis on AAβ cryptosystem
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2014)