搜索结果: 1-3 共查到“密码学 MinRank”相关记录3条 . 查询时间(0.078 秒)
On the Complexity of ``Superdetermined'' Minrank Instances
Minrank problem Multivariate Cryptanalysis HFE
2019/6/21
The Minrank (MR) problem is a computational problem closely related to attacks on code- and multivariate-based schemes. In this paper we revisit the so-called Kipnis-Shamir (KS) approach to this probl...
In this note, we leverage some of our previous results to produce a concise and rigorous proof for the complexity of the generalized MinRank Problem in the under-defined and well-defined case. Our mai...
Efficient Zero-knowledge Authentication Based on a Linear Algebra Problem MinRank
Zero-knowledge identification entity authentication
2009/4/16
A Zero-knowledge protocol provides provably secure entity
authentication based on a hard computational problem. Among many
schemes proposed since 1984, the most practical rely on factoring and discr...