Muhammad Rezal Kamel Ariffin

Orcid: 0000-0001-5000-354X

According to our database1, Muhammad Rezal Kamel Ariffin authored at least 39 papers between 2011 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Cryptanalysis of a New Variant of the RSA Cryptosystem.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2024, 2024

2023
New code-based cryptosystems via the IKKR framework.
J. Inf. Secur. Appl., August, 2023

An IND-CPA Analysis of a Cryptosystem Based on Bivariate Polynomial Reconstruction Problem.
Axioms, 2023

2022
New Identified Strategies to Forge Multivariate Signature Schemes.
Symmetry, November, 2022

An Efficient Identification Scheme Based on Bivariate Function Hard Problem.
Symmetry, 2022

On (Unknowingly) Using Near-Square RSA Primes.
Symmetry, 2022

Cryptanalysis of RSA-Variant Cryptosystem Generated by Potential Rogue CA Methodology.
Symmetry, 2022

Exponential increment of RSA attack range via lattice based cryptanalysis.
Multim. Tools Appl., 2022

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

Security Issues of Novel RSA Variant.
IEEE Access, 2022

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

URASP: An ultralightweight RFID authentication scheme using permutation operation.
Peer-to-Peer Netw. Appl., 2021

Classical Attacks on a Variant of the RSA Cryptosystem.
IACR Cryptol. ePrint Arch., 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
Commuting Graphs, <i>C</i>(<i>G</i>, <i>X</i>) in Symmetric Groups Sym(<i>n</i>) and Its Connectivity.
Symmetry, 2019

Enhancing the sensitivity of a chaos sensor for Internet of things.
Internet Things, 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

2017
Computing two dimensional Poincaré maps for hyperchaotic dynamics.
Appl. Math. Comput., 2017

2016
SPA on Rabin variant with public key N=p<sup>2</sup>q.
J. Cryptogr. Eng., 2016

The Development of Deniable Authentication Protocol Based on The Bivariate Function Hard Problem.
Int. J. Netw. Secur., 2016

A Comparative S-Index in Factoring RSA Modulus via Lucas Sequences.
IACR Cryptol. ePrint Arch., 2016

2014
New Attacks on the RSA Cryptosystem.
IACR Cryptol. ePrint Arch., 2014

Implicit factorization of unbalanced RSA moduli.
IACR Cryptol. ePrint Arch., 2014

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

Passive video forgery detection techniques: A survey.
Proceedings of the 10th International Conference on Information Assurance and Security, 2014

A novel psychovisual model on an independent video frame for an almost lossless compression.
Proceedings of the 10th International Conference on Information Assurance and Security, 2014

2013
An asymmetric primitive based on the Bivariate Function Hard Problem
CoRR, 2013

2012
Symmetric Encryption Algorithm Inspired by Randomness and Non-Linearity of Immune Systems.
Int. J. Nat. Comput. Res., 2012

A New Efficient Asymmetric Cryptosystem Based on Diophantine Equation Hard Problem
CoRR, 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

Linear Diophantine Equation Discrete Log Problem and the AAβ-Cryptosystem
CoRR, 2011

Immune Systems Approaches for Cryptographic Algorithm.
Proceedings of the Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011


  Loading...