Magali Bardet
2004
A researcher in the Science corpus: 1 paper; trusts 2 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Whom Magali Bardet trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Papers from Magali Bardet's perspective
Ordered by how strongly the researchers Magali Bardet trusts endorse each paper. Same corpus, a different order for every researcher.
- A new efficient algorithm for computing Gröbner bases without reduction to zero (F5) (International Symposium on Symbolic and Algebraic Computation)
- Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases (Annual International Cryptology Conference)
- Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations (International Conference on the Theory and Application of Cryptographic Techniques)
- III. Contributions to the mathematical theory of evolution
- On the Alexander–Hirschowitz theorem
- Implementing the Tate Pairing (International Workshop on Ant Colony Optimization and Swarm Intelligence)
- The random oracle methodology, revisited (JACM)
- Short Signatures from the Weil Pairing
- A Generalized Birthday Problem (Annual International Cryptology Conference)
- Constructing Elliptic Curves with Prescribed Embedding Degrees (International Conference on Security and Cryptography for Networks)