Pages that link to "Item:Q4371902"
From MaRDI portal
The following pages link to Is code equivalence easy to decide? (Q4371902):
Displayed 29 items.
- Semantic security for the McEliece cryptosystem without random oracles (Q1009060) (← links)
- Hulls of cyclic and negacyclic codes over finite fields (Q2011495) (← links)
- Hermitian hulls of constacyclic codes and their applications to quantum codes (Q2114037) (← links)
- Computing normalisers of intransitive groups (Q2142483) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- On equivalence of cyclic codes, generalization of a quasi-twisted search algorithm, and new linear codes (Q2324762) (← links)
- Determining whether a given cryptographic function is a permutation of another given cryptographic function -- a problem in intellectual property (Q2333818) (← links)
- On isomorphism testing of groups with normal Hall subgroups (Q2637286) (← links)
- Hulls of cyclic serial codes over a finite chain ring (Q2667089) (← links)
- New binary and ternary quasi-cyclic codes with good properties (Q2687503) (← links)
- A generalization of cyclic code equivalence algorithm to constacyclic codes (Q2692951) (← links)
- Quantum algorithms for algebraic problems (Q3077033) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory (Q3193273) (← links)
- Zero-Knowledge Interactive Proof Systems for New Lattice Problems (Q3460104) (← links)
- On a Gröbner bases structure associated to linear codes (Q3637823) (← links)
- (Q4990142) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q4993283) (← links)
- Computing an Invariant of a Linear Code (Q5014679) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- (Q5051428) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography (Q5739036) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Tensor Codes and Their Invariants (Q6077976) (← links)
- On the computational hardness of the code equivalence problem in cryptography (Q6112221) (← links)
- A new algorithm for equivalence of cyclic codes and its applications (Q6115441) (← links)
- Galois hulls of constacyclic codes over finite fields (Q6159430) (← links)
- On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\) (Q6177402) (← links)