The papers we counted

Refined large-norm ISIS attack cost and new ISIS-infinity attack at small modulus.

Distinguishing algorithms for sparse small-secret LWE and LPN via relaxed SIS.

Attacks on sparse LWE and sparse LPN with new sample-time tradeoffs.

Spectral distinguishing algorithms for sparse LWE and sparse LPN.

Generic-group bounds for multi-instance CDH/IDH problems.

Improved ML attacks on sparse-secret LWE via data repetition and stepwise regression.

Sequential/parallel factoring improvement for moduli with close prime factors.

Faster Euler-based Fermat factorization for close-ish primes.

Quantum Hamiltonian encoding exploiting negacyclic symmetry for SVP, lowering resources.

Lower bound refuting feasibility of claimed McEliece key-recovery attack.

Generalized partition algorithm for underdetermined MQ lowering MAYO/QR-UOV/SNOVA estimates.

Order-6/12 Galois automorphisms accelerate TNFS linear algebra.

Genetic-programming factoring pipelines on toy 36-80-bit semiprimes; weak but genuinely factoring work.

Dense-sublattice overstretched regime analysis for MLWE and NTWE with experiments.

New Shor resource estimates for secp256k1 ECDLP plus cryptocurrency implications.

Extended wedge attack recovers UOV oil space via polar-form structure.

Adelic LLL generalization over number fields; module-SVP to ideal-HSVP reductions.

Review of low-resource quantum factoring algorithms (hybrid lattice/quantum, space-reduced Regev).

Regev/Ekera-Gartner style quantum DLP extended to hyperelliptic Jacobians.

Pfaffian-modeling structural attack on high-rate Goppa codes; breaks CFS and TII challenges.

First LWR-specific algebraic attack for power-of-two modulus, improving on Arora-Ge.

SAT/MaxSAT models for syndrome decoding and low-weight codewords.

Weak hyperelliptic curves with easy index-calculus decomposition over quadratic extensions.

Improved hybrid dual MITM attack on sparse-secret LWE for FHE parameters.

Randomized dimension reduction improving primal attack on ternary LWE, incl. hints.

Theory of lattice reduction via variational/majorization principles; title only.

Provable Gaussian-sampling SIS algorithm in any norm; faster than prior for Dilithium.

Quantum circuit cost estimates of Kuperberg attack on isogeny group actions.

Quantum sieve for cyclotomic coset problem, EDCP and S|LWE> over prime-power moduli.

Improved Boolean MQ algorithm; MQOM 3-4 bits below target; Fukuoka challenges solved.

Subexponential algebraic key recovery on binary Goppa McEliece; breaks challenges.

Wedge product attack exploiting SNOVA block-ring structure; breaks 6 parameter sets.

Reduces restricted syndrome decoding to regular SD and CVP; evaluates CROSS.

Quantum resource estimate for Shor on P-256 ECDLP and RSA-2048 with neutral atoms.

Polynomial key recovery on X24 Hankel multivariate signature via exterior algebra.

New algebraic Groebner-style Search-LWE algorithm with improved complexity.

Meet-LWE algorithm for ternary LWE given hints/leakage.

Claims optimized LLL variant with O(n^3) complexity; generic lattice reduction.

Quantum collision search for ternary LWE secret keys.

Amortized Gaussian elimination in Stern ISD; HQC Category I near 140 bits.

Corrected MinRank complexity and new hybrid attack show VDOO parameters miss claimed NIST levels.

New attack on HFERP combining simple-attack ideas and support minors.

Benchmark of BKZ vs self-dual BKZ quality with new metric.

Title: generic improvement to information set decoding.

Subexponential distinguisher for binary LWE using only sublinear number of samples.

Quantum discrete Gaussian sampler yielding improved quantum dual attacks and SIS solving.

Shor ECDLP circuit with 3.12n qubits; 1193 qubits for 256-bit curves.

Sieving and greedy coordinate-recovery attacks on ternary sparse LWE.

Coppersmith-type attack on cubic Pell RSA variant with shared LSBs.

Lattice attack on cubic Pell RSA variant beyond N^0.292(n-1) bound.

Coppersmith-style factoring attack on RSA-like variants with shared bits.

Lattice/Coppersmith methods factoring Gaussian-integer and cubic-Pell RSA variants.

Galois-symmetric module lattices reduce to lower-rank modules over subfields.

Empirical benchmark of primal LLL/BKZ attacks on small-secret LWE.

Ideal-SVP analysis for prime ideals in power-of-two cyclotomics; title only.

ISD adapted to syndrome decoding with perfect/noisy hints; thresholds for polynomial-time regime.

Coppersmith unravelled-linearization attack on CRT-RSA with small CRT exponents.

Memory-cost analysis of XL-based UOV attacks; argues parameters secure and proposes perturbations.

Multi-homogeneous wedge attack on UOV-type problem, applied to SNOVA.

Improved ternary SIS mod 2^d algorithm giving polynomial collision attacks on LtHash.

Provable 2^0.292n sieving for SVP/CVP on random lattices.

Improved LPN and Arora-Ge-style attacks on LPN-C bounded-noise variants.

Success probability bound for Ekera-Hastad quantum short-DLP; applies to DH and RSA.

Unified concrete and asymptotic estimator for rank syndrome decoding algorithms; revisits RSD parameters.

Randomized polynomial-space SVP in n^n/4e time, improving Kannan.

ISD guided by abstract posterior leakage on error vector; quantifies SD hardness under hints.

Double-structured genetic algorithm for SVP.

Truncated-polynomial-ring XL key recovery on UOV; intersection attack lowers claimed parameter security.

New hybrid intersection plus rectangular MinRank attack on UOV variants.

Provable SVP algorithm in 2^0.5596n time via DGS and BDGL decoding.

Provable classical SVP algorithm in 2^0.7314n time via DGS on superlattices.

New divide-and-conquer parallel LLL-style reduction framework.

Quasipolynomial Goppa-McEliece distinguisher and heuristic key recovery; applies to Classic McEliece parameters.

Symmetric-polynomial algebraic model for syndrome decoding with lower complexity.

Polynomial selection and Murphy-E tooling for special/tower NFS in extension fields.

Provable subexponential decision-LWE algorithm with n+o(n) samples.

Faster BKZ preprocessing for sieving SVP solvers; new SVP and Ideal Lattice Challenge records.

Trapped-ion quantum resource estimate for Shor on secp256k1.

LPN encoded as Ising problem, solved on coherent Ising machine; structured 2-sparse instances.

Higher-order vanishing key recovery on binary Goppa McEliece; breaks TII challenges.

New 2^n/2+o(n) time and space exact SVP and near-CVP algorithm.

Provable SVP in 2^0.6039n via mid-point Hessian.

Concrete hardness gaps between LWE and MLWE; title only.

Ring-structure-enhanced hybrid decoding on sparse RLWE; new records, FHE params below 128 bits.

Square-code distinguishers for skew/linearized Reed-Solomon codes.

Reduces quantum T-gate cost of CSIDH-512 group action and hidden-shift attack.

Extends algebraic oil-subspace key recovery on UOV to v>=2m; lowers SNOVA security.

Modified Fermat factoring with residue-number-system filtering; new factoring algorithms.

GPU self-initializing quadratic sieve; factors RSA-155 with stated resources.

Refines degree of regularity to reduce XL/F4 cost for polynomial system solving.

Penalty-free BDD-to-QUBO LWE solver on coherent Ising machine; 40-dim challenge instance.

Quantum ECDLP circuit with 5n/2 logical qubits, near-quadratic Toffoli.

BKW-style solver for restricted syndrome decoding (CROSS).

Correlation attacks on quasi-abelian syndrome decoding PCGs, far faster than prior attack.

Improved polynomial-memory nested collision search for small max-norm LWE.

Combinatorial attack complexity for bounded sparse LWE; title only.

Resource estimates for distributed Shor on 256-bit ECDLP.

QUBO encoding of MLWE for quantum annealing with scaling estimates.

Improved quantum ISD circuits and resource estimates for HQC and McEliece.

Optimized quantum point-addition circuits for Shor ECDLP with logical and physical resource estimates.

Single discrete Gaussian sample in 2^n/2 time; faster exact SVP/CVP.

Speeds kernel step of higher-order-vanishing key recovery on Classic McEliece parameter sets.

Multicore speedup of Fermat factorization.

Polynomial-time structural key recovery on McEliece with elliptic AG codes.

Sphere-packing upper bounds on k-irreducible sets limiting tuple sieving.

Distinguisher and key recovery on Enhanced Gabidulin Matrix Code schemes; all parameter sets broken.

Provable correctness for MATZOV-style FFT dual attack with ML-KEM cost estimates.

Memory-reduced ISD via nearest-neighbour search, quantum variant, re-estimates code-based parameters.

Title only: improved quantum Both-May ISD.

Divided-power equations in any characteristic applied to QR-UOV security.

Approximation quality analysis of HKZ, BKZ, slide reduction for k-DSP.

Provable FFT dual attack over general dual lattice; lower provable ML-KEM costs.

Small-scale empirical and provable analysis of classical factoring methods on structured integers.

Covariance-based score distribution model unifying dual attack analyses on LWE.

Dual-sieve-FFT variant with modulus switching and lossy source coding, applied to Kyber.

BSGS speedup for ECDLP via elliptic divisibility sequences.

Provable quasi-polynomial DLP in small-characteristic finite fields.

Quaternion LLL and BKZ for module-LIP / nrd-PIP lattices.

Quantum-annealing index calculus solving 16-bit ECDLP on D-Wave hardware.

Quantum rejection sampling speeds dual-attack Gaussian sampling; lowers Kyber estimates by 4-13 bits.

Symmetry-lifting dimension reduction for module-LIP in ranks 2 and 4.

Space-efficient quantum ECDLP circuit; 835 logical qubits for 256-bit curves.

Space-efficient Shor ECDLP circuit; 1333 logical qubits for 256-bit curve.

Guess-and-determine zero-minor algorithm for ECDLP with complexity analysis.

Concrete cost and time-memory analysis of new isogeny-path algorithm vs SQIsign levels.

Thesis: reinforcement-learning BKZ blocksize scheduling to speed lattice reduction.

Multi-instance DOOM attacks degrade BIKE, HQC, McEliece below level-1 targets.

Thesis on discrete-Gaussian 2^n SVP algorithm, implementation and improved combiner variants.

Schur-Macaulay matrices and divided squares improve UOV key recovery; MAYO/SNOVA parameters fall.

Provable variant of doubleRLPN code-based dual attack.

Code for exact success probability of Shor's classical post-processing for factoring.

Module-LIP dimension reduction; Hawk key recovery via smaller SVP calls.

New rescaled Bai-Galbraith embedding for small-secret LWE over rings.

Generalized ISD framework for large-weight syndrome decoding over F_q; Wave estimates.

Class group orbit structure for collision search attacks on CSIDH; title only.

Claimed polynomial-time HAWK key recovery via module-LIP; update concedes super-polynomial runtime.

Neural selection of r-adding walk tables for Pollard rho on ECDLP.

Resource cost estimate of Shor factoring on surface codes with magic-state distillation.

Structural geometric forgery on MAYO whipping lowering security below claims.

Pseudo-oil subspace algorithm for underdetermined MQ; lowers MAYO and QR-UOV direct-attack cost.

Faster Delfs-Galbraith isogeny path finding via isogeny ladders with concrete costs and GPU implementation.

Falcon/NTRU key recovery given partial f,g leakage; hardness under hints, title only.

Implementation and experimental comparison of Regev versus Shor quantum factoring.

Gate-level quantum walk collision ISD costed on standardization candidates.

Representation-theoretic dimension reduction for ideal-uSVP and ideal-BDD.

Provable dual attack on LWE via lattice projection, fewer Gaussian samples.

Coppersmith lattice attacks on algebraic RSA variants with small d.

Algebra-induced homomorphisms give lower-dimensional lattice attacks on structured schemes.

LIP-with-hints SVP embedding; intrinsic signature hints cut Hawk-1024 security ~11 bits.

Iteration map choice for parallel Pollard rho.

Bit-operation cost of Holdout structural key recovery for all Classic McEliece sets.

HOVER Goppa structure key recovery; solves TII McEliece challenges.

Solves TII-254 McEliece key recovery challenge with GPU-hours reported.

New BKZ-type reduction PotBKZ with provable termination and self-dual variant.

Groebner-basis ISD-like syndrome decoding evaluated at McEliece category-1 sizes.

Quantum point-addition circuits and Shor ECDLP resource counts for secp256k1.

Partial-exposure Coppersmith attack on cubic Pell RSA variant.

Runs JNT oracle-assisted RSA forgery for 1024-bit RSA in 1380 core-years; lowers RSA estimates.

Exploratory Simon-based quantum approach to LPN.

Claimed poly-time quantum DCP algorithm implying LWE/SVP attacks; disputed, not withdrawn.

Refined Ourivski-Johansson modelling with tight complexities for rank decoding variants.

Lattice reduction plaintext recovery on Matrix NTRU variant.

Reduction probability models for lattice sieving refining the sphere model.

Galois automorphism reduces HAWK key recovery to SVP in dimension n/2+1; HAWK-256 broken.

Solving-degree classification of Weil-restricted Semaev systems for EC index calculus; non-reviewed outlet.

Restricted impossibility results for new ECDLP transfer maps; unreviewed agent-assisted preprint.

Optimized rectangular MinRank key recovery against UOV variants, evaluated on proposed parameters.

CM terminals improving Delfs-Galbraith supersingular isogeny path-finding.

Continued-fraction and lattice small-d attack on RSA-like variants; factoring-class.

Tensor-network Schnorr sieving factoring up to 100 bits.

Improved ENUM-sieve reduction for SVP on prime cyclotomic lattices.

Student report reducing Toffoli depth/qubits of Shor modular exponentiation; resource estimate.

Dissertation: new index calculus and sieving for DLP on algebraic curves.

Unconditional p^2/5 algorithm for supersingular isogeny problem.

Key recovery from GRS-subcode distinguisher; solves TII McEliece challenges; Classic McEliece cost.

Structural key recovery on Miranda matrix-Gabidulin scheme via MinRank.

ISD revisited with new large-weight syndrome decoding records over Fq.

p-adic layered modulus switching for provable dual attacks on LWE.

Refined concrete BJMM cost in SD estimator; preprocessing ISD variants; McEliece estimates.

Triple sieve exploiting rotations for SVP on prime cyclotomic ideal lattices.

Dual-reduction plus resultant-based algebraic algorithm for LWE; Kyber estimates.

Cheaper Goppa distinguisher run and key recovery for Classic McEliece; solves toy TII challenge.

Improved Pollard p-1 factoring variant with complexity analysis.

Distributed Shor compilation and resource estimate for RSA-2048 on modular atomic hardware.

Photonic Ising-machine CVP solver for Schnorr-style lattice-sieve factoring; small integers.

Photonic Ising-machine Schnorr lattice-sieve factoring; small toy instances.

Progressive sieving-ISD; HQC levels fall below NIST targets.

Refined approx-SVP rank reduction and adaptive BKZ for MSIS estimates; Dilithium loses bits.

New lattice SVP records via disk-based sieving.

Hybrid continued-fraction/Coppersmith attack on small private exponent RSA.

Provable exact SVP on random lattices at heuristic sieving exponents.

Complexity formulae for NFS and variants.

Measured systems-level sieve/BKZ speedups versus cost models for Kyber/Falcon; unreviewed.

MIP and QUBO formulations of LWE for quantum annealing attack; toy scale.

Coppersmith small-root bounds improve fixed-degree isogeny finding classically and quantumly.

Zero-minor approach to solving ECDLP, computational exploration.

Title-only: probabilistic-computing CVP solver for Schnorr-style lattice factoring.

Polytime attacks on rank-2 module-LIP over fields with real embedding.

Corrected cost prediction for pruned enumeration at tiny success probability.

Rebuttal of claimed quantum lattice algorithm (exact coset sampling).

Quantum annealing factoring formulations (HUBO/CQM) with experiments to 60 bits.

Structural attack reducing cascaded Goppa-LDPC McEliece to LDPC key recovery.

Genetic-algorithm SVP search tailored to NTRU lattices; preliminary.

Spectral distortion conditions for RLWE-to-PLWE attacks (journal version).

Quasi-polynomial quantum algorithm for EDCP over power-of-two moduli.

ML/robust-estimation secret recovery attack on sparse-secret (Module-)LWE after lattice preprocessing.

Linear-qubit quantum algorithm for ternary LWE via generalized Dicke states.

Quantum polynomial-time S-unit computation enabling principal ideal and short generator attacks.

ANF SAT solver for Weil-descent Semaev-polynomial ECDLP attacks.

Quantified quantum S-unit group algorithm; core tool for ideal-lattice/principal ideal attacks.

Decoding random linear codes beyond Prange with preprocessing advice; LPN implications.

Breaks quasi-abelian syndrome decoding parameters via sparse interpolation exploiting algebraic structure.

Concrete cost analysis showing May-Ozerov ISD never beats Stern-based ISD in practice.

HPPC shown to be special HFE; practical MinRank key recovery for all parameters.

Shor DL algorithm fails under small rotation-gate noise.

Faster floating-point LLL via SIMD/assembly on ARM; per v0.3.4 faster LLL counts.

Refined LWE-with-hints attack building lattices by Gaussian elimination.

Practical lattice attack on 2F multivariate encryption with patched parameters.

Root-based distinguishing attacks on PLWE for weak defining polynomials.

New algorithms for sparse LPN and LSPN in low-noise regime.

Algorithm computing supersingular endomorphism ring from a suborder; core isogeny problem.

Meet-in-the-middle time-memory trade-off for lattice enumeration.

Shows totally-real module-LIP attack does not adapt to HAWK's quaternary equation.

Improved subfield curve search for supersingular isogeny problem.

Improved classical post-processing raising Shor factoring success rate.

Quantum sieve circuits and resource estimates applied to ML-KEM/ML-DSA security.

New subsupport-guessing hybrid for rank decoding; lowers RYDE cat-5 complexity 301->272 bits.

Schur-square distinguisher and key recovery on twisted GRS McEliece variants.

Polynomial structural key recovery for elliptic-code McEliece/ECC2 via Schur products.

Graded ECDLP challenge ladder with Shor resource estimates on secp256k1-family curves.

CSP heuristic factoring RSA given known low digits of primes.

Computing phi(N) from a single order query; quantum factoring post-processing.

Non-adaptive time-space lower bounds for generic-group DLOG with preprocessing.

DSP-BKZ not better than BKZ with dimensions for free; no-go result.

Average-case module-BKZ slope analysis; structure gain or loss by discriminant.

BLASter: much faster LLL/segmented BKZ implementation for lattice reduction.

Provable subexponential Wagner-style algorithm for SIS in infinity norm.

Quantum gate-count algorithms for Boolean MQ solving; applied to block ciphers.

Cost comparison of Regev-type vs Shor-type quantum algorithms for factoring and DLP.

ISD over extension fields; new BJMM variants, no asymptotic speedup found.

New non-binary ISD algorithms decoupling support enumeration from values.

Faster quantum 3-tuple sieving for SVP under memory limits.

Structural attacks breaking skew Reed-Solomon McEliece-like cryptosystem ReSkew.

Hybrid Pollard-rho/ECM factoring algorithm with experiments (thesis).

New sqrt(n) factoring method; modest claim, uncompetitive.

Security estimation framework for code-based PKC; cost model, title only.

Improved Both-May ISD with better time-memory trade-offs.

Algorithm for supersingular endomorphism ring problem, core isogeny hardness; title only.

Proven complexity of SupportMinors modeling for MinRank.

Improved ascending isogeny recovery via self-pairings; impact on SCALLOP.

Deterministic rank-3 Coppersmith factoring improving N^1/5 complexity and power divisors.

Quantum resource estimates for Shor on binary elliptic curves.

Fermat-style sieve factoring method, modest claims, non-reviewed; low impact.

Implementation optimizations of quadratic sieve factoring.

Goppa/alternant code distinguisher via higher-order vanishing.

Ring-BKW with dynamically adjusted block size; toy-parameter experiments.

Claimed improved index calculus for prime-field DLP; vague.

Empirical evaluation of SALSA/VERDE transformer attacks on LWE.

Coordinate choice for quantum resources of Shor ECDLP circuits.

Improved quantum circuits and resource counts for ECDLP on Ed25519.

Shor-based quantum resource estimates for genus-2 binary hyperelliptic DLP.

Quantum resource estimates for Shor on genus-3 hyperelliptic Jacobians.

Improved Shor point-addition circuits and cost estimates for binary curves.

Reduced symmetric algebra generalizes exterior-algebra XL key recovery to odd-characteristic UOV.

Cryptanalysis of McEliece variants using public error-vector transformations.

Parallel spooky pebbling reduces arithmetic depth of Regev's quantum factoring algorithm.

Space-efficient quantum factoring circuit for P^2 Q integers.

Polynomial-time algorithm for DiffMQ_H problem underlying multi-instance MQ ZK.

Refined concrete security estimates for Kyber and Skelya using q-ary lattice structure.

Recasts Cool+Cruel as dual attack; benchmarks primal attacks on sparse LWE.

Fast batch-CVP slicer making BDD hybrid attacks practical.

Module analogue of KHS enumeration with improved module-SVP and ideal-SVP complexity.

Simulated Shor DLP circuits; success probability and circuit size extrapolation for 2048-bit groups.

Empirical LLL/BKZ parameter study on SVPs from LWE instances.

Lattice attack on dihedral group-ring NTRU halving lattice dimension.

Elitist genetic algorithm factoring up to ~70 bits; weak factoring algorithm.

Coppersmith/Blomer-May factoring given approximate multiple of phi(N); weak large exponents.

Quadratic-hull tangent space attack recovers GRS structure of high-rate alternant codes; McEliece key recovery.

Analysis of degree-2 Hilbert function distinguisher for alternant/Goppa codes.

Ternary-representation subset-sum algorithms yielding improved classical/quantum ISD exponents.

Better use of modular hints via low-dimensional lattices for key recovery; hint exploitation.

Provably faster approx-SVP under random local block assumption.

Symplectic enumeration exploiting NTRU lattice structure for faster SVP.

Quantum-walk combinatorial key search for ternary LWE/NTRU secrets.

Parallel progressive BKZ lattice reduction algorithm.

Improved algebraic attack on regular syndrome decoding.

Faster integration of secret and error hints into LWE lattice attacks.

Ising-machine QUBO factoring, 22-bit integer on simulators; toy scale.

Transformer-based distinguisher of Goppa and QC-MDPC codes from random codes.

Rigorous quaternion embedding algorithm; reduces oriented endomorphism ring problem to vectorization.

New classical/quantum underdetermined MQ algorithm reducing MAYO, QR-UOV, SNOVA forgery security.

Dimension-halving isomorphism attacks Group Ring LWE via central simple algebras.

Weak QC-MDPC keys via extended Euclid rational reconstruction; BIKE key recovery.

Thesis: improved dual decoding attacks beating ISD; dual attack analysis for lattices.

Accurate BKZ simulator design; title only.

Special genus distinguisher for Hermitian lattices; decision module-LIP for HAWK.

Torsion-over-small-extension attacks on PRISM-id, including attack on its isogeny hardness assumption.

Refined concrete hardness of quasi-cyclic syndrome decoding; title only.

Proves soundness of algebraic RSD attacks; polytime regimes for RSD and small-error-set LWE.

Improved deterministic high-order-element-or-factor algorithm, building block of deterministic factoring.

Key-equivalence SSA key search; solves McEliece key-recovery challenge in about 1470 core-days.

Experimental assessment of Shor factoring on current cloud quantum hardware.

Modified QAOA/adiabatic factoring protocol with fewer resources; toy-scale simulations.

Refined primal attack estimators and Module-BKZ simulator for module primal attack.

NTRU message recovery via knapsack formulation; title only.

Conjecturally subexponential elliptic-curve factoring algorithm.

Key recovery on ACDGV hidden-Gabidulin matrix-code encryption; breaks some parameters.

Heuristic time complexity of QAOA-based SVP solvers.

GPU primal hybrid attack on sparse-secret LWE benchmark instances.

Optimized quantum point-addition circuits for Shor on binary elliptic curves.

Provable dual attack on LWE with modulus switching and CRT secret recovery.

Syndrome decoding given noisy cold-boot posteriors; decoding with hints.

Coppersmith lattice attack improving private-exponent bounds for cubic-Pell RSA variants.

Coppersmith small-private-exponent attack on cubic Pell RSA variant.

Exterior-algebra key recovery on char-2 UOV lowering security of UOV and MAYO parameters.

Heuristic SIQS parameter tuning with modest speedup claims; Zenodo.

Automated optimal multivariate Coppersmith lattice constructions.

Code BKZ decoding complexity estimates compared to ISD variants.

Splitting detection speeds best attack on dimension-2 superspecial isogeny problem.

ML training techniques for modular arithmetic improving ML attacks on sparse-secret LWE.

Polynomial-ring lattice from BIKE public key generalizes weak-key recovery.

Quartic quantum speedup for sparse LPN / planted noisy kXOR.

Continued fractions plus Coppersmith factor RSA-like moduli with weak exponents.

Coppersmith-type lattice factoring of RSA-like scheme with small or large private exponents.

Lower bound showing overlattice sieving cannot beat BDGL.

Hull attacks on module lattice isomorphism problem; modular lattices resist.

Solving syndrome decoding via MRHS equation solver.

Key recovery on HFE-LL' internal perturbation construction.

Blockwise puncturing speeds blockwise rank decoding attacks; also new constructions.

e-th root plaintext recovery attack on dual-modulus RSA variant.

Extended rectangular MinRank attack framework applied to UOV variants' parameters.

Continued fractions plus lattice attack factoring RSA-like n=3 variant.

SVP solver exploiting prime cyclotomic lattice structure; title only.

Improved dropping meet-in-the-middle attack for sparse/small-secret LWE.

Structural key recovery on GRS-based IKKR-type code cryptosystems.

Hybrid ISD/algebraic algorithm for regular syndrome decoding.

Heuristic restricted-SVP algorithm and estimator; gate-count Dilithium forgery analysis.

Poster: sieve algorithm exploiting ideal-lattice structure; title only.

Improved BKW algorithm for LWR with complexity gains.

Memory-efficient BKW for LWE with improved time-memory trade-off.

Space-optimized circuits for Regev's quantum factoring algorithm.

Universal Shor circuit; semi-agnostic ECDLP complete for standard abelian HSPs.

Student project running primal LLL/BKZ attack on Kyber parameter sets.

Randomized nearest-colattice approximate CVP algorithm with estimator and G6K implementation.

Attacks on phi-hiding and factoring related RSA moduli; title only.

Experimental analysis of optimization-based (Schnorr-type) factoring algorithm.

PSO search for basis ordering to improve LLL reduction.

Improved adiabatic quantum factoring algorithm via CRAB optimization; toy integers.

Notes on generalized Gauss 2D lattice reduction algorithm; reduction-algorithm work per v0.3.4.

Block preprocessing framework accelerating floating-point LLL/BKZ reduction.

Experimental comparison of Fermat and Phi factorization variants; minor.

Variational quantum algorithms for LPN/LWE with resource scaling analysis.

Faster 2-dimensional lattice reduction/SVP algorithms (v0.3.4 rule).

Lattice partial key exposure attack on common prime RSA; Coppersmith-style.

Lattice partial key exposure attacks on common prime RSA.

Quantum-classical Ising-based LWE solver via SVP; tiny NISQ demonstration.

Faster individual logarithm step in extended tower NFS.

QUBO/Ising annealing formulation of factoring, classically simulated; weak but on-topic.

NTRU message recovery given auxiliary data (hints).

Continuous-variable quantum EC point addition aimed at cheaper quantum ECDLP.

SAT plus lattice reduction for factoring given partially known prime bits.

Tight generic time-space lower bound for preprocessing DDH.

Distributed multi-machine lattice sieve implementation.

Thesis improving NFS sieving strategy for factoring.

Algorithms and hardness relations for finding orientations/endomorphisms of supersingular curves.

Thesis with NFS-variant algorithms for DLP in extension fields.

Algebraic algorithm breaking NTRU given multiple keys.

Quantum oracle for Grover-GaussSieve SVP attack, costed against NIST lattice finalists.

New LLL variant L4 improving BKZ preprocessing.

Provable blocksize halving for near-hypercubic lattices including NTRU and Falcon.

Analysis of Regev's quantum algorithm, extension to ECDLP, success conditions.

Second-order asymptotics of primal-attack block size in standard estimate recipe.

Collision attack on R-SDP(G) and precise algebraic attack estimates for R-SDP.

Derives lattice attack cost expressions and parameter-selection tool for LWE, focused on FHE.

ISD cost comparison and parameter update for LEDAcrypt.

Proves Shor's factoring fails under small random gate noise; negative quantum result.

Quadratic polynomial modelings of syndrome decoding with Groebner complexity analysis.

Improved c-sum BKW time-memory trade-offs for LWE, classical and quantum.

Quantum nested search speedup for pruned lattice enumeration.

Dual lattice attack with coding-theory decoding; improves Kyber/Saber estimates.

ISD framework for ring-linear codes in Hamming, Lee and rank metrics.

Rank-decoding reductions and message recovery attacks on Layered ROLLO-I.

Claimed polynomial-time quantum LWE algorithm; later withdrawn after bug found.

Reduces rank-2 module-LIP/Hawk to quaternion principal ideal problem; structural attack path.

Quantum factoring and DLP with n/2 qubits; RSA-2048 resource estimates.

Qubit-reduced quantum Prange ISD; estimate for smallest Classic McEliece.

Review of Shor circuit optimizations with proposed adder improvement.

Lower bounds on quantum sieving with bounded QRAM; QRAM-free circuit.

Quantum rectangular MinRank key recovery for multi-layer UOV with resource estimates.

Partial key exposure on rank signatures; also improves generic RYDE attack by 9 bits.

Key recovery on Partial Vandermonde knapsack via structure-based dimension reduction; weak keys in published parameters.

New self-dual BKZ based on sieving.

Fault-tolerant resource estimates for Grover-aided lattice sieving; little quantum speedup.

Improved bounds for factoring RSA moduli from small solutions, beating Wiener/Blomer-May.

Quantum annealing for index-calculus relation search on twisted Edwards ECDLP; toy field.

General QUBO encoding of ECDLP for quantum annealing.

Extends Regev's quantum factoring algorithm to discrete logarithms.

Quantum code-sieving algorithms for ISD and limits of quantum sieving-ISD.

Algorithms computing orientations; improves fixed-degree isogeny computation and vectorization reductions.

Provable algorithm for Coppersmith asymptotic bounds; improves CI-HNP cryptanalysis.

Partial prime factor exposure lattice attacks on RSA variants.

Practical Boneh-Durfee-style small private exponent attack reaching N^0.292.

Search-LWE attack for small secrets via Diophantine approximation and lattice reduction.

Rectangular MinRank attack on MAYO, QR-UOV and VOX; breaks VOX parameters.

Degree-of-regularity bound for random polynomial systems; Groebner complexity.

ISD framework for convolutional codes, attacking two convolutional McEliece schemes.

New padded MinRank attack breaking VOX parameter sets in minutes to hours.

Larger wheel speeds trial division subroutine; marginal factoring improvement.

Physical-qubit and runtime estimates for Shor ECDLP with surface codes.

Deterministic factoring algorithms generalizing Lehman for r-th power divisors.

Dynamic factor base expansion for index calculus over many DLP instances.

Lattice attacks on RSA: partial key exposure and d < N^0.292 (rehash of known work).

Generic classical/quantum lower bounds for DL variants, order finding, generic factoring, index calculus.

Analyzes index calculus for prime-field ECDLP; proposes pseudo-index calculus.

SVP in low-dimensional circulant lattices exploiting cyclic structure; title only.

Title-only: double index calculus algorithm for prime-field DLP.

Key recovery analysis showing some SNOVA parameters miss claimed security levels.

Depth-optimized quantum Gauss-Jordan circuit for Grover-accelerated ISD.

General-prime implementation of Castryck-Decru isogeny interpolation attack with benchmarks.

Sieving in spatial-locality memory cost model; revised Kyber/Dilithium bit security.

Coppersmith partial key exposure attacks on RSA with additive exponent blinding.

Title-only analysis of Pollard rho attacks on ECDLP.

Combinatorial MITM attack on bounded-secret sparse LWE with concrete estimates.

Evaluates reduction simulators, decoding/embedding attack parameters, SIS estimates for Dilithium.

Coppersmith lattice attack factors cubic Pell RSA modulus under generalized key equation.

Algebraic Pataki-Tural lemma and dense submodule discovery for overstretched module-NTRU.

Fruitless cycle reduction for rho with skew Frobenius on BN curves.

Quantum-sample algorithms for LWE, RLWE and SIS reexamined; extends QFT approach to RLWE.

Quantum circuits and resource estimates for NV sieve solving SVP.

Reduce-and-Prange ISD improvement for SD/RSD over large fields.

Closed-form secure parameter formulas for FHE derived from LWE attack costs.

New SVP-to-Hamiltonian reduction for QAOA with qubit/gate resource analysis.

Testing quantum LWE solvers on reduced FIPS 203 keys; preliminary methodology.

Modified Fermat factoring algorithm with fewer iterations; minor improvement.

Title: lattice attacks on small-exponent keys in RSA-like systems.

Extends Gentry dimension-reduction lattice attack to dihedral group-ring NTRU.

Ternary-tree Meet-LWE improves ternary-secret LWE attacks; lowers SMAUG-T estimates.

Shows SNOVA parameter sets fall below claimed NIST security levels.

Classifies LPN algorithms and proposes composite solver; low-tier venue.

Concrete cost of MOV reduction and DLP for supersingular curves from 1999 paper.

Memory-sample lower bounds for learning LWE.

Sesquilinear pairings on oriented curves extend class group action attacks.

New SQUFOF-based subexponential factoring algorithm.

Lifting reduces SNOVA to smaller UOV over extension; exploits ring structure.

GPU depth-2 BJMM solves McEliece-1409 challenge; round-4 candidate analysis.

Quantum space bounds for class group and principal ideal problem algorithms (ideal-lattice attacks).

Low-memory statistical attack on sparse binary LWE secrets after lattice reduction.

Approx-SVP in multiquadratic ideal lattices exploiting structure.

New time-memory trade-off for 8-sieve SVP algorithm.

Collision attack exploiting special start vertex of CDS genus-2 isogeny hash.

Continued-fraction variant of Hart one-line factoring; weak method but factoring algorithm.

New sieving-based BKZ variant for approximate SVP, tested on Darmstadt challenges.

Polynomial-system modelling toward algebraic attack on NTRU-HPS/HRSS; preliminary.

Quantum circuit design for Lee-Brickell ISD.

Singular-point attack on UOV-hat-plus and VOX lowering security below NIST targets.

Subfield attack on VOX quotient-ring transform breaking several parameter sets.

Unconditional correctness proof for Regev's quantum factoring/DL algorithm.

MCMC Gaussian sampling cost on BKZ bases improving dual-attack complexity on LWE.

Smoothing bound yields 2^n/2 approx-SVP algorithm on random lattices.

Provable SVP in 2^0.63269n on random lattices via smoothing-parameter bounds.

Grover oracle for SVP with concrete quantum costs, hybrid with BKZ.

Quantum resource estimates for Shor point multiplication circuits on binary elliptic curves.

Jochemsz-May lattice attacks on multi-prime RSA with special exponents.

Optimized space-efficient Regev quantum factoring circuits.

Exploits row-shift structure of MQ-Sign-LR for preimages.

Subexponential syzygy distinguisher for alternant/Goppa codes incl. Classic McEliece.

Gentry-style structural lattice attack breaking BQTRU NTRU variant over quaternions.

Rigorous smoothness of EC group orders underpinning ECM analysis, DL splitting application.

Regev's multidimensional quantum factoring algorithm.

New short-vector algorithms for q-ary code lattices.

Higher-dimensional NFS sieving and new descent for medium-characteristic DLP, with record computations.

LLL-based simultaneous factorization of N=p^2q moduli with small exponents.

Concurrent factoring of RSA moduli with weak key equations via Coppersmith.

Simultaneous Diophantine lattice attack factoring multiple RSA moduli with related key equations.

Properties of LLL-reduced bases for varying delta; reduction-algorithm analysis.

Experimental analysis of lattice-based factoring methods; title only.

Dimension-reduced lattice key recovery on ETRU NTRU variant.

Title only: machine-learning attack on SVP; low-tier venue.

SVP attack using k-nearest-neighbour heuristic.

Approximating average number of LLL bases; average-case analysis of reduction.

Polynomial-time attack on NTRU encryption under multiple keys (title only).

Qubit-reduced quantum circuit for Curve25519 arithmetic for Shor ECDLP.

Lattice-reduction plaintext recovery attack on Matrix NTRU variant.

Complexity of Arora-Ge/Groebner basis algebraic attacks on LWE, including hints.

Improved ML attacks on sparse binary-secret LWE up to n=1024 (HE parameters).

Fewer qubits for quantum FLT inversion in Shor on binary ECDLP.

Weak private keys lying in small subgroups on standardized curves.

Coppersmith-style lattice attack on RSA-like key equation recovers d and factors N.

Studies applicability of lattice small-key attacks on Roman'kov RSA-like scheme.

Coppersmith-style partial key exposure attacks factoring RSA-like variant moduli.

Subfield attack on principal ideal problem via norm relations.

Lattice-heuristic low-weight codeword search topping challenge (weight 212, n=1280) with hardware/time.

Binary Ring-LWE secret recovery given random known coefficient hints.

Argues Beullens forgery on SNOVA is avoidable; defends parameters.

Dynamical-systems provable bounds for pump-and-jump BKZ.

Quantum point-multiplication circuit for Shor on binary curves.

Thesis with new ISD-related algorithms; abstract truncated.

Larger index sets in ISD algorithms.

Benchmarks uSVP, SALSA, Cool&Cruel, MitM secret recovery at standardized parameters.

Fewer-variable QUBO reductions of DLP/ECDLP for quantum annealing.

ECDLP-to-QUBO reduction with logical qubit counts; toy instance on D-Wave.

Tighter generic-group lower bounds for k-out-of-n multiple DLP.

Refined two-step LWE estimator lowering NIST standard security estimates.

CPU-GPU parallel discrete pruning enumeration for SVP challenges.

Low-memory sieving-based ISD for syndrome decoding; title only.

Faster Coppersmith method via block preprocessing in lattice reduction.

Lattice bound for generalized implicit factorization of unbalanced RSA moduli.

Memory-efficient BGJ sieve implementation; solves SVP-183 Darmstadt challenge.

Coppersmith-based implicit factorization with shared bit blocks.

Deep LLL generalized to module lattices; title only.

Accuracy of BKZ Hermite-factor estimates on cryptographic-size lattices.

Explores ECDLP algorithm via zero minors of matrices; computational, speculative but genuine attempt.

Hybrid SAT plus lattice reduction factoring; title only.

Key-recovery attack on PSSI problem breaking all Durandal rank-metric parameters.

NFS Factory variant for non-prime finite fields; improved asymptotic DLP complexity.

Func-QAOA variational quantum approach to integer factorization.

Generic-group lower bounds for DL-type problems with and without preprocessing.

Polynomial-time key recovery on sparse UOV variants exploiting central-map sparsity.

Concrete quantum circuit cost of Montanaro-based quantum lattice enumeration.

Qubit/depth bounds for quantum GaussSieve oracle against NIST lattice finalists.

Qubit-reduced quantum unit-group algorithm for cyclotomic fields.

Polynomial-time structural key recovery for high-rate alternant codes.

Empirical Coppersmith attacks on low-exponent RSA; known methods, success rates.

Short Stickelberger basis enabling ideal-SVP cryptanalysis in cyclotomic fields.

e-th root algorithms for Twisted-PHS ideal-SVP saturation step; generalizes NFS square-root methods.

Hybrid primal attacks give exponential asymptotic speedup against non-ternary LPR.

High-assurance attack-cost framework; main case study is fully specified ISD cost predictions.

Generalised Stern ISD with time/memory trade-off analysis for Classic McEliece.

Greedy global deep-insertion lattice reduction framework competitive with BKZ.

Principal ideal problem algorithm via subfields, relevant to ideal-lattice attacks.

Lower-bounds cost of quantum backtracking enumeration under depth limits.

New generic decoders for restricted syndrome decoding, lowering security levels.

Title-only: machine-learning-assisted Fermat factoring on classical computers.

Experimental study of NFS sieving strategies to speed relation collection.

Groebner-basis attack on regular syndrome decoding with concrete parameter gains.

New structural attack on Loidreau and LowMS distorted-Gabidulin rank-metric schemes.

Precise enumeration cost in dual attack lowers Kyber/Saber/TFHE estimates.

Key enumeration cost estimation in dual attack; revised Kyber/Saber/TFHE complexities.

Projective-space Stern decoding speedup over Fq; breaks original SDitH parameters.

Dual decoding via sparse-LPN to LPN reduction, beating ISD at low rates.

Polynomial-time attack on M-SIDH/FESTA instances via Frobenius structure.

Self-pairings yield weak class group action instances.

Quantum decoding algorithms via Regev reduction give short-codeword algorithms.

Probabilistic analysis of Gauss/LLL reduction; v0.3.4 counts reduction analyses.

Quantum polynomial-time IsERP algorithm; breaks pSIDH.

Quantum circuits for hyperelliptic DLP over Mersenne prime fields.

Improved Herrmann-May Coppersmith-type lattice attack with merged variables.

Quantum-augmented lattice attack on NTRU with side-information hints.

Representation-technique low-memory attacks on small-key CSIDH.

Quadratic-form distinguisher and key recovery for alternant/Goppa codes via MinRank.

Extends Overbeck/Gibson structural attacks on GPT with (twisted) Gabidulin codes.

Structural key recovery via support splitting on modified McEliece/CFS Goppa parameters.

QUBO/Ising formulation of SVP on simulated coherent Ising machines.

No abstract; distributed GNFS with block Wiedemann for factoring.

Comparison of cycle-finding variants in Pollard rho; target unstated.

Toy LLL attack experiments on RLWE versus extension degree.

Accurate score distribution prediction fixing dual-sieve attack analysis.

Asymptotic analysis and LSH/F improvements for sieving-based ISD.

Shows dual-sieve-FFT attack heuristics contradict theory; success likely overestimated.

ISIS cryptanalysis for small moduli via BKZ q-ary basis geometry.

Provable ZLIP solving with SVP oracle in dimension n/2.

Generic group action model with DLog lower bounds for CSIDH-like actions.

Open-source hardness estimator library for SD, MQ, code equivalence, PKP.

Memory-efficient combinatorial algorithms for recovering small LWE secrets.

Asymptotics and regular-ISD algorithms for regular syndrome decoding.

Thesis: classical/quantum ISD cost analysis for generalized syndrome decoding; also a signature.

Coppersmith-type lattice algorithm for generalized implicit factorization of RSA moduli.

ECDLP attack over Z/p^k via lifting and exponential map; nonstandard setting.

Lattice-based deterministic factoring given phi, lambda or sigma oracles.

Rectangular MinRank attack analysis on MAYO and QR-UOV.

Classical and quantum query lower bounds for DL/CDH in black-box groups.

Quantum resource estimate for 256-bit ECDLP on cat-qubit architecture.

Claimed ISD-style improvement over Stern and Lee-Brickell; low-tier venue.

Refutes sublinear-resource QAOA factoring claim; classical Schnorr part unanalysed.

New sieving-style ISD; better in low memory and low weight, lowers BIKE cost.

FPGA ECM factoring coprocessor aimed at attack throughput; speed-focused attack implementation.

Quantum generic group lower bounds for DL; Shor optimal.

Reduces factoring to multiple-choice subset sum, improving Fermat-type complexity.

Smooth Subsum Search: sieve-free QS variant for factoring.

New hash/filter families for finding reducible tuples in lattice sieving.

Optimizes an improved index calculus variant for prime-field DLP; minor contribution.

Last fall degree bounds for Weil-restriction systems; improves HFE attack.

Continued-fraction and LLL attacks on prime-power RSA moduli.

Key recovery on MQ-Sign exploiting structured UOV-variant secret key.

Hilbert series prediction for UOV systems applied to reconciliation attack on MAYO.

Low-depth quantum binary-field multiplication for Shor on binary curves.

Neural-network LPN solvers outperform guess-and-eliminate in high-noise low-dimension regimes.

Average-case/empirical behaviour analysis of LLL via sandpile models (v0.3.4).

Extends algebraic rank decoding and MinRank attacks to finite rings.

Core-SVP estimates of Skelya and Kyber with GSA and BKZ simulator.

Parallel rho with skew Frobenius and splitting tables on BN curves.

Reduces LWE to MIS instances for quantum annealing; LWE challenge sizing.

Refutes claimed 372-qubit quantum-assisted Schnorr factoring of RSA-2048.

Polynomial-time attack on NTRU given multiple related keys.

Quantum NV sieve circuit with Grover and resource estimates.

Qubit-saving quantum division for Shor ECDLP on binary curves; resource estimates.

Lattice-estimator security evaluation of KpqC round-1 lattice candidates' parameters.

Improved cyclotomic lattice bases and G6K tuning; solves NTRU instances and n=181 challenge.

Isogeny graph structure: vertices vulnerable to path-reconstruction attack.

Dihedral group-ring NTRU key recovery reduces to SVP in half-dimension lattices.

Quantum circuit and resource cost for point doubling in Shor ECDLP on binary curves.

Polynomial-time plaintext recovery on IKKR McEliece-type variant exploiting its structure.

Hybrid lattice/MITM attack cost estimates for NTRU, NTRUEncrypt, NTRU Prime.

Improved convergence analysis and practical variant of slide reduction.

Coppersmith/Herrmann-May small-d RSA attack with MSB binary search; practical instances solved.

PICANTE: ML attack recovering sparse binary LWE secrets up to n=350.

Machine-learning attack on LWE with sparse small secrets.

Low-memory ISD with K-list sum re-estimates McEliece/HQC/BIKE bit security.

Rules out curvelet-based quantum approach to approx-SVP/BDD.

CNOT-optimized Shor modular exponentiation and RSA-breaking cost on ion traps.

CNOT-optimized Shor circuits for prime-field ECDLP with resource estimates.