Analysis of a public key approach based on polynomial substitution
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Efficient signature schemes based on birational permutations
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
A new identification scheme based on syndrome decoding
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Attacks on the birational permutation signature schemes
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Asymmetric cryptography with S-Boxes
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes
ASIACRYPT '96 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
A New Identification Algorithm
Proceedings of the International Conference on Cryptography: Policy and Algorithms
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient algorithms for solving overdefined systems of multivariate polynomial equations
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Cryptanalysis of the TRMC-4 Public Key Cryptosystem
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
A New Construction of Multivariate Public Key Encryption Scheme through Internally Perturbed Plus
ICCSA '08 Proceedings of the international conference on Computational Science and Its Applications, Part II
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Practical-Sized Instances of Multivariate PKCs: Rainbow, TTS, and lIC-Derivatives
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
PQCrypto '08 Proceedings of the 2nd International Workshop on Post-Quantum Cryptography
Remarks on the Attack of Fouque et al. against the l IC Scheme
IWSEC '08 Proceedings of the 3rd International Workshop on Security: Advances in Information and Computer Security
SSE Implementation of Multivariate PKCs on Modern x86 CPUs
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Building secure tame-like multivariate public-key cryptosystems: the new TTS
ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
A "medium-field" multivariate public-key encryption scheme
CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
Tractable rational map signature
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Efficient cryptanalysis of RSE(2)PKC and RSSE(2)PKC
SCN'04 Proceedings of the 4th international conference on Security in Communication Networks
A study of the security of unbalanced oil and vinegar signature schemes
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Proposal of a signature scheme based on STS trapdoor
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Selecting parameters for the rainbow signature scheme
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
Breaking a new instance of TTM cryptosystems
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Implementing minimized multivariate PKC on low-resource embedded systems
SPC'06 Proceedings of the Third international conference on Security in Pervasive Computing
Roots of square: cryptanalysis of double-layer square and square+
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Reducing the key size of rainbow using non-commutative rings
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
MQQ-SIG: an ultra-fast and provably CMA resistant digital signature scheme
INTRUST'11 Proceedings of the Third international conference on Trusted Systems
Efficient implementations of MQPKS on constrained devices
CHES'12 Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems
Quo vadis quaternion? cryptanalysis of rainbow over non-commutative rings
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Multivariate public key cryptosystems from diophantine equations
Designs, Codes and Cryptography
A variant of rainbow with shorter secret key and faster signature generation
Proceedings of the first ACM workshop on Asia public-key cryptography
| Hi-index | 0.00 |
In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages that combine into a triangular system we call T. In the present paper, we study a more general family of TPM (for "Triangle Plus Minus") schemes: a triangular construction mixed with some u random polynomials and with some r of the beginning equations removed. We go beyond all previous attacks proposed on such cryptosystems using a low degree component of the inverse function. The cryptanalysis of TPM is reduced to a simple linear algebra problem called MinRank(r): Find a linear combination of given matrices that has a small rank r. We introduce a new attack for MinRank called 'Kernel Attack' that works for qr small. We explain that TPM schemes can be used in encryption only if qr is small and therefore they are not secure. As an application, we showed that the TTM cryptosystem proposed by T.T. Moh at CrypTec'99 [15,16] reduces to MinRank(2). Thus, though the cleartext size is 512 bits, we break it in O(252). The particular TTM of [15,16] can be broken in O(228) due additional weaknesses, and we needed only few minutes to solve the challenge TTM 2.1. from the website of the TTM selling company, US Data Security. We also studied TPM in signature, possible only if qu small. It is equally insecure: the 'Degeneracy Attack' we introduce runs in qu polynomial.