Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Fast Computation of Isomorphisms Between Finite Fields Using Elliptic Curves

    We propose a randomized algorithm to compute isomorphisms between finite fields using elliptic curves. To compute an isomorphism between two fields of cardinality

    Anand Kumar Narayanan in Arithmetic of Finite Fields (2018)

  2. No Access

    Chapter and Conference Paper

    Algorithms for Matrix Code and Alternating Trilinear Form Equivalences via New Isomorphism Invariants

    We devise algorithms for finding equivalences of trilinear forms over finite fields modulo linear group actions. Our focus is on two problems under this umbrella, Matrix Code Equivalence (MCE) and Alternating Tri...

    Anand Kumar Narayanan, Youming Qiao, Gang Tang in Advances in Cryptology – EUROCRYPT 2024 (2024)