Vector finite fields of characteristic two as algebraic support of multivariate cryptography

DOI10.56415/CSJM.V32.04MaRDI QIDQ6546353zbMATH OpenFDO

Authors A. A. Moldovyan, N. A. Moldovyan

Publication date 29 May 2024

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.56415/CSJM.V32.04

zbMATH Keywords

finite algebrasfinite fieldsmultivariate cryptographynon-linear mappingpost-quantum cryptographysystem of power equations

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• scientific article; zbMATH DE number 5691665 (Why is no real title available?)
• Recent developments in multivariate public key cryptosystems

Cited in

(4)

• Complete signature randomization in an algebraic cryptoscheme with a hidden group
• Parameterized unified method for setting vector finite fields for multivariate cryptography
• A method for enhancing randomization in algebraic signature algorithms on non-commutative algebras
• Parameterized method for specifying vector finite fields of arbitrary dimensions

This page was built for publication: Vector finite fields of characteristic two as algebraic support of multivariate cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546353)