scientific article; zbMATH DE number 5494431

Publication date: 20 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

finite fields congruences probabilistic algorithms factorization algebraic structures discrete logarithm primality testing

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to number theory (11-01) Factorization (11Y05) Primality (11Y11) Elementary number theory (11Axx)

Related Items

Smoothness test for polynomials defined over small characteristic finite fields, An application of Euclidean algorithm in cryptanalysis of RSA, Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions, Robustly reusable fuzzy extractor with imperfect randomness, Understanding Probabilistic Programs, ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls, LWE without modular reduction and improved side-channel attacks against BLISS, A generic construction of fuzzy signature, The two-stripe symmetric circulant TSP is in P, Obfuscated fuzzy Hamming distance and conjunctions from subset product problems, Isolated elliptic curves and the MOV attack, NP-Hardness of Reed--Solomon Decoding, and the Prouhet--Tarry--Escott Problem, Analysis of NORX: Investigating Differential and Rotational Properties, Unnamed Item, Square-free OM computation of global integral bases, Security analysis of RSA-BSSA, Breaking SIDH in polynomial time, Addition of divisors on hyperelliptic curves via interpolation polynomials, Accelerating the Delfs-Galbraith algorithm with fast subfield root detection, LRPC codes with multiple syndromes: near ideal-size KEMs without ideals, On prime primitive roots of \(2^KP+1\), Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms, Surpassing the Carnot efficiency by extracting imperfect work, Hardness of (M)LWE with semi-uniform seeds, B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion, A characterization of Sophie Germain primes, Constructing ideal secret sharing schemes based on Chinese remainder theorem, Robustly reusable fuzzy extractor from standard assumptions, Secure message transmission on directed networks, The Bateman-Horn conjecture: heuristic, history, and applications, The NOF multiparty communication complexity of composed functions, Security analysis of an identity-based strongly unforgeable signature scheme, The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs, Pseudorandom functions in NC class from the standard LWE assumption, New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0, Fractional \(L\)-intersecting families, Unnamed Item, Reusable fuzzy extractor from the decisional Diffie-Hellman assumption, Fast matrix decomposition in \(\mathbb F_2\), Unnamed Item, Non-vanishing theta values of characters with special prime conductors, Wildcarded identity-based encryption from lattices, Satins, lattices, and extended Euclid's algorithm, Chosen-ciphertext lattice-based public key encryption with equality test in standard model, Shortest Two Disjoint Paths in Polynomial Time, \(p(x)\)-circulants over finite fields and probability methods of their construction, Constructing Carmichael numbers through improved subset-product algorithms