Pages that link to "Item:Q5375555"
From MaRDI portal
The following pages link to Efficient Encryption From Random Quasi-Cyclic Codes (Q5375555):
Displaying 25 items.
- Encryption scheme based on expanded Reed-Solomon codes (Q2025358) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- A practicable timing attack against HQC and its countermeasure (Q2158241) (← links)
- A rank metric code-based group signature scheme (Q2163756) (← links)
- Properties of constacyclic codes under the Schur product (Q2182071) (← links)
- Equivalence and characterizations of linear rank-metric codes based on invariants (Q2197149) (← links)
- Cryptanalysis of a code-based one-time signature (Q2200516) (← links)
- Cryptanalysis of a rank-based signature with short public keys (Q2306903) (← links)
- New rank codes based encryption scheme using partial circulant matrices (Q2334447) (← links)
- A new decryption failure attack against HQC (Q2692347) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge (Q2693627) (← links)
- Designing a Public Key Cryptosystem Based on Quasi-cyclic Subspace Subcodes of Reed-Solomon Codes (Q3294870) (← links)
- Area-Time Efficient Computation of Niederreiter Encryption on QC-MDPC Codes for Embedded Hardware (Q4589507) (← links)
- Rank-Metric Codes and Their Applications (Q5863764) (← links)
- Constructions of optimal rank-metric codes from automorphisms of rational function fields (Q6112233) (← links)
- Towards automating cryptographic hardware implementations: a case study of HQC (Q6132753) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- SPANSE: combining sparsity with density for efficient one-time code-based digital signatures (Q6580201) (← links)
- zk-SNARKs from codes with rank metrics (Q6595937) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems (Q6648344) (← links)
- Efficient error-correcting codes for the HQC post-quantum cryptosystem (Q6651927) (← links)