A public-key cryptographic algorithm based on multivariate quadratic equations is one of promising post-quantum alternatives for current public-key cryptography. The security of multivariate quadratic schemes has been sufficiently analyzed mathematically, but few works have been devoted to implementation attacks. In this paper, we present algebraic fault analysis of two well-known multivariate quadratic schemes, UOV and Rainbow, which combines fault attacks with key recovery attacks using good keys. We focus on fault attacks which cause faults on random Vinegar values used in signing.

Multivariate quadratic (MQ) equations-based cryptography is one of the most promising alternatives for currently used public-key cryptographic algorithms in the post-quantum era.

A fish school scatters rapidly when it encounters a predator and then returns to schooling once the predator passed by.

In this paper, we deal with a liver fibrosis classification problem using ultrasound B-mode images.

We study the asymptotic behavior of a second-order swarm model on the unit sphere in both particle and kinetic regimes for the identical cases.

We study the orientation flocking for the deterministic counterpart of a stochastic agent-based model introduced by Degond, Frouvelle and Merino-Aceituno in 2017

Subterranean termites cause serious damage to wooden structures and manmade structures on the ground.

Automatic annotation for three-dimensional (3D) cephalometric analysis has been limited by computational complexity and computing performance.

We study emergent dynamics of the Lohe matrix model on the unitary group in the presence of several external factors.

Recently, Hashimoto and Ogata proposed a constant-size certificateless aggregate signature scheme based on bilinear pairings. Karati et al. constructed a new certificateless signature scheme without bilinear pairings. The schemes were proven secure against both Type I and Type II adversaries in the random oracle model under the hardness assumptions of the Elliptic Curve discrete logarithm problem and the Computational Diffie？Hellman problem. In this paper, we first show that Hashimoto and Ogata is insecure against a Super-Type I adversary who knows the user secret key associated to the replaced public key and suggest its improvement to prevent our attack.