位置：成果数据库 > 会议 > 会议详情页
On the Complexity of Shor’s Algorithm for Factorization
  • 所属机构名称：上海大学
  • 成果类型：会议
  • 相关项目：匿名数字签名体制的理论研究
同会议论文项目
匿名数字签名体制的理论研究
期刊论文 3 会议论文 19
同项目会议论文
Different Authentication Properties and A Signcryption Scheme Revisited
Analysis of Two Quantum Cryptographic Protocols
Private Matching Protocols without Error Probability
Adleman-Manders-Miller Root Extraction Method Revisited
Analysis of Two Group Signatures Based on Bilinear Maps
Improvements of One Anonymous ID-based Encryption
Improvement of One Escrow-free Identity-based Signature
An Attack Against DES Based On The Relationship Li+1 = Ri
Two Optimum Secret Sharing Schemes Revisited
Security Difference between DSA and Schnorr's Signature
Analysis of two signature schemes from CIS’2006
Extension of Barreto-Voloch Root Extraction Method
Justifying the Bell’s mathematical formulation
Improvement of one quantum encryption scheme
Generalized Greedy Algorithm for Shortest Superstring
Improvement of One Password-Based Authenticated Key Exchange Protocol
A General Attack Against Several Group Signatures
Security Analysis of One Quantum Digital Signature Scheme