Analysis on the AAβ cryptosystem

QR Code

Analysis on the AAβ cryptosystem

In this paper, we present three types of algebraic analysis upon the AAβ cryptosystem. First, we give the congruence relation in order to solve the AAβ equation. For the second and third analysis, we bring in the continued fraction’s method and the Coppersmith’s theorems, which presents several pote...

Full description

Bibliographic Details
Main Authors:	Asbullah, Muhammad Asyraf, Kamel Ariffin, Muhammad Rezal
Format:	Conference or Workshop Item
Language:	English
Published:	Institute for Mathematical Research, Universiti Putra Malaysia 2016
Online Access:	http://psasir.upm.edu.my/id/eprint/66505/ http://psasir.upm.edu.my/id/eprint/66505/1/Cryptology2016-2.pdf

Similar Items

Algebraic cryptanalysis on the AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Provably secure randomized AAβ cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

Enhanced AAβ cryptosystem: the design
by: Asbullah, Muhammad Asyraf, et al.
Published: (2018)

Enhanced AAβ cryptosystem - a comparative analysis
by: Mahad, Zahari, et al.
Published: (2019)

Timing attack analysis on AAβ cryptosystem
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2014)

AAβ-Cryptosystem: a chaos based public key cryptosystem
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2009)

AAβ public key cryptosystem - a comparative analysis against RSA and ECC
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2012)

AAβ public-key cryptosystem - a practical implementation of the new asymmetric
by: Mahad, Zahari, et al.
Published: (2013)

AAβ public key cryptosystem - a new practical asymmetric implementation based on the square root problem
by: Mahad, Zahari, et al.
Published: (2012)

Analysis on the Rabin-p cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Algebraic analysis of a rabin-like cryptosystem and its countermeasures
by: Asbullah, Muhammad Asyraf, et al.
Published: (2017)

Provably secure Rabin-p cryptosystem in hybrid setting
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Design of Rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf, et al.
Published: (2016)

Fast decryption method for a Rabin primitive-based cryptosystem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

Efficient methods to overcome Rabin cryptosystem decryption failure
by: Mahad, Zahari, et al.
Published: (2017)

On the variants of RSA cryptosystem and its related algebraic cryptanalysis
by: Ruzai, Wan Nur Aqlili, et al.
Published: (2019)

Security Analysis of a Public Key Cryptosystem for Synchronized Chaotic Systems
by: Mahad, Zahari, et al.
Published: (2022)

A survey of partial key exposure attacks on RSA cryptosystem
by: Abd Ghafar, Amir Hamzah, et al.
Published: (2019)

A new efficient asymmetric cryptosystem based on the integer factorization problem of N=p2q
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2013)

Cryptanalysis of El-Gamal AAs cryptosystem
by: Mandangan, Arif
Published: (2011)

Side channel analysis on AAᵝ cryptosystem and a signing scheme based on bivariate function hard problem and discrete logarithm problem
by: Abd Ghafar, Amir Hamzah
Published: (2015)

Fast decryption methods for the Somsuk-RSA cryptosystem.
by: Asbullah, Muhammad Asyraf, et al.
Published: (2024)

Modified Baptista type cryptosystem via matrix secret key.
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2008)

Cryptanalysis on the modulus N=p2q and design of rabin-like cryptosystem without decryption failure
by: Asbullah, Muhammad Asyraf
Published: (2015)

A security upgrade on the GGH lattice-based cryptosystem
by: Arif Mandangan,, et al.
Published: (2020)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2015)

Rabin-RZ: a new efficient method to overcome Rabin cryptosystem decryption failure problem
by: Mahad, Zahari, et al.
Published: (2014)

Comparative analysis of three asymmetric encryption schemes based upon the intractability of square roots modulo N = p²q
by: Asbullah, Muhammad Asyraf, et al.
Published: (2014)

On the smallest-basis problem underlying the GGH lattice-based cryptosystem
by: Mandangan, Arif, et al.
Published: (2019)

Conditions for counter measure against one time pad attack on Baptista type cryptosystem
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2009)

Rounding theorem the possibility of applying cryptosystem on the decimal numbers.
by: Alfaris, Rand, et al.
Published: (2008)

New attacks on RSA with modulus N = p2q using continued fractions
by: Asbullah, Muhammad Asyraf, et al.
Published: (2015)

A proposed CCA-secure encryption on an ElGamal variant
by: Asbullah, Muhammad Asyraf, et al.
Published: (2012)

A new CCA-secure encryption based on the Gap Hashed Diffie-Hellman problem
by: Asbullah, Muhammad Asyraf, et al.
Published: (2013)

Another proof of wiener's short secret exponent
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

Factoring the modulus of type n = p2q by finding small solutions of the equation er − (ns + t) = αp2 + βq2
by: Asbullah, Muhammad Asyraf, et al.
Published: (2021)

Design and analysis of Rabin-p key encapsulation mechanism for CyberSecurity Malaysia MySEAL initiative
by: Asbullah, Muhammad Asyraf, et al.
Published: (2019)

A new direction in utilization of chaotic fractal functions for cryptosystems.
by: Kamel Ariffin, Muhammad Rezal, et al.
Published: (2012)

Comparative of Rivest-Shamir-Adleman cryptosystem and its four variants using running time and memory consumption analysis
by: Mandangan, Arif, et al.
Published: (2024)

The quartic analog to the RSA cryptosystem
by: Wong, Tze Jin, et al.
Published: (2007)