Cryptographic applications of 3x3 block upper triangular matrices

Authors:
Rafael Álvarez;Francisco Martínez;José-Francisco Vicent;Antonio Zamora
Affiliations:
Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain;Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain;Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain;Dpto. de Ciencia de la Computación e Inteligencia Artificial, Universidad de Alicante, Alicante, Spain
Venue:
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
Year:
2012

Citing 3
Cited 1

Discrete logarithms in GF(p)

Algorithmica
Introduction to finite fields and their applications

Introduction to finite fields and their applications
Handbook of Applied Cryptography

Handbook of Applied Cryptography

Cryptanalysis of Álvarez et al. key exchange scheme

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe a special group of block upper triangular matrices with 3 ×3 blocks and elements in a finite field. We also verify that, with properly chosen parameters, the cardinality of the subgroup generated by one matrix of this group can be as large as required. Then we introduce two examples of this group of matrices employed in cryptography among the many available: a key exchange scheme and a pseudorandom generator.