Finite algebras in the design of multivariate cryptography algorithms

DOI10.56415/BASM.Y2023.I3.P80MaRDI QIDQ6615588

N. A. Moldovyan

Publication date: 8 October 2024

Published in: Buletinul Academiei de Științe a Republicii Moldova. Matematica (Search for Journal in Brave)

zbMATH Keywords

finite fieldspower polynomialsfinite algebraspost-quantum cryptographysignature algorithmnon-linear mappingsystem of power equationspublic encryption system

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Computational aspects of associative rings (general theory) (16Z05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Discrete mathematics in relation to computer science (68R99) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Recent Developments in Multivariate Public Key Cryptosystems
• Multivariate Public Key Cryptosystems

This page was built for publication: Finite algebras in the design of multivariate cryptography algorithms

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