Pages that link to "Item:Q4156300"
From MaRDI portal
The following pages link to On the inherent intractability of certain coding problems (Corresp.) (Q4156300):
Displaying 50 items.
- Enhanced public key security for the McEliece cryptosystem (Q271573) (← links)
- Quantum computation vs. firewalls (Q303315) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- On the ideal associated to a linear code (Q326292) (← links)
- Identity based identification from algebraic coding theory (Q391761) (← links)
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- Efficient computation outsourcing for inverting a class of homomorphic functions (Q508607) (← links)
- A new secret sharing scheme (Q509279) (← links)
- A code-based group signature scheme (Q510499) (← links)
- Practical entanglement distillation scheme using recurrence method and quantum low density parity check codes (Q548217) (← links)
- Monadic second-order model-checking on decomposable matroids (Q548278) (← links)
- Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes (Q626942) (← links)
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures (Q662167) (← links)
- On covering problems of codes (Q675858) (← links)
- Secure and practical randomized stream ciphers based on Reed-Solomon codes (Q681906) (← links)
- Boolean autoencoders and hypercube clustering complexity (Q690669) (← links)
- Key masking using biometry (Q764394) (← links)
- On quaternary Goppa codes (Q776285) (← links)
- Computer algebra tales on Goppa codes and McEliece cryptography (Q782704) (← links)
- Computing sharp recovery structures for locally recoverable codes (Q782862) (← links)
- On the security of the modified dual-Ouroboros PKE using Gabidulin codes (Q825046) (← links)
- Fast \(\ell _{1}\) minimization by iterative thresholding for multidimensional NMR spectroscopy (Q836250) (← links)
- Error-correcting codes and cryptography (Q937222) (← links)
- The complexity of the weight problem for permutation and matrix groups. (Q960944) (← links)
- A method for efficiently computing the number of codewords of fixed weights in linear codes (Q1005242) (← links)
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- On the subgroup distance problem. (Q1011736) (← links)
- Separating models of learning with faulty teachers (Q1017667) (← links)
- Cryptanalysis of an E0-like combiner with memory (Q1021238) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Classification of Griesmer codes and dual transform (Q1043574) (← links)
- On the covering radius of cyclic linear codes and arithmetic codes (Q1065761) (← links)
- New approaches to reduced-complexity decoding (Q1180151) (← links)
- Rigid linear binary codes (Q1207772) (← links)
- Factorization properties of lattices over the integers (Q1345515) (← links)
- On finding a cycle basis with a shortest maximal cycle (Q1349748) (← links)
- Improved identification schemes based on error-correcting codes (Q1352426) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- Decoding of Reed Solomon codes beyond the error-correction bound (Q1361883) (← links)
- Efficient authentication from hard learning problems (Q1698400) (← links)
- Solving systems of linear Boolean equations with noisy right-hand sides over the reals (Q1744342) (← links)
- DAGS: key encapsulation using dyadic GS codes (Q1755960) (← links)
- A protocol for provably secure authentication of a tiny entity to a high performance computing one (Q1793779) (← links)
- Cryptanalysis of the Wu-Dawson public key cryptosystem (Q1808848) (← links)
- Computing sparse multiples of polynomials (Q1934308) (← links)
- Monotonic optimization based decoding for linear codes (Q1941018) (← links)
- Decomposition of modular codes for computing test sets and Graver basis (Q1949046) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- Cryptanalysis of a code-based full-time signature (Q1981793) (← links)
- Minimal linear codes arising from blocking sets (Q2025113) (← links)
