A computational introduction to number theory and algebra
From MaRDI portal
Publication:5301801
zbMATH Open1196.11002MaRDI QIDQ5301801FDOQ5301801
Authors: Victor Shoup 
Publication date: 20 January 2009
Recommendations
factorizationcongruencesdiscrete logarithmfinite fieldsalgebraic structuresprobabilistic algorithmsprimality testing
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) Number-theoretic algorithms; complexity (11Y16) Primality (11Y11) Elementary number theory (11Axx)
Cited In (58)
- Title not available (Why is that?)
- An application of Euclidean algorithm in cryptanalysis of RSA
- Robustly reusable fuzzy extractor with imperfect randomness
- Analysis of NORX: investigating differential and rotational properties
- New point compression method for elliptic \(\mathbb{F}_{q^2}\)-curves of \(j\)-invariant 0
- Smoothness test for polynomials defined over small characteristic finite fields
- Constructing Carmichael numbers through improved subset-product algorithms
- Fractional \(L\)-intersecting families
- Title not available (Why is that?)
- Algebra for computer science
- \(p(x)\)-circulants over finite fields and probability methods of their construction
- Robustly reusable fuzzy extractor from standard assumptions
- Reusable fuzzy extractor from the decisional Diffie-Hellman assumption
- Understanding probabilistic programs
- B-SIDH: supersingular isogeny Diffie-Hellman using twisted torsion
- Inversion of Band-Limited Discrete Fourier Transforms of Binary Images: Uniqueness and Algorithms
- Security analysis of RSA-BSSA
- LWE without modular reduction and improved side-channel attacks against BLISS
- ZCZ -- achieving \(n\)-bit SPRP security with a minimal number of tweakable-block-cipher calls
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems
- A generic construction of fuzzy signature
- LRPC codes with multiple syndromes: near ideal-size KEMs without ideals
- Secure message transmission on directed networks
- PIE: \(p\)-adic encoding for high-precision arithmetic in homomorphic encryption
- Experimental number theory
- Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
- Title not available (Why is that?)
- Primes \(p\) having at most one divisor of \(p-1\) of a specified multiplicative order
- The two-stripe symmetric circulant TSP is in P
- The Bateman-Horn conjecture: heuristic, history, and applications
- Constructing ideal secret sharing schemes based on Chinese remainder theorem
- Isolated elliptic curves and the MOV attack
- Fast Library for Number Theory: An Introduction
- Fast matrix decomposition in \(\mathbb F_2\)
- Square-free OM computation of global integral bases
- A characterization of Sophie Germain primes
- Shortest two disjoint paths in polynomial time
- NP-hardness of Reed-Solomon decoding, and the Prouhet-Tarry-Escott problem
- Satins, lattices, and extended Euclid's algorithm
- The NOF multiparty communication complexity of composed functions
- Pseudorandom functions in NC class from the standard LWE assumption
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
- Accelerating the Delfs-Galbraith algorithm with fast subfield root detection
- Addition of divisors on hyperelliptic curves via interpolation polynomials
- Non-vanishing theta values of characters with special prime conductors
- An Introduction to Affine Arithmetic
- Title not available (Why is that?)
- Security analysis of an identity-based strongly unforgeable signature scheme
- Some indivisibility properties of generalized left-factorials
- Surpassing the Carnot efficiency by extracting imperfect work
- Wildcarded identity-based encryption from lattices
- Breaking SIDH in polynomial time
- On prime primitive roots of \(2^KP+1\)
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- On equations \((-1)^\alpha p^x+ (-1)^\beta (2^k(2p + 1))^y= z^2\) with Sophie Germain prime \(p\)
- Hardness of (M)LWE with semi-uniform seeds
- A historical perspective on Schützenberger-Pinsker inequalities (extended version)
This page was built for publication: A computational introduction to number theory and algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301801)
