An identification system based on the explicit isomorphism problem

12/21/2018
by   Sándor Z. Kiss, et al.
0

We propose various zero knowledge protocols based on the algorithmic problem of finding isomorphisms between central simple algebras over number fields given by structure constants. We also design a protocol which is based on the hardness of finding an element with a prescribed minimal polynomial in a central simple algebra given by structure constants. This protocol allows arbitrarily long challenges and thus can be turned into a digital signature scheme.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/23/2021

A DSA-like digital signature protocol

In this paper we propose a new digital signature protocol inspired by th...
research
06/22/2020

Primitive idempotents in central simple algebras over 𝔽_q(t) with an application to coding theory

We consider the algorithmic problem of computing a primitive idempotent ...
research
06/20/2023

BASS: Boolean Automorphisms Signature Scheme

We offer a digital signature scheme using Boolean automorphisms of a mul...
research
07/14/2020

Algorithmic applications of the corestriction of central simple algebras

Let L be a separable quadratic extension of either ℚ or 𝔽_q(t). We propo...
research
07/17/2023

RYDE: A Digital Signature Scheme based on Rank-Syndrome-Decoding Problem with MPCitH Paradigm

We present a signature scheme based on the Syndrome-Decoding problem in ...
research
10/26/2022

Learning to Configure Computer Networks with Neural Algorithmic Reasoning

We present a new method for scaling automatic configuration of computer ...
research
01/02/2020

Algorithmic Number On the Forehead Protocols Yielding Dense Ruzsa-Szemerédi Graphs and Hypergraphs

We describe algorithmic Number On the Forehead protocols that provide de...

Please sign up or login with your details

Forgot password? Click here to reset