Connecting the complexity of MQ- and code-based cryptosystems

DOI10.1515/TMMP-2017-0025MaRDI QIDQ4606490zbMATH OpenOpenAlexWikidataFDO

Authors Pavol Zajac

Publication date 7 March 2018

Published in Tatra Mountains Mathematical Publications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/tmmp-2017-0025

zbMATH Keywords

decoding problemMQ problemMultiple-Right-Hand-Sides (MRHS) equation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On the equivalence of two post-quantum cryptographic families
• An estimator for the hardness of the MQ problem
• Multivariable algebra theory and its application in cryptography
• Multivariate encryption schemes based on the constrained MQ problem
• Analysis of the MQQ public key cryptosystem

Cited in

(4)

• On the equivalence of two post-quantum cryptographic families
• Efficient Implementations of MQPKS on Constrained Devices
• Polynomial reduction from syndrome decoding problem to regular decoding problem
• Algebraic cryptanalysis of Ascon using MRHS equations

This page was built for publication: Connecting the complexity of MQ- and code-based cryptosystems

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