On the public citation graph
Fast RSA-type cryptosystem modulo p k q
0 signed · 169 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-58691-1_70openalex-snapshot
Open problems in number theoretic complexity, II
inferredcites →https://doi.org/10.1007/3-540-68339-9_1openalex-snapshot
Low-Exponent RSA with Related Messages
inferredcites →https://doi.org/10.1007/3-540-68339-9_14openalex-snapshot
Finding a Small Root of a Univariate Modular Equation
inferredcites →https://doi.org/10.1007/978-3-662-53018-4openalex-snapshot
Advances in Cryptology – CRYPTO 2016
inferredcites →https://doi.org/10.1007/bf00202269openalex-snapshot
Fast generation of prime numbers and secure public-key cryptographic parameters
inferredcites →https://doi.org/10.1007/bf01931269openalex-snapshot
Some remarks concerning the M.I.T. public-key cryptosystem
inferredcites →https://doi.org/10.1007/bfb0034829openalex-snapshot
Advances in Cryptology — ASIACRYPT '96
inferredcites →https://doi.org/10.1007/bfb0034863openalex-snapshot
A World Wide Number Field Sieve factoring record: On to 512 bits
inferredcites →https://doi.org/10.1007/bfb0052249openalex-snapshot
Fast RSA-type cryptosystems using n-adic expansion
inferredcites →https://doi.org/10.1007/bfb0054112openalex-snapshot
Advances in cryptology-EUROCRYPT '98 : International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31-June 4, 1998 : proceedings
inferredcites →https://doi.org/10.1007/bfb0054134openalex-snapshot
A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption
inferredcites →https://doi.org/10.1007/bfb0054135openalex-snapshot
A new public-key cryptosystem as secure as factoring
inferredcites →https://doi.org/10.1007/bfb0091534openalex-snapshot
The development of the number field sieve
inferredcites →https://doi.org/10.1007/bfb0091541openalex-snapshot
A general number field sieve implementation
inferredcites →https://doi.org/10.1007/s002000050082openalex-snapshot
Cryptanalysis of 'Less Short' RSA Secret Exponents
inferredcites →https://doi.org/10.1016/0898-1221(79)90039-7openalex-snapshot
Rivest-Shamir-Adleman public key cryptosystems do not always conceal messages
inferredcites →https://doi.org/10.1049/el:19820617openalex-snapshot
Fast decipherment algorithm for RSA public-key cryptosystem
inferredcites →https://doi.org/10.1109/18.50373openalex-snapshot
A fast signature scheme based on congruential polynomial operations
inferredcites →https://doi.org/10.1109/18.54902openalex-snapshot
Cryptanalysis of short RSA secret exponents
inferredcites →https://doi.org/10.1137/0217019openalex-snapshot
Solving Simultaneous Modular Equations of Low Degree
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1201/9781439821916openalex-snapshot
Handbook of Applied Cryptography
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.90openalex-snapshot
Smart encryption channels for securing virtual machine‐based networked applications
inferred← citeshttps://doi.org/10.1007/11554868_21openalex-snapshot
Paillier’s Cryptosystem Modulo p 2 q and Its Applications to Trapdoor Commitment Schemes
inferred← citeshttps://doi.org/10.1007/11958239_8openalex-snapshot
Factorization of Square-Free Integers with High Bits Known
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_25openalex-snapshot
A Generalized Takagi-Cryptosystem with a Modulus of the Form prqs
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_37openalex-snapshot
Factoring N = pq 2 with the Elliptic Curve Method
inferred← citeshttps://doi.org/10.1007/3-540-45861-1_8openalex-snapshot
Design and Analysis of Fast Provably Secure Public-Key Cryptosystems Based on a Modular Squaring
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_21openalex-snapshot
Factoring N = p r q for Large r
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_5openalex-snapshot
Efficient and Secure Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-01950-1_35openalex-snapshot
Certifying Variant of RSA with Generalized Moduli
inferred← citeshttps://doi.org/10.1007/978-3-030-03712-3_2openalex-snapshot
An RSA-Based User Authentication Scheme for Smart-Homes Using Smart Card
inferred← citeshttps://doi.org/10.1007/978-3-030-10970-7_19openalex-snapshot
A Generalized Attack on Some Variants of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-030-39081-5_30openalex-snapshot
A Multi-factor RSA-like Scheme with Fast Decryption Based on Rédei Rational Functions over the Pell Hyperbola
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_26openalex-snapshot
Improvements to RSA Key Generation and CRT on Embedded Devices
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_23openalex-snapshot
A Generalized Attack on the Multi-prime Power RSA
inferred← citeshttps://doi.org/10.1007/978-3-031-20974-1_12openalex-snapshot
Cryptanalysis of the Multi-Power RSA Cryptosystem Variant
inferred← citeshttps://doi.org/10.1007/978-3-031-37679-5_11openalex-snapshot
Improved Cryptanalysis of the Multi-Power RSA Cryptosystem Variant
inferred← citeshttps://doi.org/10.1007/978-3-031-79007-2_5openalex-snapshot
Small Private Exponent Attacks on Takagi Family Schemes
inferred← citeshttps://doi.org/10.1007/978-3-031-82380-0_8openalex-snapshot
A New Public Key Cryptosystem Based on the Cubic Pell Curve
inferred← citeshttps://doi.org/10.1007/978-3-031-97260-7_5openalex-snapshot
A Novel Partial Key Exposure Attack on Common Prime RSA
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_11openalex-snapshot
Elliptic Curve Factorization Using a “Partially Oblivious” Function
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_10openalex-snapshot
New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_9openalex-snapshot
Partial Key Exposure Attacks on Takagi’s Variant of RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-16715-2_14openalex-snapshot
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
inferred← citeshttps://doi.org/10.1007/978-3-319-17533-1_7openalex-snapshot
Partial Prime Factor Exposure Attacks on RSA and Its Takagi’s Variant
inferred← citeshttps://doi.org/10.1007/978-3-319-18681-8_28openalex-snapshot
New Attacks on RSA with Moduli N = p r q
inferred← citeshttps://doi.org/10.1007/978-3-319-23021-4_10openalex-snapshot
A New Partial Key Exposure Attack on Multi-power RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-26617-6_6openalex-snapshot
Cryptanalysis of Variants of RSA with Multiple Small Secret Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-27659-5_13openalex-snapshot
Factoring a Multiprime Modulus N with Random Bits
inferred← citeshttps://doi.org/10.1007/978-3-319-29485-8_26openalex-snapshot
Factoring $$N=p^rq^s$$ for Large r and s
inferred← citeshttps://doi.org/10.1007/978-3-319-53177-9_15openalex-snapshot
Improved Results on Cryptanalysis of Prime Power RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-54705-3_9openalex-snapshot
An Improved Analysis on Three Variants of the RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-319-76953-0_4openalex-snapshot
Improved Factorization of $$N=p^rq^s$$
inferred← citeshttps://doi.org/10.1007/978-3-319-89339-6_15openalex-snapshot
Cryptanalysis of RSA Variants with Modified Euler Quotient
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_16openalex-snapshot
Secret Exponent Attacks on RSA-type Schemes with Moduli N=p r q
inferred← citeshttps://doi.org/10.1007/978-3-540-24852-1_28openalex-snapshot
Security Analysis of CRT-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-30191-2_10openalex-snapshot
Factorization-Based Fail-Stop Signatures Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-40061-5_28openalex-snapshot
Generalized Powering Functions and Their Application to Digital Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_2openalex-snapshot
New Partial Key Exposure Attacks on RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_13openalex-snapshot
On the Design of RSA with Short Secret Exponent
inferred← citeshttps://doi.org/10.1007/978-3-540-68164-9_13openalex-snapshot
An Adaptation of the NICE Cryptosystem to Real Quadratic Orders
inferred← citeshttps://doi.org/10.1007/978-3-540-71677-8_27openalex-snapshot
Deterministic Polynomial Time Equivalence Between Factoring and Key-Recovery Attack on Takagi’s RSA
inferred← citeshttps://doi.org/10.1007/978-3-540-79104-1_9openalex-snapshot
RSA Moduli with a Predetermined Portion: Techniques and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-79263-5_25openalex-snapshot
Small Secret Key Attack on a Variant of RSA (Due to Takagi)
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7openalex-snapshot
Advances in cryptology - ASIACRYPT 2009 : 15th International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, December 6-10, 2009 : proceedings
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_28openalex-snapshot
Factoring pq 2 with Quadratic Forms: Nice Cryptanalyses
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_33openalex-snapshot
Efficiency Limitations for Σ-Protocols for Group Homomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_16openalex-snapshot
Solving Generalized Small Inverse Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-21969-6_6openalex-snapshot
Improved Cryptanalysis of the Multi-Prime φ - Hiding Assumption
inferred← citeshttps://doi.org/10.1007/978-3-642-27296-7_102openalex-snapshot
Comment on a Research and Analysis Four-Prime RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-27890-7_2openalex-snapshot
Generalized Security Analysis of the Random Key Bits Leakage Attack
inferred← citeshttps://doi.org/10.1007/978-3-642-31698-2_134openalex-snapshot
An Efficient Variant of the Batch RSA Cryptosystem
inferred← citeshttps://doi.org/10.1007/978-3-642-34416-9_10openalex-snapshot
Reduction in Lossiness of RSA Trapdoor Permutation
inferred← citeshttps://doi.org/10.1007/978-3-642-34601-9_29openalex-snapshot
On the Improvement of Fermat Factorization
inferred← citeshttps://doi.org/10.1007/978-3-642-39059-3_5openalex-snapshot
Factoring Multi-power RSA Modulus N = p r q with Partial Known Bits
inferred← citeshttps://doi.org/10.1007/978-3-662-48797-6_9openalex-snapshot
Solving Linear Equations Modulo Unknown Divisors: Revisited
inferred← citeshttps://doi.org/10.1007/978-3-662-49387-8_4openalex-snapshot
How to Generalize RSA Cryptanalyses
inferred← citeshttps://doi.org/10.1007/978-981-10-3611-8_16openalex-snapshot
A Family P System of Realizing RSA Algorithm
inferred← citeshttps://doi.org/10.1007/978-981-96-4734-7_4openalex-snapshot
Generalized Cryptanalysis of Cubic Pell RSA
inferred← citeshttps://doi.org/10.1007/s10207-005-0080-1openalex-snapshot
Security analysis of CRT-based cryptosystems
inferred← citeshttps://doi.org/10.1007/s10440-006-9045-2openalex-snapshot
A Review on the Isomorphism Classes of Hyperelliptic Curves of Genus 2 over Finite Fields Admitting a Weierstrass Point
inferred← citeshttps://doi.org/10.1007/s10586-012-0223-xopenalex-snapshot
SNUAGE: an efficient platform-as-a-service security framework for the cloud
inferred← citeshttps://doi.org/10.1007/s10586-018-2840-5openalex-snapshot
A fast GPU-based hybrid algorithm for addition chains
inferred← citeshttps://doi.org/10.1007/s10623-014-9928-6openalex-snapshot
Small secret exponent attack on RSA variant with modulus $$N=p^rq$$ N = p r q
inferred← citeshttps://doi.org/10.1007/s11432-015-5409-4openalex-snapshot
Cryptanalysis of Prime Power RSA with two private exponents
inferred← citeshttps://doi.org/10.1007/s11767-006-0144-zopenalex-snapshot
Conditional factorization based on lattice theory for 〈K,1〉-integers
inferred← citeshttps://doi.org/10.1007/s12190-017-1103-6openalex-snapshot
A new generalization of the KMOV cryptosystem
inferred← citeshttps://doi.org/10.1007/s12190-019-01257-yopenalex-snapshot
A new public key cryptosystem based on Edwards curves
inferred← citeshttps://doi.org/10.1007/s12652-018-0844-xopenalex-snapshot
Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computing
inferred← citeshttps://doi.org/10.1007/s13389-016-0118-5openalex-snapshot
SPA on Rabin variant with public key $$N=p^2q$$ N = p 2 q
inferred← citeshttps://doi.org/10.1007/s13389-025-00383-7openalex-snapshot
New lattice-based partial key exposure attacks on common prime RSA
inferred← citeshttps://doi.org/10.1007/s40993-024-00585-8openalex-snapshot
Fast square-free decomposition of integers using class groups
inferred← citeshttps://doi.org/10.1016/j.ins.2020.05.075openalex-snapshot
Remarks on the cryptanalysis of common prime RSA for IoT constrained low power devices
inferred← citeshttps://doi.org/10.1016/j.prime.2024.100466openalex-snapshot
Successful cryptanalysis on RSA type modulus N=p2q
inferred← citeshttps://doi.org/10.1016/j.procs.2017.08.282openalex-snapshot
Fast Cloud-RSA Scheme for Promoting Data Confidentiality in the Cloud Computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.08.001openalex-snapshot
Cryptanalysis of the RSA variant based on cubic Pell equation
inferred← citeshttps://doi.org/10.1049/iet-ifs:20060132openalex-snapshot
Explicit expression for decryption in a generalisation of the Paillier scheme
inferred← citeshttps://doi.org/10.1063/1.5136365openalex-snapshot
New cryptanalytic results upon prime power moduli N = prq
inferred← citeshttps://doi.org/10.1080/07366981.2023.2214995openalex-snapshot
AN OVERVIEW OF FAST VARIANTS OF THE RSA CRYPTOSYSTEM FOR MODERN CRYPTOGRAPHY APPLICATIONS
inferred← citeshttps://doi.org/10.1080/09720529.2018.1564201openalex-snapshot
Forty years of attacks on the RSA cryptosystem: A brief survey
inferred← citeshttps://doi.org/10.1080/17445760.2021.2024535openalex-snapshot
A variant RSA acceleration with parallelisation
inferred← citeshttps://doi.org/10.1080/23799927.2018.1529709openalex-snapshot
Factoring RSA moduli when a message is close to a multiple of the primes
inferred← citeshttps://doi.org/10.1088/1742-6596/622/1/012019openalex-snapshot
New Attacks on RSA with ModulusN=p2qUsing Continued Fractions
inferred← citeshttps://doi.org/10.1088/1742-6596/943/1/012057openalex-snapshot
On factoring RSA modulus using random-restart hill-climbing algorithm and Pollard’s rho algorithm
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.306openalex-snapshot
Factorization of Square-Free Integers with High Bits Known
inferred← citeshttps://doi.org/10.1109/access.2021.3129224openalex-snapshot
Systematic and Critical Review of RSA Based Public Key Cryptographic Schemes: Past and Present Status
inferred← citeshttps://doi.org/10.1109/access.2023.3264590openalex-snapshot
Solving Generalized Bivariate Integer Equations and Its Application to Factoring With Known Bits
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493604openalex-snapshot
A new RSA vulnerability using continued fractions
inferred← citeshttps://doi.org/10.1109/bigdataservice.2015.75openalex-snapshot
Favored Encryption Techniques for Cloud Storage
inferred← citeshttps://doi.org/10.1109/bmei.2009.5305866openalex-snapshot
Multi-Factor Rebalanced RSA-CRT Encryption Schemes
inferred← citeshttps://doi.org/10.1109/esci50559.2021.9396808openalex-snapshot
Hardware-Software co-implementation of a high performance and light-weight scalable Systolic-Montgomery based modified RSA for portable IoT devices
inferred← citeshttps://doi.org/10.1109/iadcc.2009.4809104openalex-snapshot
Improvement over Public Key Cryptographic Algorithm
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579592openalex-snapshot
On the design and implementation of an efficient RSA variant
inferred← citeshttps://doi.org/10.1109/iccsee.2012.286openalex-snapshot
Parallel Analysis of an Improved RSA Algorithm
inferred← citeshttps://doi.org/10.1109/iceeccot43722.2018.9001351openalex-snapshot
Enhanced RSA Algorithm using Fake Modulus and Fake Public Key Exponent
inferred← citeshttps://doi.org/10.1109/icics.2003.1292757openalex-snapshot
Signature scheme based on composite discrete logarithm
inferred← citeshttps://doi.org/10.1109/icitcs.2013.6717769openalex-snapshot
A Bergman Ring Based Cryptosystem Analogue of RSA
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834542openalex-snapshot
Partial Key Exposure Attacks on RSA with Moduli N=p r q s
inferred← citeshttps://doi.org/10.1109/iws.1999.810997openalex-snapshot
A secure and trusted time stamping authority
inferred← citeshttps://doi.org/10.1109/jiot.2020.2970499openalex-snapshot
Efficient and Secure Outsourcing Scheme for RSA Decryption in Internet of Things
inferred← citeshttps://doi.org/10.1109/siml69834.2026.11621131openalex-snapshot
A Hybrid AES-256 and Multi-Power RSA Framework for Efficient Secure Instant Messaging
inferred← citeshttps://doi.org/10.1109/tit.2007.901248openalex-snapshot
Dual RSA and Its Security Analysis
inferred← citeshttps://doi.org/10.1145/3717823.3718273openalex-snapshot
The Jacobi Factoring Circuit: Quantum Factoring with Near-Linear Gates and Sublinear Space and Depth
inferred← citeshttps://doi.org/10.1145/581291.581301openalex-snapshot
Location errors in wireless embedded sensor networks
inferred← citeshttps://doi.org/10.1186/s42400-024-00289-7openalex-snapshot
Lattice-based cryptanalysis of RSA-type cryptosystems: a bibliometric analysis
inferred← citeshttps://doi.org/10.12732/ijpam.v110i4.3openalex-snapshot
NEW PRACTICAL ATTACK ON RSA MODULUS OF TYPE $N=p^{2}q$
inferred← citeshttps://doi.org/10.14419/ijamr.v5i4.6494openalex-snapshot
Cryptanalysis on prime power RSA modulus of the form \(N = p^r q\)
inferred← citeshttps://doi.org/10.14419/ijet.v7i2.7.10940openalex-snapshot
On using Aryabhatta Remainder Theorem to Decrypt a Message with RPrime and Rebalanced RSA
inferred← citeshttps://doi.org/10.1515/ausi-2015-0016openalex-snapshot
Factoring multi power RSA moduli with a class of secret exponents
inferred← citeshttps://doi.org/10.1515/gcc-2016-0002openalex-snapshot
Factoring multi-power RSA moduli with primes sharing least or most significant bits
inferred← citeshttps://doi.org/10.1515/jmc-2016-0025openalex-snapshot
Cryptanalysis of an RSA variant with moduli N = p r q l
inferred← citeshttps://doi.org/10.1515/jmc-2019-0035openalex-snapshot
New number-theoretic cryptographic primitives
inferred← citeshttps://doi.org/10.1587/transfun.e92.a.33openalex-snapshot
Small Secret Key Attack on a Takagi's Variant of RSA
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1086openalex-snapshot
An RSA-Based Leakage-Resilient Authenticated Key Exchange Protocol Secure against Replacement Attacks, and Its Extensions
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.1274openalex-snapshot
Solving Generalized Small Inverse Problems
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.19openalex-snapshot
Small Secret CRT-Exponent Attacks on Takagi's RSA
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.1090openalex-snapshot
A Simple Improvement for Integer Factorizations with Implicit Hints
inferred← citeshttps://doi.org/10.20852/ntmsci.2022.464openalex-snapshot
Cryptanalysis Attacks for Factoring Generalized Takagi s Scheme $N p^rq^s$
inferred← citeshttps://doi.org/10.31987/ijict.3.1.90openalex-snapshot
MULTI KEY ALGORITHM FOR SECURITY ENHANCEMENT OF RSA ALGORITHM USING MATLAB
inferred← citeshttps://doi.org/10.32920/ryerson.14652960openalex-snapshot
Authentication protocols for smart homes
inferred← citeshttps://doi.org/10.32920/ryerson.14652960.v1openalex-snapshot
Authentication protocols for smart homes
inferred← citeshttps://doi.org/10.33187/jmsm.1135988openalex-snapshot
Asymptotic Bound for RSA Variant with Three Decryption Exponents
inferred← citeshttps://doi.org/10.3390/cryptography7030037openalex-snapshot
A New RSA Variant Based on Elliptic Curves
inferred← citeshttps://doi.org/10.3390/math12213411openalex-snapshot
New Cryptanalysis of Prime Power RSA with Two Private Exponents
inferred← citeshttps://doi.org/10.3390/math9222931openalex-snapshot
Factoring the Modulus of Type N = p2q by Finding Small Solutions of the Equation er − (Ns + t) = αp2 + βq2
inferred← citeshttps://doi.org/10.3934/math.2023958openalex-snapshot
Generalization of RSA cryptosystem based on 2n primes
inferred← citeshttps://doi.org/10.4018/978-1-7998-1763-5.ch007openalex-snapshot
Modification of Traditional RSA into Symmetric-RSA Cryptosystems
inferred← citeshttps://doi.org/10.4018/ijbdcn.2017010106openalex-snapshot
Modification of Traditional RSA into Symmetric-RSA Cryptosystems
inferred← citeshttps://doi.org/10.4028/www.scientific.net/aef.6-7.948openalex-snapshot
Design and Application of Information Management System Based on ASP.NET
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.756-759.2660openalex-snapshot
A New Efficient Variant of the Batch RSA Cryptosystem
inferred← citeshttps://doi.org/10.4304/jait.2.3.146-151openalex-snapshot
Improvement in RSA Cryptosystem
inferred← citeshttps://doi.org/10.4314/cajost.v5i1.1openalex-snapshot
Public key exponent attacks on multi-prime power modulus using continued fraction expansion method
inferred← citeshttps://doi.org/10.47086/pims.827108openalex-snapshot
Diophantine Attack on Prime Power With Modulus $N=p^rq$
inferred← citeshttps://doi.org/10.48550/arxiv.1001.2249openalex-snapshot
On the Efficiency of Fast RSA Variants in Modern Mobile Phones
inferred← citeshttps://doi.org/10.51354/mjen.1524490openalex-snapshot
A Modified Key Generation Algorithm to Rebalanced-RSA and RPower-RSA
inferred← citeshttps://doi.org/10.52280/pujm.2024.56(5)01openalex-snapshot
Another Look at the Security Analysis of the Modulus N = p2q by Utilizing an Approximation Approach for ϕ(N)
inferred← citeshttps://doi.org/10.54254/2753-8818/13/20240864openalex-snapshot
Evaluating RSA encryption: Primality testing, pollard’s algorithms, and security challenges
inferred← citeshttps://doi.org/10.5753/sbseg.2005.21521openalex-snapshot
An efficient variant of the RSA cryptosystem
inferred← citeshttps://doi.org/10.9734/jamcs/2023/v38i81788openalex-snapshot
Breaking Modulus of the form \(N = p^rq^s\) with Improved Polynomial Attacks
inferred← citeshttps://doi.org/10.9734/jamcs/2023/v38i81790openalex-snapshot
Vulnerabilities of \(ex^2\) - \(y^2\)\(\phi\) (N)= z Using Modulus of the Form N= \(p^r\)\(q^s\)
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.