The following pages link to Daniel Cabarcas (Q1644780):
Displaying 16 items.
- Rank analysis of cubic multivariate cryptosystems (Q1644784) (← links)
- Key recovery attack for ZHFE (Q1673614) (← links)
- On the complexity of ``Superdetermined'' minrank instances (Q2302132) (← links)
- Efficient public-key operation in multivariate schemes (Q2415397) (← links)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
- Efficient ZHFE Key Generation (Q2802620) (← links)
- On the Efficiency of Provably Secure NTRU (Q2938672) (← links)
- Efficient Integer Encoding for Homomorphic Encryption via Ring Isomorphisms (Q2946465) (← links)
- Discrete Ziggurat: A Time-Memory Trade-Off for Sampling from a Gaussian Distribution over the Integers (Q2949542) (← links)
- Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$ (Q3558304) (← links)
- MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals (Q3578263) (← links)
- A Selection of Recent Lattice-Based Signature and Encryption Schemes (Q4906256) (← links)
- Linear algebra to compute syzygies and Gröbner bases (Q5254155) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
- Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems (Q6335155) (← links)
- Privacy-preserving edit distance computation using secret-sharing two-party computation (Q6619924) (← links)
