首页/论文/1210.1925

arXiv 1210.19252012-10-06cs.CR

A Class of Non Invertible Matrices in GF (2) for Practical One Way Hash Algorithm

Artan Berisha, Behar Baxhaku, Artan Alidema

备注：: 6 pages, 5 figures, "Published with International Journal of Computer Applications (IJCA)"
发表信息：: Artan Berisha, Behar Baxhaku and Artan Alidema. Article: A Class of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm. International Journal of Computer Applications 54(18):19-20, September 2012
DOI：: 10.5120/8667-2574

英文摘要：

In this paper, we describe non invertible matrix in GF(2)which can be used as multiplication matrix in Hill Cipher technique for one way hash algorithm. The matrices proposed are permutation matrices with exactly one entry 1 in each row and each column and 0 elsewhere. Such matrices represent a permutation of m elements. Since the invention, Hill cipher algorithm was used for symmetric encryption, where the multiplication matrix is the key. The Hill cipher requires the inverse of the matrix to recover the plaintext from cipher text. We propose a class of matrices in GF(2) which are non invertible and easy to generate.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

内存与随机性需求更低的可逆布隆查找表

Invertible Bloom Lookup Tables with Less Memory and Randomness

针对现有IBLTs空间与随机性需求高的问题，提出新构造以O(n + log(1/δ)loglog(1/δ))空间和O(log(log(n)/δ))阶独立哈希函数实现低失败概率，应用于加密压缩问题获渐近更优压缩率。

2024-11-26cs.CRcs.DS

Random Hash Code Generation for Cancelable Fingerprint Templates using Vector Permutation and Shift-order Process

College of Computer and Information Technology（计算机与信息学院）；China Three Gorges University（三峡大学）

Cancelable biometric techniques have been used to prevent the compromise of biometric data by generating and using their corresponding cancelable templates for user authentication. However, the non-invertible distance preserving transformation methods employed in various schemes are often vulnerable to information leakage since matching is performed in the transformed domain. In this paper, we propose a non-invertible distance preserving scheme based on vector permutation and shift-order process. First, the dimension of feature vectors is reduced using kernelized principle component analysis (…

2021-05-21cs.CRcs.CV

Navigating in the Cayley graph of $SL_2(F_p)$ and applications to hashing

Cayley hash functions are based on a simple idea of using a pair of (semi)group elements, $A$ and $B$, to hash the 0 and 1 bit, respectively, and then to hash an arbitrary bit string in the natural way, by using multiplication of elements in the (semi)group. In this paper, we focus on hashing with $2 \times 2$ matrices over $F_p$. Since there are many known pairs of $2 \times 2$ matrices over $Z$ that generate a free monoid, this yields numerous pairs of matrices over $F_p$, for a sufficiently large prime $p$, that are candidates for collision-resistant hashing. However, this trick can "backfi…

2014-09-16cs.CRmath.GR

带可逆置换的单轮Sponge的量子单向性

Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations

该研究证明了Unruh提出的双侧零搜索猜想，通过基于杨子群理论的对称化论证得出随机2n比特置换零对搜索的查询下界，并将其推广至一般双侧搜索问题，最终证明了带可逆置换的单轮Sponge在量子随机谕言机模型下的量子单向性，解决了SHA-3相关的基础性开放问题。

2025-01-16cs.CRquant-ph

Exhaustive Search for Small Dimension Recursive MDS Diffusion Layers for Block Ciphers and Hash Functions

This article presents a new algorithm to find MDS matrices that are well suited for use as a diffusion layer in lightweight block ciphers. Using an recursive construction, it is possible to obtain matrices with a very compact description. Classical field multiplications can also be replaced by simple F2-linear transformations (combinations of XORs and shifts) which are much lighter. Using this algorithm, it was possible to design a 16x16 matrix on a 5-bit alphabet, yielding an efficient 80-bit diffusion layer with maximal branch number.

2013-05-15cs.CR

CHAMP：基于矩阵乘积的凯莱哈希

CHAMP: Cayley HAshing with Matrix Products

Laboratoire d’informatique de l’École polytechnique, LIX, UMR 7161, CNRS（巴黎综合理工学院计算机实验室）；Department of Mathematics, Queens College, City University of New York（纽约市立大学皇后学院数学系）；Department of Mathematics, The City College of New York（纽约市立学院数学系）

提出CHAMP，一种基于有限域上2×2矩阵乘积的凯莱哈希函数，利用半群乘法实现同态性质，并评估其安全性、实现与性能。

2026-10-19cs.CR

更多相关论文收起更多论文

A Vector Space Approach to Generate Dynamic Keys for Hill Cipher

In this paper, a variant of the Hill cipher is proposed. In the classical Hill cipher, an invertible matrix is used for encryption but the scheme is vulnerable to the known-plaintext attack which can reveal the matrix. In our proposed cryptosystem, each plaintext block is encrypted by a new invertible key matrix that thwarts the known-plaintext attack. To generate the invertible matrices which serve as the dynamic keys we make use of the vector spaces, randomly generated basis and non-singular linear transformation. Resulting cipher is secure against the known-plaintext attack.

2021-05-10cs.CR

Probability Distributions for Elliptic Curves in the CGL Hash Function

Hash functions map data of arbitrary length to data of predetermined length. Good hash functions are hard to predict, making them useful in cryptography. We are interested in the elliptic curve CGL hash function, which maps a bitstring to an elliptic curve by traversing an input-determined path through an isogeny graph. The nodes of an isogeny graph are elliptic curves, and the edges are special maps betwixt elliptic curves called isogenies. Knowing which hash values are most likely informs us of potential security weaknesses in the hash function. We use stochastic matrices to compute the expe…

2021-08-14cs.CRmath.NT

The Fifth International Students' Olympiad in Cryptography -- NSUCRYPTO: problems and their solutions

Problems and their solutions of the Fifth International Students' Olympiad in cryptography NSUCRYPTO'2018 are presented. We consider problems related to attacks on ciphers and hash functions, Boolean functions, quantum circuits, Enigma, etc. We discuss several open problems on orthogonal arrays, Sylvester matrices and disjunct matrices. The problem of existing an invertible Sylvester matrix whose inverse is again a Sylvester matrix was completely solved during the Olympiad.

2019-09-19cs.CR

半对合MDS矩阵的刻画

A Characterization of Semi-Involutory MDS Matrices

本文刻画了特征为2的有限域上3×3不可约半对合矩阵，给出仅用对角元素构造MDS半对合矩阵的充要条件，并统计了此类矩阵的数量。

2025-01-01cs.CR

联邦哈希投影潜在因子学习

Federated Hash Projected Latent Factor Learning

College of Computer and Information Science（计算机与信息科学学院）

提出联邦哈希投影潜在因子模型，用二值梯度矩阵替代实值梯度，结合投影汉明距离和隐私增强上传策略，在保护隐私的同时提升二值表示能力，实现精度、效率和隐私的平衡。

2026-06-26cs.CRcs.LG

SL2 homomorphic hash functions: Worst case to average case reduction and short collision search

We study homomorphic hash functions into SL(2,q), the 2x2 matrices with determinant 1 over the field with $q$ elements. Modulo a well supported number theoretic hypothesis, which holds in particular for concrete homomorphisms proposed thus far, we provide a worst case to average case reduction for these hash functions: upto a logarithmic factor, a random homomorphism is as secure as _any_ concrete homomorphism. For a family of homomorphisms containing several concrete proposals in the literature, we prove that collisions of length O(log(q)) can be found in running time O(sqrt(q)). For general …

2015-12-23cs.CRmath.GR