Related papers: Cryptographic multilinear maps using pro-p groups
We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…
Let $A$ be a non-metacyclic finite group. Suppose that $A$ acts coprimely on a finite group $G$ in such a manner that $C_G(a)$ is nilpotent for any $a\in A^{\#}$. In the present paper we investigate some conditions on $A$ which imply that…
We address a cryptanalysis of two protocols based on the supposed difficulty of discrete logarithm problem on (semi) groups of matrices over a group ring. We can find the secret key and break entirely the protocols.
We study a particular group law on formal power series in non-commuting variables induced by their interpretation as linear forms on a suitable graded connected word Hopf algebra. This group law is left-linear and is therefore associated to…
Narrowband Internet of Things (NB-IoT) is a wireless communication technology that enables a wide range of applications, from smart cities to industrial automation. As a part of the 5G extension, NB-IoT promises to connect billions of…
We explore finitely generated groups by studying the nilpotent towers and the various Lie algebras attached to such groups. Our main goal is to relate an isomorphism extension problem in the Postnikov tower to the existence of certain…
Performing complex cryptographic tasks will be an essential element in future quantum communication networks. These tasks are based on a handful of fundamental primitives, such as coin flipping, where two distrustful parties wish to agree…
Diffie-Hellman key exchange is at the foundations of public-key cryptography, but conventional group-based Diffie-Hellman is vulnerable to Shor's quantum algorithm. A range of "post-quantum Diffie-Hellman" protocols have been proposed to…
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are…
Authentication is a process by which an entity,which could be a person or intended computer,establishes its identity to another entity.In private and public computer networks including the Internet,authentication is commonly done through…
As the utilization of sensor networks continue to increase, the importance of security becomes more profound. Many industries depend on sensor networks for critical tasks, and a malicious entity can potentially cause catastrophic damage. We…
We provide a new property, called Non-Type-Preserving, for a mixing layer which guarantees protection against algebraic attacks based on the imprimitivity of the group generated by the round functions. Our main result is to present…
We give new upper bounds for the diameters of finite groups which do not depend on a choice of generating set. Our method exploits the commutator structure of certain profinite groups, in a fashion analogous to the Solovay-Kitaev procedure…
Cryptographic primitives are essential for constructing privacy-preserving communication mechanisms. There are situations in which two parties that do not know each other need to exchange sensitive information on the Internet. Trust…
Most traditional applications of quantum cryptography are point-to-point communications, in which only two users can exchange keys. In this letter, we present a network scheme that enable quantum key distribution between multi-user with…
We consider profinite groups in which all commutators are contained in a union of finitely many procyclic subgroups. It is shown that if G is a profinite group in which all commutators are covered by m procyclic subgroups, then G possesses…
As sensor nodes are deployed anywhere in a wireless sensor network, hence their communication can be easily monitored. In these networks, message protection and node identification are very issues. Hence, security of large scale such…
This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed…
A combing is a set of normal forms for a finitely generated group. This article investigates the language-theoretic and geometric properties of combings for nilpotent and polycyclic groups. It is shown that a finitely generated class 2…
We introduce and analyze a novel class of binary operations on finite-dimensional vector spaces over a field K, defined by second-order multilinear expressions with linear shifts. These operations generate polynomials whose degree increases…