Cryptanalytic records
Algorithms, bounds and history.
282 results · 158 papers · 129 categories
Lattices
6 problemsSVPShortest Vector ProblemFind a shortest nonzero lattice vector.19 variants · 101 entriesCVPClosest Vector ProblemFind the lattice point closest to a target.14 variants · 25 entriesSISShort Integer SolutionFind a short nonzero modular relation.1 variants · 0 entriesLWELearning With ErrorsRecover or distinguish a noisy linear system.19 variants · 39 entriesDGSDiscrete Gaussian SamplingSample lattice vectors according to a discrete Gaussian.9 variants · 12 entriesBDDBounded Distance DecodingDecode a target promised to be close to a lattice, with its radius and preprocessing model fixed.4 variants · 7 entries
Codes
6 problemsBinary decodingDecoding random binary codesDecode a random binary linear code at a specified rate and error weight.6 variants · 28 entriesq-SDDecoding random q-ary codesHamming-metric syndrome decoding over a specified finite field. Alphabet, rate, error weight and cost unit must be fixed.2 variants · 0 entriesRank-SDRank syndrome decodingSyndrome decoding in the rank metric over F_(q^m); n, m, k and rank weight are separate parameters.2 variants · 1 entriesGoppa-SDDecoding binary Goppa codesRecover an error from a public scrambled binary-Goppa parity-check matrix and syndrome, without the private decoding trapdoor.1 variants · 0 entriesGoppa-KRGoppa-code key recoveryRecover equivalent hidden support and Goppa polynomial from the public code. This is distinct from decoding a single ciphertext.1 variants · 2 entriesLPNLearning Parity with NoiseRecover a binary secret from uniformly random binary linear equations corrupted by independent Bernoulli noise.7 variants · 11 entries
Multivariate
3 problemsUOVUnbalanced Oil and VinegarKey recovery and forgery for UOV systems.2 variants · 0 entriesMQMultivariate quadratic equationsSolve a system of m quadratic equations in n variables over a specified finite field.7 variants · 8 entriesMinRankMinRankFind a low-rank linear combination of given matrices; dimensions, rank and field must be specified.1 variants · 0 entries
Isogenies
4 problemsSSIPSupersingular isogeny searchConstruct an explicit isogeny between two supersingular elliptic curves.5 variants · 8 entriesOrdinary isogenyOrdinary isogeny searchConstruct an isogeny between ordinary curves with the same endomorphism ring.2 variants · 2 entriesSIDHSIDH key recoveryRecover a secret isogeny using a SIDH public key, including its auxiliary torsion-point images.2 variants · 2 entriesCM actionCM class-group action inversionInvert the commutative ideal-class-group action, including CRS and CSIDH settings.1 variants · 1 entries
Factoring & RSA
3 problemsIFPInteger factorizationFind the prime factorization of a composite integer N; distinguish input length log N from the integer N itself.6 variants · 13 entriesSmall-factor IFPFinding small prime factorsFind a prime divisor p of an integer N; running time can depend on p independently of the bitlength of N.1 variants · 1 entriesRSA factoringFactoring RSA moduliFactor balanced semiprimes without supplied structure or partial key information. Asymptotic bounds are separate from concrete challenge factorizations.2 variants · 3 entries
DLog
2 problemsGeneric DLPGeneric-group discrete logarithmsRecover an exponent in a cyclic group from group operations; generic algorithms do not exploit a field or curve representation.2 variants · 2 entriesFinite-field DLPFinite-field discrete logarithmsCompute discrete logarithms in multiplicative groups of finite fields, separating prime fields, characteristic growth and extension structure.8 variants · 11 entries