Strong keys for tensor isomorphism cryptography

DOI10.4230/LIPICS.MFCS.2025.78MaRDI QIDQ7310253zbMATH OpenFDO

Authors Anand Kumar Narayanan

Publication date 5 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2025.78

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A high dimensional Cramer's rule connecting homogeneous multilinear equations to hyperdeterminants
• Algorithms for matrix code and alternating trilinear form equivalences via new isomorphism invariants
• Faster isomorphism for p-groups of class 2 and exponent p
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 66402 (Why is no real title available?)
• Hyperdeterminants
• Hyperdeterminants of polynomials
• Most tensor problems are NP-hard
• On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
• On the duals of Segre varieties
• Practical post-quantum signature schemes from isomorphism problems of trilinear forms
• Quantum mechanical algorithms for the nonabelian hidden subgroup problem
• Rare structures in tensor graphs. Bermuda triangles for cryptosystems based on the tensor isomorphism problem
• Singularities of hyperdeterminants
• Solving the tensor isomorphism problem for special orbits with low rank points: cryptanalysis and repair of an Asiacrypt 2023 commitment scheme
• Take your MEDS: digital signatures from matrix code equivalence
• The Binet--Cauchy theorem for the hyperdeterminant of boundary format multi-dimensional matrices

This page was built for publication: Strong keys for tensor isomorphism cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7310253)