On the public citation graph
An improved Monte Carlo factorization algorithm
0 signed · 179 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/bf01933667openalex-snapshot
A monte carlo method for factorization
inferredcites →https://doi.org/10.1017/s0305004100049252openalex-snapshot
Theorems on factorization and primality testing
inferredcites →https://doi.org/10.1090/pspum/020/0316385openalex-snapshot
Class number, a theory of factorization, and genera
inferredcites →https://doi.org/10.1090/s0025-5718-1975-0371800-5openalex-snapshot
A method of factoring and the factorization of 𝐹₇
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0583523-xopenalex-snapshot
Table errata: “A method of factoring and the factorization of 𝐹₇” [Math. Comp. 29 (1975), 183–205; MR 51 #8017] by M. A. Morrison and J. Brillhart
inferredcites →https://doi.org/10.1090/s0025-5718-1981-0606520-5openalex-snapshot
Factorization of the Eighth Fermat Number
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0206006openalex-snapshot
A Fast Monte-Carlo Test for Primality
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.1145/360980.361001openalex-snapshot
A design for a number theory package with an optimized trial division routine
inferredcites →https://doi.org/10.1145/800116.803773openalex-snapshot
Riemann's Hypothesis and tests for primality
inferredcites →https://doi.org/10.1145/800135.804400openalex-snapshot
The complexity of finding periods
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70502openalex-snapshot
Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_120openalex-snapshot
Random allocations and probabilistic languages
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-45537-x_17openalex-snapshot
Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_25openalex-snapshot
New Attacks on PKCS#1 v1.5 Encryption
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_7openalex-snapshot
Security Analysis of the Gennaro-Halevi-Rabin Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_14openalex-snapshot
Public-Key Cryptosystems with Very Small Key Lengths
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_1openalex-snapshot
Some Parallel Algorithms for Integer Factorisation
inferred← citeshttps://doi.org/10.1007/3-540-57220-1_71openalex-snapshot
Modified Maurer-Yacobi's scheme and its applications
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_66openalex-snapshot
Discrete logarithms: The effectiveness of the index calculus method
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_70openalex-snapshot
Computing discrete logarithms with the general number field sieve
inferred← citeshttps://doi.org/10.1007/978-0-8176-8298-9_6openalex-snapshot
Modern Factorization Methods
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_2openalex-snapshot
Quantum Attacks on IFP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4419-7722-9_4openalex-snapshot
Quantum Attacks on ECDLP-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-1-4612-4544-5_5openalex-snapshot
Factorization Techniques from Fermat to Today
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_6openalex-snapshot
The Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_5openalex-snapshot
Combinatorics, Probability, and Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-24268-8_19openalex-snapshot
A Review of the Factorization Problem of Large Integers
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_15openalex-snapshot
On the Streaming Indistinguishability of a Random Permutation and a Random Function
inferred← citeshttps://doi.org/10.1007/978-3-030-88323-2_8openalex-snapshot
A New Approach for Finding Low-Weight Polynomial Multiples
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_24openalex-snapshot
Finding Low-Weight Polynomial Multiples Using the Rho Method
inferred← citeshttps://doi.org/10.1007/978-3-031-22105-7_19openalex-snapshot
A Quantum Version of Pollard’s Rho of Which Shor’s Algorithm is a Particular Case
inferred← citeshttps://doi.org/10.1007/978-3-031-30634-1_12openalex-snapshot
Generic Attack on Duplex-Based AEAD Modes Using Random Function Statistics
inferred← citeshttps://doi.org/10.1007/978-3-031-50432-7_11openalex-snapshot
Wie man eine Zahl faktorisiert
inferred← citeshttps://doi.org/10.1007/978-3-031-94448-2_14openalex-snapshot
Dynamically Expanding Factor Base of Index Calculus Algorithm to Solve Massive Discrete Logarithm Problems Faster
inferred← citeshttps://doi.org/10.1007/978-3-032-35412-9_11openalex-snapshot
On the Regularity of the Generalized Birthday Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-00395-5_30openalex-snapshot
An Efficient Simulator for Boolean Network Models
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_18openalex-snapshot
Improved Cryptanalysis on Reduced-Round GOST and Whirlpool Hash Function
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_13openalex-snapshot
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-16763-3_14openalex-snapshot
On the Security of Fresh Re-keying to Counteract Side-Channel and Fault Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-25823-2_3openalex-snapshot
Quantum Algorithms for Integer Factorization
inferred← citeshttps://doi.org/10.1007/978-3-319-26662-6_23openalex-snapshot
Towards a Non-quantum Implementation of Shor’s Factorization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-72536-9_5openalex-snapshot
Factoring Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-319-94821-8_22openalex-snapshot
Proof Pearl: Constructive Extraction of Cycle Finding Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_4openalex-snapshot
Cryptography in Subgroups of $\mathbb{Z}_{n}^{*}$
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_29openalex-snapshot
Speeding Up the Pollard Rho Method on Prime Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_4openalex-snapshot
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
inferred← citeshttps://doi.org/10.1007/978-3-642-19574-7_13openalex-snapshot
Optimal Covering Codes for Finding Near-Collisions
inferred← citeshttps://doi.org/10.1007/978-3-642-33481-8_14openalex-snapshot
Random Mappings with Restricted Preimages
inferred← citeshttps://doi.org/10.1007/978-3-642-41383-4_8openalex-snapshot
Improvement of Faugère et al.’s Method to Solve ECDLP
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/978-3-662-43933-3_11openalex-snapshot
Time-Memory Trade-Offs for Near-Collisions
inferred← citeshttps://doi.org/10.1007/978-3-662-48051-9_4openalex-snapshot
Cuckoo Cycle: A Memory Bound Graph-Theoretic Proof-of-Work
inferred← citeshttps://doi.org/10.1007/978-3-662-53008-5_7openalex-snapshot
Memory-Efficient Algorithms for Finding Needles in Haystacks
inferred← citeshttps://doi.org/10.1007/978-981-19-0920-7openalex-snapshot
Modern Cryptography Volume 1
inferred← citeshttps://doi.org/10.1007/978-981-97-4799-3_10openalex-snapshot
An Overview of the Discrete Logarithm Problem in Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-99-8129-8_2openalex-snapshot
Analysis of Pollard Rho Attacks Over ECDLP
inferred← citeshttps://doi.org/10.1007/bf03167537openalex-snapshot
Efficient verification of Tunnell’s criterion
inferred← citeshttps://doi.org/10.1007/bfb0036466openalex-snapshot
A Monte Carlo factoring algorithm with finite storage
inferred← citeshttps://doi.org/10.1007/bfb0054891openalex-snapshot
Speeding up Pollard's rho method for computing discrete logarithms
inferred← citeshttps://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferred← citeshttps://doi.org/10.1007/s00145-010-9093-7openalex-snapshot
Accelerating Pollard’s Rho Algorithm on Finite Fields
inferred← citeshttps://doi.org/10.1007/s10623-011-9484-2openalex-snapshot
Memoryless near-collisions via coding theory
inferred← citeshttps://doi.org/10.1007/s10623-011-9527-8openalex-snapshot
A low-memory algorithm for finding short product representations in finite groups
inferred← citeshttps://doi.org/10.1007/s10958-012-0755-xopenalex-snapshot
Cycle detection algorithms and their applications
inferred← citeshttps://doi.org/10.1007/s11036-019-01215-9openalex-snapshot
IBEET-RSA: Identity-Based Encryption with Equality Test over RSA for Wireless Body Area Networks
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90007-7openalex-snapshot
Lower bounds for the cycle detection problem
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90177-copenalex-snapshot
Birthday paradox, coupon collectors, caching algorithms and self-organizing search
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90044-1openalex-snapshot
Improved lower bounds for the cycle detection problem
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90001-iopenalex-snapshot
Toward a theory of Pollard's rho method
inferred← citeshttps://doi.org/10.1016/0898-1221(87)90130-1openalex-snapshot
A systolic algorithm for extended GCD computation
inferred← citeshttps://doi.org/10.1016/j.chaos.2026.118659openalex-snapshot
Two-dimensional function-shaped hyperchaotic maps and their hardware implementation
inferred← citeshttps://doi.org/10.1016/j.dam.2019.03.023openalex-snapshot
Solving discrete logarithm problems faster with the aid of pre-computation
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.01.016openalex-snapshot
Cycle detection using a stack
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.11.004openalex-snapshot
Memoryless near-collisions, revisited
inferred← citeshttps://doi.org/10.1017/cbo9780511972942openalex-snapshot
Programming with Mathematica®: An Introduction
inferred← citeshttps://doi.org/10.1017/s0960129512000758openalex-snapshot
Probability, statistics and computation in dynamical systems
inferred← citeshttps://doi.org/10.1080/00029890.1984.11971425openalex-snapshot
Factorization and Primality Tests
inferred← citeshttps://doi.org/10.1080/00029890.1986.11971949openalex-snapshot
Factoring Large Numbers on a Pocket Calculator
inferred← citeshttps://doi.org/10.1080/10586458.2016.1227734openalex-snapshot
Analogues of the 3 x + 1 Problem in Polynomial Rings of Characteristic 2
inferred← citeshttps://doi.org/10.1090/s0025-5718-1981-0606520-5openalex-snapshot
Factorization of the Eighth Fermat Number
inferred← citeshttps://doi.org/10.1090/s0025-5718-1982-0637304-0openalex-snapshot
Succinct Proofs of Primality for the Factors of Some Fermat Numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-1983-0717713-2openalex-snapshot
New Integer Factorizations
inferred← citeshttps://doi.org/10.1090/s0025-5718-1984-0744939-5openalex-snapshot
A Monte Carlo Factoring Algorithm With Linear Storage
inferred← citeshttps://doi.org/10.1090/s0025-5718-1987-0866113-7openalex-snapshot
Speeding the Pollard and Elliptic Curve Methods of Factorization
inferred← citeshttps://doi.org/10.1090/s0025-5718-98-00968-5openalex-snapshot
A space efficient algorithm for group structure computation
inferred← citeshttps://doi.org/10.1090/s0025-5718-99-00992-8openalex-snapshot
Factorization of the tenth Fermat number
inferred← citeshttps://doi.org/10.1103/physreva.108.032422openalex-snapshot
Optimizing the rodeo projection algorithm
inferred← citeshttps://doi.org/10.1109/arith.1985.6158931openalex-snapshot
A systolic algorithm for integer GCD computation
inferred← citeshttps://doi.org/10.1109/csnt.2011.29openalex-snapshot
An Efficient Method to Factorize the RSA Public Key Encryption
inferred← citeshttps://doi.org/10.1109/edocw.2009.5332013openalex-snapshot
Decentralized data dependency analysis for concurrent process execution
inferred← citeshttps://doi.org/10.1109/focs.2013.39openalex-snapshot
Element Distinctness, Frequency Moments, and Sliding Windows
inferred← citeshttps://doi.org/10.1109/icmcs.2012.6320288openalex-snapshot
Improving Pollard's Rho attack on elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/icpads.2009.127openalex-snapshot
A Tabu Search for the Heterogeneous DAG Scheduling Problem
inferred← citeshttps://doi.org/10.1109/isspit.2009.5407488openalex-snapshot
High throughput multiple-precision GCD on the CUDA architecture
inferred← citeshttps://doi.org/10.1109/lisat.2018.8378028openalex-snapshot
Parallel hash collision search by Rho method with distinguished points
inferred← citeshttps://doi.org/10.1109/robot.2010.5509298openalex-snapshot
Global reachability and path planning for planetary exploration with montgolfiere balloons
inferred← citeshttps://doi.org/10.1109/sai.2016.7556107openalex-snapshot
Framework for evaluation and comparison of integer factorization algorithms
inferred← citeshttps://doi.org/10.1109/saso.2009.39openalex-snapshot
Self-Organization of Patrolling-Ant Algorithms
inferred← citeshttps://doi.org/10.1109/secpri.1999.766909openalex-snapshot
A data mining framework for building intrusion detection models
inferred← citeshttps://doi.org/10.1109/sies.2009.5196214openalex-snapshot
Deadlock risk assessment in architectural models of real-time systems
inferred← citeshttps://doi.org/10.1109/wi.2005.53openalex-snapshot
Detecting Sequences and Cycles of Web Pages
inferred← citeshttps://doi.org/10.1115/1.4001088openalex-snapshot
Hydrogen Bonds and Kinematic Mobility of Protein Molecules
inferred← citeshttps://doi.org/10.1115/1.4050246openalex-snapshot
Scalable Fully Bayesian Gaussian Process Modeling and Calibration With Adaptive Sequential Monte Carlo for Industrial Applications
inferred← citeshttps://doi.org/10.1142/9789812388841_0005openalex-snapshot
COMPUTATIONAL METHODS IN PUBLIC KEY CRYPTOLOGY
inferred← citeshttps://doi.org/10.1142/9789812799890_0007openalex-snapshot
NUMBER THEORY AND PUBLIC-KEY CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1142/s0218127426502305openalex-snapshot
Construction Algorithm of N -Dimensional Nondegenerate Polynomial Chaotic Systems
inferred← citeshttps://doi.org/10.1142/s1793042116501219openalex-snapshot
On the heuristic of approximating polynomials over finite fields by random mappings
inferred← citeshttps://doi.org/10.1145/3379543openalex-snapshot
Tight Bounds on Online Checkpointing Algorithms
inferred← citeshttps://doi.org/10.1145/3387902.3394033openalex-snapshot
An evolutionary framework for automatic and guided discovery of algorithms
inferred← citeshttps://doi.org/10.1145/69605.357970openalex-snapshot
Some negative results concerning prime number generators
inferred← citeshttps://doi.org/10.1146/annurev.cs.04.060190.001003openalex-snapshot
Number-Theoretic Algorithms
inferred← citeshttps://doi.org/10.1155/2012/439021openalex-snapshot
A Hardware-Accelerated ECDLP with High-Performance Modular Multiplication
inferred← citeshttps://doi.org/10.1155/2012/635909openalex-snapshot
An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard′s Rho
inferred← citeshttps://doi.org/10.11575/prism/26473openalex-snapshot
Improved Arithmetic in the Ideal Class Group of Imaginary Quadratic Number Fields with an Application to Integer Factoring
inferred← citeshttps://doi.org/10.1186/s40736-015-0012-6openalex-snapshot
Improvement of FPPR method to solve ECDLP
inferred← citeshttps://doi.org/10.1371/journal.pone.0119972openalex-snapshot
Phenotype Accessibility and Noise in Random Threshold Gene Regulatory Networks
inferred← citeshttps://doi.org/10.14209/sbrt.2004.231openalex-snapshot
Demonstrações Distribuídas de Caráter Primo de Larga Escala
inferred← citeshttps://doi.org/10.15373/2249555x/may2013/107openalex-snapshot
Possible Attacks on RSA Signature
inferred← citeshttps://doi.org/10.17352/amp.000194openalex-snapshot
A Logarithmic Window Algorithm for Constructive Goldbach Representations near the Centre of Large Even Integersc
inferred← citeshttps://doi.org/10.18372/2410-7840.16.7609openalex-snapshot
Inequality of computational effort of Pollard p-method according to dispaly selection and initial estimate for small-scale factorizable amounts
inferred← citeshttps://doi.org/10.20944/preprints201911.0044.v1openalex-snapshot
Analysis of Pollard's Rho Factoring Method
inferred← citeshttps://doi.org/10.20944/preprints202608.1972.v1openalex-snapshot
The KHOKHAR Square Digital Root Transformation: 7443 A Fixed-Point Analysis of a 4-Digit Graph-Based Iterative Map
inferred← citeshttps://doi.org/10.2140/involve.2013.6.99openalex-snapshot
Iterations of quadratic polynomials over finite fields
inferred← citeshttps://doi.org/10.21817/ijcse/2018/v10i1/181001006openalex-snapshot
On the Abundance of Large Primes with Small B-smooth values for p-1: An Aspect of Integer Factorization
inferred← citeshttps://doi.org/10.22028/d291-25895openalex-snapshot
On the computation of discrete logarithms in finite prime fields
inferred← citeshttps://doi.org/10.26686/wgtn.21300270openalex-snapshot
Finite Mixture Models - A Divide and Conquer Approach
inferred← citeshttps://doi.org/10.3217/tdbvt-saa75openalex-snapshot
New trends in elliptic curve cryptography
inferred← citeshttps://doi.org/10.3390/biology12030376openalex-snapshot
Effective Reversal of Macrophage Polarization by Inhibitory Combinations Predicted by a Boolean Protein–Protein Interaction Model
inferred← citeshttps://doi.org/10.3390/computation11040074openalex-snapshot
Modification of the Bellman–Ford Algorithm for Finding the Optimal Route in Multilayer Network Structures
inferred← citeshttps://doi.org/10.3390/cryptography9010003openalex-snapshot
Elliptic Curve Cryptography with Machine Learning
inferred← citeshttps://doi.org/10.3390/math14193447openalex-snapshot
An Infinite Precision Implementation of Regular Periodic Infinite Continued Fractions
inferred← citeshttps://doi.org/10.3390/sym14020312openalex-snapshot
An Efficient Variant of Pollard’s p − 1 for the Case That All Prime Factors of the p − 1 in B-Smooth
inferred← citeshttps://doi.org/10.3844/jcssp.2014.1575.1581openalex-snapshot
A VARIANT OF POLLARDS RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMS
inferred← citeshttps://doi.org/10.3844/jcssp.2015.971.975openalex-snapshot
New Collisions to Improve Pollard’s Rho Method of Solving the Discrete Logarithm Problem on Elliptic Curves
inferred← citeshttps://doi.org/10.4134/jkms.2013.50.2.361openalex-snapshot
COMPRESS MULTIPLE CIPHERTEXTS USING ELGAMAL ENCRYPTION SCHEMES
inferred← citeshttps://doi.org/10.4204/eptcs.54.18openalex-snapshot
Deciding Reachability for 3-Dimensional Multi-Linear Systems
inferred← citeshttps://doi.org/10.46586/tches.v2021.i2.254-274openalex-snapshot
Time-Memory Analysis of Parallel Collision Search Algorithms
inferred← citeshttps://doi.org/10.46586/tosc.v2021.i1.239-268openalex-snapshot
Algebraic Collision Attacks on Keccak
inferred← citeshttps://doi.org/10.47749/t/unicamp.2009.467433openalex-snapshot
Cifrassinatura sem certificados em curvas supersingulares sobre corpos binarios
inferred← citeshttps://doi.org/10.48550/arxiv.1004.3366openalex-snapshot
Some integer factorization algorithms using elliptic curves
inferred← citeshttps://doi.org/10.48550/arxiv.1209.4255openalex-snapshot
Memoryless Near-Collisions, Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.1211.1079openalex-snapshot
A fast branching algorithm for unknot recognition with experimental polynomial-time behaviour
inferred← citeshttps://doi.org/10.48550/arxiv.1607.05901openalex-snapshot
New Collisions to Improve Pollard's Rho Method of Solving the Discrete Logarithm Problem on Elliptic Curves
inferred← citeshttps://doi.org/10.48550/arxiv.1611.00575openalex-snapshot
On the Number of Periodic Points of Quadratic Dynamical Systems Modulo a Prime
inferred← citeshttps://doi.org/10.48550/arxiv.1612.04430openalex-snapshot
Aesop Fable for Network Loops
inferred← citeshttps://doi.org/10.48550/arxiv.1901.01926openalex-snapshot
An in-place, subquadratic algorithm for permutation inversion
inferred← citeshttps://doi.org/10.5036/mjiu.50.15openalex-snapshot
Note on class number parity of an abelian field of prime conductor
inferred← citeshttps://doi.org/10.5036/mjiu.53.1openalex-snapshot
Indivisibility of the class number of a real abelian field of prime conductor
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5291openalex-snapshot
On the Cryptanalysis of Public-Key Cryptography
inferred← citeshttps://doi.org/10.5121/csit.2014.4200openalex-snapshot
Computer Science & Information Technology ( CS & IT )
inferred← citeshttps://doi.org/10.5121/csit.2014.4207openalex-snapshot
Backtracking Based Integer Factorisation, Primality Testing and Square Root Calculation
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferred← citeshttps://doi.org/10.70220/697skn1zopenalex-snapshot
An Experimental Study of Monte Carlo Factoring Techniques
inferred← citeshttps://doi.org/10.70675/107ee980z2beez434aza1dbz37f6474d6e9fopenalex-snapshot
Symmetric cryptanalysis ˸ from primitives to modes
inferred← citeshttps://doi.org/10.70675/12fc1af4zc66ez43b3z8b0dzb81ae83b232fopenalex-snapshot
Optimisation de la couverture de communication et de mesure dans les réseaux de capteurs
inferred← citeshttps://doi.org/10.70675/18184677z2348z452cz94b7z9c607af5f3b6openalex-snapshot
Cryptanalyse des algorithmes de type Even-Mansour
inferred← citeshttps://doi.org/10.70675/f5b888c4zb2b8z4af0zb2ecz225ba5dbb791openalex-snapshot
Combinatorics in algebraic and logical cryptanalysis
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.