Pages that link to "Item:Q4829810"

The following pages link to Complexity of lattice problems. A cryptographic perspective. (Q4829810):

Displaying 37 items.

• On ideal lattices, Gröbner bases and generalized hash functions (Q4563584) (← links)
• Local Testing of Lattices (Q4565131) (← links)
• Predicting nonlinear pseudorandom number generators (Q4671848) (← links)
• Short Bases of Lattices over Number Fields (Q4931647) (← links)
• Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
• Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
• A chaotic lattice field theory in one dimension* (Q5054696) (← links)
• Application of algebraic-ring in key exchange protocol (Q5076475) (← links)
• Hermite’s Constant and Lattice Algorithms (Q5188538) (← links)
• Cryptographic Functions from Worst-Case Complexity Assumptions (Q5188549) (← links)
• Security and Trust in Sensor Networks (Q5391135) (← links)
• Algorithmic Problems for Metrics on Permutation Groups (Q5448642) (← links)
• Predicting Lattice Reduction (Q5458584) (← links)
• Cryptography Based on Quadratic Forms: Complexity Considerations (Q5504549) (← links)
• Revisiting Lattice Attacks on Overstretched NTRU Parameters (Q5738868) (← links)
• (Q5855592) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• Large algebraic integers (Q6050862) (← links)
• Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice (Q6083665) (← links)
• Reconstructing points of superelliptic curves over a prime finite field (Q6089463) (← links)
• Log-\(\mathcal{S}\)-unit lattices using explicit Stickelberger generators to solve approx ideal-SVP (Q6135454) (← links)
• The Random Phase Approximation for Interacting Fermi Gases in the Mean-Field Regime (Q6148317) (← links)
• A New Insight—Proxy Re-encryption Under LWE with Strong Anti-collusion (Q6163695) (← links)
• Norm relations and computational problems in number fields (Q6175935) (← links)
• A short basis of the Stickelberger ideal of a cyclotomic field (Q6181103) (← links)
• On elliptic curve $L$-functions integrated encryption scheme (Q6196946) (← links)
• New Results on the Remote Set Problem and Its Applications in Complexity Study (Q6489321) (← links)
• Public-key cryptosystems and signature schemes from \(p\)-adic lattices (Q6543365) (← links)
• On average coherence of cyclotomic lattices (Q6585106) (← links)
• Ideal-SVP is hard for small-norm uniform prime ideals (Q6587946) (← links)
• Minkowski's successive minima in convex and discrete geometry (Q6594637) (← links)
• Towards tightly secure short linearly homomorphic signatures (Q6613999) (← links)
• On the SVP for low-dimensional circulant lattices (Q6645172) (← links)
• Attacking (EC)DSA with partially known multiples of nonces (Q6647745) (← links)
• A systematic study of sparse LWE (Q6652897) (← links)
• On the smallest ratio problem of lattice bases (Q6666549) (← links)
• Improved computation of polynomial roots over number fields when using complex embeddings (Q6671812) (← links)