The following pages link to Magali Bardet (Q531655):
Displaying 13 items.
- Complexity reduction of C-algorithm (Q531656) (← links)
- Isochronicity conditions for some planar polynomial systems. II. (Q630626) (← links)
- On the decoding of binary cyclic codes with the Newton identities (Q733502) (← links)
- On the complexity of solving quadratic Boolean systems (Q1931429) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- An algebraic approach to the rank support learning problem (Q2118561) (← links)
- On the complexity of the \(F_5\) Gröbner basis algorithm (Q2343240) (← links)
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems (Q2692353) (← links)
- Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes (Q2802612) (← links)
- Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme (Q2814718) (← links)
- Revisiting algebraic attacks on MinRank and on the rank decoding problem (Q6063136) (← links)
- Improvements of Algebraic Attacks for solving the Rank Decoding and MinRank problems (Q6335155) (← links)
- Polynomial time key-recovery attack on high rate random alternant codes (Q6576622) (← links)
