On multivariate public keys based on a pair of transformations with density gap

DOI10.15407/DOPOVIDI2018.09.021MaRDI QIDQ4558995zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 30 November 2018

Published in Reports of the National Academy of Sciences of Ukraine (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

Full work available at URL https://doi.org/10.15407/dopovidi2018.09.021

zbMATH Keywords

multivariate cryptographypost-quantum cryptographyalgebraic graphpublic keysestimate of complexity

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• On multivariate cryptosystems based on computable maps with invertible decomposition
• On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
• Poly-dragon: an efficient multivariate public key cryptosystem
• On the Families of Stable Multivariate Transformations of Large Order and Their Cryptographical Applications
• On new multivariate cryptosystems with nonlinearity gap

Cited in

(7)

• On the Families of Stable Multivariate Transformations of Large Order and Their Cryptographical Applications
• On multivariate cryptosystems based on computable maps with invertible decomposition
• On new multivariate cryptosystems with nonlinearity gap
• On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree
• On some properties of graph based public keys
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Poly-dragon: an efficient multivariate public key cryptosystem

This page was built for publication: On multivariate public keys based on a pair of transformations with density gap

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