Zobrazeno 1 - 10
of 174
pro vyhledávání: '"KAHROBAEI, DELARAM"'
We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be non-linear
Externí odkaz:
http://arxiv.org/abs/2408.14355
There are many group-based cryptosystems in which the security relies on the difficulty of solving Conjugacy Search Problem (CSP) and Simultaneous Conjugacy Search Problem (SCSP) in their underlying platform groups. In this paper we give a cryptanaly
Externí odkaz:
http://arxiv.org/abs/2309.13928
Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. From an arbitrary basis $\mathcal B$ of $H^1(A(\Gamma),\mathbb F)$ over an arbitrary field, we construct a natural graph $\Gamma_{\mathcal B}$ from the
Externí odkaz:
http://arxiv.org/abs/2309.05495
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian simple groups
Externí odkaz:
http://arxiv.org/abs/2308.14725
In 1991 the first public key protocol involving automaton groups has been proposed. In this paper we give a survey about algorithmic problems around automaton groups which may have potential applications in cryptography. We then present a new public
Externí odkaz:
http://arxiv.org/abs/2306.10522
In this paper, we present a new diverse class of post-quantum group-based Digital Signature Schemes (DSS). The approach is significantly different from previous examples of group-based digital signatures and adopts the framework of group action-based
Externí odkaz:
http://arxiv.org/abs/2304.12900
Group-based cryptography is a relatively unexplored family in post-quantum cryptography, and the so-called Semidirect Discrete Logarithm Problem (SDLP) is one of its most central problems. However, the complexity of SDLP and its relationship to more
Externí odkaz:
http://arxiv.org/abs/2209.02814
We define new families of Tillich-Z\'emor hash functions, using higher dimensional special linear groups over finite fields as platforms. The Cayley graphs of these groups combine fast mixing properties and high girth, which together give rise to goo
Externí odkaz:
http://arxiv.org/abs/2207.03987
The root extraction problem in braid groups is the following: given a braid $\beta \in \mathcal{B}_n$ and a number $k\in \mathbb{N}$, find $\alpha\in \mathcal{B}_n$ such that $\alpha^k=\beta$. In the last decades, many cryptosystems such as authentic
Externí odkaz:
http://arxiv.org/abs/2203.15898