M. A. Asbullah

Orcid: 0000-0002-0778-4456

According to our database1, M. A. Asbullah authored at least 13 papers between 2011 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
New simultaneous Diophantine attacks on generalized RSA key equations.
J. King Saud Univ. Comput. Inf. Sci., 2024

2022
Increment of insecure RSA private exponent bound through perfect square RSA diophantine parameters cryptanalysis.
Comput. Stand. Interfaces, 2022

2021
Determination of a Good Indicator for Estimated Prime Factor and Its Modification in Fermat's Factoring Algorithm.
Symmetry, 2021

Enhancing Chaos Complexity of a Plasma Model through Power Input with Desirable Random Features.
Entropy, 2021

2020
A New LSB Attack on Special-Structured RSA Primes.
Symmetry, 2020

A New Hyperchaotic Map for a Secure Communication Scheme with an Experimental Realization.
Symmetry, 2020

On the Improvement Attack Upon Some Variants of RSA Cryptosystem via the Continued Fractions Method.
IEEE Access, 2020

Attacking RSA Using an Arbitrary Parameter.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2020, 2020

2019
New Cryptanalytic Attack on RSA Modulus <i>N</i> = <i>pq</i> Using Small Prime Difference Method.
Cryptogr., 2019

(In)Security of the AAβ Cryptosystem for Transmitting Large Data.
Proceedings of the 8th International Conference on Software and Computer Applications, 2019

2014
Rabin-$p$ Cryptosystem: Practical and Efficient Method for Rabin based Encryption Scheme.
CoRR, 2014

2012
A New Efficient Asymmetric Cryptosystem Based on the Square Root Problem
CoRR, 2012

2011
Security Features of an Asymmetric Cryptosystem based on the Diophantine Equation Discrete Log Problem.
IACR Cryptol. ePrint Arch., 2011


  Loading...