MPC in the head using the subfield bilinear collision problem
From MaRDI portal
Recommendations
Cites work
- A new index calculus algorithm with complexity L(1/4+o(1)) in small characteristic
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Constrained pseudorandom functions and their applications
- Foundations of Cryptography
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- Half-tree: halving the cost of tree expansion in COT and DPF
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Multivariate public key cryptosystems
- New directions in cryptography
- Solution theory for systems of bilinear equations
- Syndrome decoding in the head: shorter signatures from zero-knowledge proofs
- Technical history of discrete logarithms in small characteristic finite fields. The road from subexponential to quasi-polynomial complexity
- The return of the SDitH
Cited in
(2)
This page was built for publication: MPC in the head using the subfield bilinear collision problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648188)
