Applying quick exponentiation for block upper triangular matrices

DOI10.1016/j.amc.2006.05.078zbMath1278.11037OpenAlexW2083993250MaRDI QIDQ865509

José-Francisco Vicent, Francisco Ferrández, Rafael Álvarez, Antonio Zamora

Publication date: 19 February 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.078

zbMATH Keywords

group algebracompanion matrixdiscrete logarithm problemprimitive polynomialblock matrixtriangular matrixmatrix orderquick exponentiation

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Matrices, determinants in number theory (11C20)

Related Items

Analysis and design of a secure key exchange scheme, A quick exponentiation algorithm for \(3\times 3\) block upper triangular matrices

Cites Work

• Efficient and optimal exponentiation in finite fields
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Algorithms for exponentiation in finite fields
• A polynomial form for logarithms modulo a prime (Corresp.)
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• A Survey of Fast Exponentiation Methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item