Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Practical post-quantum signature schemes from isomorphism problems of trilinear forms

scientific article; zbMATH DE number 7577801

Language	Label	Description	Also known as
default for all languages	No label defined
English	Practical post-quantum signature schemes from isomorphism problems of trilinear forms	scientific article; zbMATH DE number 7577801

Statements

instance of

scholarly article

0 references

title

Practical post-quantum signature schemes from isomorphism problems of trilinear forms (English)

0 references

0 references

0 references

0 references

0 references

0 references

0 references

30 August 2022

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-07082-2_21

0 references

cites work

STACS 2005

0 references

Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms

0 references

Cryptographic group actions and applications

0 references

Alternating trilinear forms and groups of exponent 6

0 references

Graph isomorphism in quasipolynomial time (extended abstract)

0 references

Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case

0 references

CSI-FiSh: efficient isogeny based signatures through class group computations

0 references

Quantum security analysis of CSIDH

0 references

Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem

0 references

Graph-theoretic algorithms for the ``isomorphism of polynomials'' problem

0 references

Q4279566

0 references

Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice

0 references

A fast isomorphism test for groups whose Lie algebra has genus 2

0 references

The computational complexity of some problems of linear algebra

0 references

Efficient algorithms for solving overdefined systems of multivariate polynomial equations

0 references

CSIDH: an efficient post-quantum commutative group action

0 references

Constructing elliptic curve isogenies in quantum subexponential time

0 references

Trilinear alternating forms on a vector space of dimension 7

0 references

SQISign: compact post-quantum signatures from quaternions and isogenies

0 references

Rainbow, a New Multivariable Polynomial Signature Scheme

0 references

Security of the Fiat-Shamir transformation in the quantum random-oracle model

0 references

Some noteworthy alternating trilinear forms

0 references

Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512

0 references

Asymmetric graphs

0 references

Q4660688

0 references

Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology

0 references

On the complexity of the generalized MinRank problem

0 references

Cryptanalysis of MinRank

0 references

Polynomial Equivalence Problems: Algorithmic and Theoretical Aspects

0 references

SeaSign: compact isogeny signatures from class group actions

0 references

How To Prove Yourself: Practical Solutions to Identification and Signature Problems

0 references

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

0 references

Q2707400

0 references

Quantum mechanical algorithms for the nonabelian hidden subgroup problem

0 references

On p-group isomorphism: search-to-decision, counting-to-decision, and nilpotency class reductions via tensors

0 references

Q4228473

0 references

Tensor rank is NP-complete

0 references

Classification of 8-dimensional trilinear alternating forms over $\mathrm{GF}(2)$

0 references

Algorithms based on $*$-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing

0 references

General linear group action on tensors: a candidate for post-quantum cryptography

0 references

Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies

0 references

Q4941844

0 references

Q4273947

0 references

A Subexponential-Time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

0 references

Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem

0 references

Revisiting post-quantum Fiat-Shamir

0 references

Q3671211

0 references

Practical graph isomorphism. II.

0 references

Trilinear alternating forms on a vector space of dimension 8 over a finite field

0 references

Modular Multiplication Without Trial Division

0 references

The Symmetric Group Defies Strong Fourier Sampling

0 references

Isomorphism testing for $p$-groups

0 references

Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms

0 references

He gives C-sieves on the CSIDH

0 references

Quantum Computation and Lattice Problems

0 references

Finding the permutation between equivalent linear codes: the support splitting algorithm

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

Decomposing $p$-groups via Jordan algebras.

0 references

Graphs on unlabelled nodes with a given number of edges

0 references

Operating degrees for XL vs. $F_{4}/F_{5}$ for generic $\mathcal{M}Q$ with number of equations linear in that of variables

0 references

Identifiers

DOI

10.1007/978-3-031-07082-2_21

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Practical post-quantum signature schemes from isomorphism problems of trilinear forms