Pages that link to "Item:Q5491471"
From MaRDI portal
The following pages link to Progress in Cryptology – Mycrypt 2005 (Q5491471):
Displaying 20 items.
- The extended \(k\)-tree algorithm (Q431783) (← links)
- Collision attack on \({\mathtt Grindahl}\) (Q901374) (← links)
- New code-based cryptographic accumulator and fully dynamic group signature (Q2099154) (← links)
- Computational aspects of retrieving a representation of an algebraic geometry code (Q2437321) (← links)
- Faster 2-Regular Information-Set Decoding (Q3005582) (← links)
- Really Fast Syndrome-Based Hashing (Q3011909) (← links)
- Statistical Decoding of Codes over $\mathbb{F}_q$ (Q3102793) (← links)
- Cryptanalysis of Grindahl (Q3498399) (← links)
- Syndrome Based Collision Resistant Hashing (Q3535357) (← links)
- (Q4638056) (← links)
- Interpreting Hash Function Security Proofs (Q4933215) (← links)
- A digital signature scheme $\mathrm{mCFS}^{\mathrm{QC{-}LDPC}}$ based on $\mathrm{QC}$-$\mathrm{LDPC}$ codes (Q5071487) (← links)
- Analysis of Multivariate Hash Functions (Q5385529) (← links)
- Linearization Attacks Against Syndrome Based Hashes (Q5458196) (← links)
- Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes (Q5458930) (← links)
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions (Q6083670) (← links)
- Short signatures from regular syndrome decoding in the head (Q6083678) (← links)
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs (Q6104347) (← links)
- Oblivious transfer with constant computational overhead (Q6138086) (← links)
- Efficient code-based fully dynamic group signature scheme (Q6201340) (← links)