位置：成果数据库 > 会议 > 会议详情页
Analysis of optimum pairing products at high security levels
  • 所属机构名称：中国科学院信息工程研究所
  • 会议名称：13th International Conference on Cryptology in India, INDOCRYPT 2012
  • 成果类型：会议
  • 相关项目：多项式同构问题与多变量密码分类分析研究
作者： Zhang, Xusheng1, 2|Lin, Dongdai3|
同会议论文项目
多项式同构问题与多变量密码分类分析研究
期刊论文 17 会议论文 24
同项目会议论文
Anonymous Identity-Based Hash Proof Systems and Their Applications
Applying time-memory-data trade-off to plaintext recovery attack
Fast tate pairing computation on twisted jacobi intersections curves
Accelerating Inverse of GF(2(n)) with Precomputation
Efficient pairing computation on ordinary elliptic curves of embedding degree 1 and 2
An Efficient Method for Deciding Polynomial Equivalence Classes
Refinement of Miller's Algorithm Over Edwards Curves
A new efficient algorithm for computing all low degree annihilators of sparse polynomials with a hig
The initialization stage analysis of ZUC v1.5
Construction of Resilient and Nonlinear Boolean Functions with Almost Perfect Immunity to Algebraic
Resettable cryptography in constant rounds - The case of zero knowledge
On Efficient Pairings on Elliptic Curves over Extension Fields
Fast Evaluation of T Functions via time-memory trade-offs
A new method for solving polynomial systems with noise over and its applications in cold boot key re
A new variant of time memory trade-off on the improvement of Thing and Ying';s attack
Linear weaknesses in T-functions
An Improved Twisted Ate Pairing over KSS Curves with $k_18$
Identity-based extractable hash proofs and their applications
Perfect algebraic immune functions
Results on the Immunity of Boolean Functions against Probabilistic Algebraic Attacks
Stronger Security Model for Public-Key Encryption with Equality Test
Attacking Bivium and Trivium with the characteristic set method
A universal distributed model for password cracking