The following pages link to (Q4829810):
Displaying 50 items.
- Torsion part of \(\mathbb{Z}\)-module (Q271895) (← links)
- Lattice-based linearly homomorphic signatures in the standard model (Q284579) (← links)
- Divisible \(\mathbb{Z}\)-modules (Q306629) (← links)
- Lattice of \(\mathbb{Z}\)-module (Q306630) (← links)
- Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound (Q389991) (← links)
- Improvements in closest point search based on dual HKZ-bases (Q391764) (← links)
- PotLLL: a polynomial time version of LLL with deep insertions (Q398939) (← links)
- Hardness of approximating the closest vector problem with pre-processing (Q430834) (← links)
- Rotated \(D_n\)-lattices (Q452375) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- Submodule of free \(\mathbb Z\)-module (Q467803) (← links)
- Lattices from maximal orders into quaternion algebras (Q479271) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme (Q498985) (← links)
- Convex minization over \(\mathbb Z^2\) (Q631217) (← links)
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra (Q695630) (← links)
- An effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
- Optimal routing in double loop networks (Q995561) (← links)
- Inferring sequences produced by a linear congruential generator on elliptic curves missing high-order bits (Q1009176) (← links)
- Sampling methods for shortest vectors, closest vectors and successive minima (Q1014636) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Isomorphism theorem on vector spaces over a ring (Q1688742) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- A note on suborthogonal lattices (Q1698584) (← links)
- Simultaneous approximation problems of \(p\)-adic numbers and \(p\)-adic knapsack cryptosystems -- Alice in \(p\)-adic numberland (Q1702094) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- Better path-finding algorithms in LPS Ramanujan graphs (Q1755951) (← links)
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme (Q1784985) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- The inapproximability of lattice and coding problems with preprocessing (Q1881262) (← links)
- Lattice-based algorithms for number partitioning in the hard phase (Q1926495) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- On the number of lattice points in a small sphere and a recursive lattice decoding algorithm (Q1934244) (← links)
- Greedy algorithm computing Minkowski reduced lattice bases with quadratic bit complexity of input vectors (Q1938739) (← links)
- Vulnerable public keys in NTRU cryptosystem (Q1997177) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key (Q2037197) (← links)
- Tight and optimal reductions for signatures based on average trapdoor preimage sampleable functions and applications to code-based signatures (Q2055702) (← links)
- On the ideal shortest vector problem over random rational primes (Q2056701) (← links)
- Computing the covering radius of a polytope with an application to lonely runners (Q2095112) (← links)
- Search for combinatorial objects using lattice algorithms -- revisited (Q2115837) (← links)
- A trace map attack against special ring-LWE samples (Q2128748) (← links)
- Lattice-based fault attacks on deterministic signature schemes of ECDSA and EdDSA (Q2152160) (← links)
- Application of automorphic forms to lattice problems (Q2154470) (← links)
- Rotated \(A_n \)-lattice codes of full diversity (Q2158231) (← links)
- On some computational problems in local fields (Q2165454) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Algorithms for computing bases for 3-variable homogeneous integer-valued polynomials (Q2186049) (← links)
