作者: Danilo Gligoroski , Rune Steinsmo Ødegård , Rune Erlend Jensen , Ludovic Perret , Jean-Charles Faugère
DOI: 10.1007/978-3-642-32298-3_13
关键词: Discrete mathematics 、 Orders of magnitude (bit rate) 、 Computer science 、 Elliptic Curve Digital Signature Algorithm 、 Quadratic equation 、 Signature (topology) 、 Smart card 、 Algorithm 、 Digital signature 、 Random oracle 、 Public-key cryptography
摘要: We present MQQ-SIG, a signature scheme based on "Multivariate Quadratic Quasigroups". The MQQ-SIG has public key consisting of $\frac{n}{2}$ quadratic polynomials in n variables where n=160, 192, 224 or 256. Under the assumption that solving systems MQQ's equations is as hard random equations, we prove oracle model our CMA (Chosen-Message Attack) resistant. From efficiency point view, signing and verification processes are three orders magnitude faster than RSA ECDSA. Compared with other MQ schemes, both advantages disadvantages. Advantages it more times smaller private keys (from 401 to 593 bytes), process an order schemes. That makes very suitable for implementation smart cards embedded systems. However, big 125 512 Kb) not size be small.