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