期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
About the Riemann Hypothesis 被引量:1
1
作者 Jinhua Fei 《Journal of Applied Mathematics and Physics》 2016年第3期561-570,共10页
The Riemann hypothesis is part of Hilbert’s eighth problem in David Hilbert’s list of 23 unsolved problems. It is also one of the Clay Mathematics Institute’s Millennium Prize Problems. Some mathematicians consider... The Riemann hypothesis is part of Hilbert’s eighth problem in David Hilbert’s list of 23 unsolved problems. It is also one of the Clay Mathematics Institute’s Millennium Prize Problems. Some mathematicians consider it the most important unresolved problem in pure mathematics. Many mathematicians made a lot of efforts;they don’t have to prove the Riemann hypothesis. In this paper, I use the analytic methods to deny the Riemann Hypothesis;if there’s something wrong, please criticize and correct me. 展开更多
关键词 Riemann Hypothesis disavowal
下载PDF
Dalai Disavows Guardian of Buddhist Doctrine
2
作者 WEI SE 《China's Tibet》 1996年第6期6-7,共2页
Dalai Disavows Guardian of Buddhist DoctrineDalaiDisavowsGuardianofBuddhistDoctrine¥WEISEGyaiqenXudain,orDoj... Dalai Disavows Guardian of Buddhist DoctrineDalaiDisavowsGuardianofBuddhistDoctrine¥WEISEGyaiqenXudain,orDojeXudainwhichmeans... 展开更多
关键词 Dalai Disavows Guardian of Buddhist Doctrine
下载PDF
Cryptanalysis on ‘an arbitrated quantum signature protocol based on the chained CNOT operations encryption’
3
作者 Wen Kai Zheng Shihui Sun Bin 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2019年第3期73-80,共8页
Arbitrated quantum signature(AQS) is an important branch in quantum cryptography to authenticate quantum information, and cryptanalysis on AQS protocols helps to evaluate and improve security of AQS. Recently, it is d... Arbitrated quantum signature(AQS) is an important branch in quantum cryptography to authenticate quantum information, and cryptanalysis on AQS protocols helps to evaluate and improve security of AQS. Recently, it is discovered that an AQS protocol based on chained controlled-NOT(CNOT) algorithm is vulnerable to a novel attack because a transformation from binary keys into permutations and the chained CNOT algorithm have special properties, which enables a malicious receiver to forge signatures with probability 1/2. Moreover, a malicious signer can also deny his signatures with probability 1/4. Then, two possible improved methods are presented to resist these attacks: one is padding constants to reduce probability of the successful attacks, and the other is a circular chained CNOT algorithm to make the attack strategy invalid. And the security analysis shows that both the two improve methods could well resist these attacks. 展开更多
关键词 arbitrated QUANTUM SIGNATURE chained CNOT FORGERY disavowal
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部