English
Related papers

Related papers: Subsets of groups in public-key cryptography

200 papers

Traditional methods in public key cryptography are based on number theory, and suffer from problems such as dealing with very large numbers, making key creation cumbersome. Here, we propose a new public key cryptosystem based on strings…

Cryptography and Security · Computer Science 2015-01-20 M. Andrecut

In his paper Stadler develops techniques for improving the security of existing secret sharing protocols by allowing to check whether the secret shares given out by the dealer are valid. In particular, the secret sharing is executed over…

Cryptography and Security · Computer Science 2014-08-28 Delaram Kahrobaei , Elizabeth Vidaurre

We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy instances of the knapsack problem and have been broken. The systems considered in the article face this problem: They hide a random (possibly…

Cryptography and Security · Computer Science 2008-03-17 Laurent Evain

This paper presents a novel methodology to test the security of the Diffie-Hellman public key exchange protocol. The security of many cryptographic schemes rely on the hardness of this problem. We are presenting a purely statistical test to…

Statistics Theory · Mathematics 2007-06-13 I. Florescu , A. Myasnikov , A. Mahalanobis

In this survey, we describe a general key exchange protocol based on semidirect product of (semi)groups (more specifically, on extensions of (semi)groups by automorphisms), and then focus on practical instances of this general idea. This…

Cryptography and Security · Computer Science 2016-04-21 Delaram Kahrobaei , Vladimir Shpilrain

We introduce a generalized Anshel-Anshel-Goldfeld (AAG) key establishment protocol (KEP) for magmas. This leads to the foundation of non-associative public-key cryptography (PKC), generalizing the concept of non-commutative PKC. We show…

Cryptography and Security · Computer Science 2012-11-01 Arkadius Kalka

In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication schemes. We present a cryptanalysis of some of these protocols, and introduce some new schemes to fix the problems.

Cryptography and Security · Computer Science 2012-09-28 Mohammad Eftekhari , Herish Abdullah

We consider in this paper the information-theoretic secure key distribution problem over main and wire-tap noise channels with a public discussion in presence of an active adversary. In contrast to the solution proposed by ourselves for a…

Information Theory · Computer Science 2010-05-19 Viktor Yakovlev , Valery Korzhik , Guillermo Morales-Luna , Mihail Bakaev

In this paper we propose cryptosystems based on subgroup distortion in hyperbolic groups. We also include concrete examples of hyperbolic groups as possible platforms.

Group Theory · Mathematics 2016-10-25 Indira Chatterji , Delaram Kahrobaei , Ni Yen Lu

We present here an information theoretic study of Gaussian collective attacks on the continuous variable key distribution protocols based on Gaussian modulation of coherent states. These attacks, overlooked in previous security studies,…

Quantum Physics · Physics 2009-11-10 Frederic Grosshans

This paper introduces a completely new approach to encryption based on group theoretic quantum framework. Quantum cryptography has essentially focused only on key distribution and proceeded with classical encryption algorithm with the…

Discrete Mathematics · Computer Science 2007-05-23 N. Srinivasan , C. Sanjeevakumar , L. Sudarsan , M. Kasi Rajan , R. Venkatesh

A new proposal for group key exchange is introduced which proves to be both efficient and secure and compares favorably with state of the art protocols.

Information Theory · Computer Science 2016-10-31 Juan Antonio Lopez-Ramos , Joachim Rosenthal , Davide Schipani , Reto Schnyder

We construct a new protocol for attribute-based encryption with the use of the modification of the standard secret sharing scheme. In the suggested modification of the secret sharing scheme, only one master key for each user is required…

Cryptography and Security · Computer Science 2020-11-24 M. A. Kudinov , A. A. Chilikov , E. O. Kiktenko , A. K. Fedorov

We show that a linear decomposition attack based on the decomposition method introduced by the first author in monography "Algebraic cryptography" and in a series of papers works by finding the exchanging key in the Abdrecut's protocol.

Group Theory · Mathematics 2015-07-07 Vitaliǐ Roman'kov , Anton Menshov

Bogopolski, Martino and Ventura in [BMV10] introduced a general criteria to construct groups extensions with unsolvable conjugacy problem using short exact sequences. We prove that such extensions have always solvable word problem. This…

Group Theory · Mathematics 2016-04-18 Ali Abdallah

We discuss a new attack, termed a dimension or linear decomposition attack, on several known group-based cryptosystems. This attack gives a polynomial time deterministic algorithm that recovers the secret shared key from the public data in…

Group Theory · Mathematics 2015-06-18 Vitaliǐ Roman'kov , Alexei Myasnikov

It has been suggested that the algebraic structure of AES (and other similar block ciphers) could lead to a weakness exploitable in new attacks. In this paper, we use the algebraic structure of AES-like ciphers to construct a cipher…

Information Theory · Computer Science 2010-11-12 Anna Rimoldi , Massimiliano Sala , Ilia Toli

In this paper, we have proposed a public key cryptography using recursive block matrices involving generalized Fibonacci numbers over a finite field Fp. For this, we define multinacci block matrices, a type of upper triangular matrix…

Cryptography and Security · Computer Science 2022-04-20 Munesh Kumari , Jagmohan Tanti

In this paper we present a new class of convolutional codes that admits an efficient al- gebraic decoding algorithm. We study some of its properties and show that it can decode interesting sequences of errors patterns. The second part of…

Information Theory · Computer Science 2018-04-25 P. Almeida , D. Napp

The article explores the creation of a cryptosystem using a halidon group ring of a dihedral group. Due to the non-abelian nature of the group, constructing the cryptosystem is more challenging compared to an abelian group. The logic used…

Cryptography and Security · Computer Science 2024-10-29 A. Telveenus