English
Related papers

Related papers: Bilinear cryptography using finite $p$-groups of n…

200 papers

In this paper, we study groups of automorphisms of algebraic systems over a set of $p$-adic integers with different sets of arithmetic and coordinate-wise logical operations and congruence relations modulo $p^k,$ $k\ge 1.$ The main result…

Number Theory · Mathematics 2018-06-01 Ekaterina Yurova Axelsson , Andrei Khrennikov

Let $G$ be a $p$-group and let $\chi$ be an irreducible character of $G$. The codegree of $\chi$ is given by $|G:\text{ker}(\chi)|/\chi(1)$. This paper investigates the relationship between the nilpotence class of a group and the inclusion…

Group Theory · Mathematics 2018-11-08 Sarah Croome , Mark L. Lewis

This paper proposes a new signature scheme based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli, IFP) and the discrete logarithm problem(DLP). By combining…

Cryptography and Security · Computer Science 2012-09-24 Abdoul Aziz Ciss , Ahmed Youssef Ould Cheikh

In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels. Symbol-pair read channel has recently been introduced by Cassuto and Blaum to model channels with high write resolution but low read…

Information Theory · Computer Science 2016-12-21 Shunsuke Horii , Toshiyasu Matsushima , Shigeichi Hirasawa

We study a new flexible method to extend linearly the graph of a non-linear, and usually not bijective, function so that the resulting extension is a bijection. Our motivation comes from cryptography. Examples from symmetric cryptography…

Cryptography and Security · Computer Science 2021-12-30 Claude Gravel , Daniel Panario

We introduce a category of dual pairs of finite locally free algebras over a ring. This gives an efficient way to represent finite locally free commutative group schemes. We give a number of algorithms to compute with dual pairs of…

Number Theory · Mathematics 2017-09-29 Peter Bruin

We consider the $k$-error linear complexity of binary sequences derived from Eluer quotients modulo $2p$ ($p>3$ is an odd prime), recently introduced by J. Zhang and C. Zhao. We adopt certain decimal sequences to determine the values of…

Cryptography and Security · Computer Science 2019-10-11 Chenhuang Wu , Vladimir Edemskiy , Chunxiang Xu

We describe Steiner loops of nilpotency class 2 and establish the classification of finite 3-generated nilpotent Steiner loops of nilpotency class 2.

Group Theory · Mathematics 2017-12-22 A. Grishkov , D. Rasskazova , M. Rasskazova , I. Stuhl

Let $q$ be a prime power and $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $n>1$. We introduce the class of the linearized polynomials $L(x)$ over $\mathbb F_{q^n}$ such that…

Number Theory · Mathematics 2016-09-30 Lucas Reis

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Group Theory · Mathematics 2021-10-01 A. S. Detinko , D. L. Flannery

In this paper, we are interested in the construction of a bilinear pseudodifferential calculus. We define some symbolic classes which contains those of Coifman-Meyer. These new classes allow us to consider operators closely related to the…

Classical Analysis and ODEs · Mathematics 2008-02-21 Frederic Bernicot

The interesting properties of classical Goppa code and its effective decoding algorithm (algorithm of patterson) make the most appropriate candidate for use in the MC Eliece cryptosystem. Information leakage which results from the…

Cryptography and Security · Computer Science 2014-03-11 Ahmed Drissi , Ahmed Asimi

First, I construct an isomorphism between the categories of (topological) groups of nilpotency class 2 with 2-divisible center and (topological) Lie rings of nilpotency class 2 with 2-divisible center. That isomorphism allows us to…

Representation Theory · Mathematics 2007-05-23 Aleksandrs Mihailovs

The discrete logarithm problem (DLP) generalizes to the constrained DLP, where the secret exponent $x$ belongs to a set known to the attacker. The complexity of generic algorithms for solving the constrained DLP depends on the choice of the…

Number Theory · Mathematics 2018-12-12 Ilya Mironov , Anton Mityagin , Kobbi Nissim

We introduce two applications of polygraphs to categorification problems. We compute first, from a coherent presentation of an $n$-category, a coherent presentation of its Karoubi envelope. For this, we extend the construction of Karoubi…

Category Theory · Mathematics 2017-04-11 Clément Alleaume

We introduce Poisson double algebroids, and the equivalent concept of double Lie bialgebroid, which arise as second-order infinitesimal counterparts of Poisson double groupoids. We develop their underlying Lie theory, showing how these…

Symplectic Geometry · Mathematics 2022-07-14 Henrique Bursztyn , Alejandro Cabrera , Matias del Hoyo

Difficulty of calculation of discrete logarithm for any arbitrary Field is the basis for security of several popular cryptographic solutions. Pohlig-Hellman method is a popular choice to calculate discrete logarithm in finite field $F_p^*$.…

Number Theory · Mathematics 2021-04-30 Rajeev Kumar

This paper provides an example of structural proxies for black box rings encrypting rings of 2 by 2 matrices of finite fields of odd order.

Group Theory · Mathematics 2024-02-06 Alexandre Borovik , Sukru Yalcinkaya

Nonsingular derivations of modular Lie algebras which have finite multiplicative order play a role in the coclass theory for pro-$p$ groups and Lie algebras. A study of the set N_p of positive integers which occur as orders of nonsingular…

Rings and Algebras · Mathematics 2008-04-22 Sandro Mattarei

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

Information Theory · Computer Science 2015-07-21 Shudi Yang , Zheng-An Yao
‹ Prev 1 4 5 6 7 8 10 Next ›