離散對數 的英文怎麼說

中文拼音 [lísǎnduìshǔ]
離散對數 英文
discrete logarithm
  • 離 : Ⅰ動詞1 （離開） leave; part from; be away from; separate 2 （背離） go against 3 （缺少） dispens...
  • 散 : 散動詞1. （由聚集而分離） break up; disperse 2. （散布） distribute; disseminate; give out 3. （排除） dispel; let out
  • 對 : Ⅰ動詞1 （回答） answer; reply 2 （對待; 對付） treat; cope with; counter 3 （朝; 向; 面對） be tr...
  • 數 : 數副詞（屢次） frequently; repeatedly
  • 離散 : dispersed; scattered about; separated from one another; spread; debunching; straggling; fringing;...
  1. A new type signature of knowledge - - a signature of knowledge of the discrete logarithm of a blinded representation, which provides the verifier trusts the prover has the knowledge of the discrete logarithm when the knowledge is unknown, is proposed. the new signature of knowledge is necessary for the solution of the problem of member deletion in group signature ; 2

    提出了一種新類型的知識簽名? ?盲化表述的離散對數根的知識簽名，使得驗證者對含有知識（離散對數根）的表述未知的情況下，有理由相信證明者具有離散對數根的知識，給出了一種更間接的證明知識的方法。
  2. 4. study existing key - exchange protocols, promote and implement a key exchange protocol under the hardness assumption of the decisional diffie - hellman problem as well as the existence of collision - free hash functions. 5

    在分析了密鑰交換方法的基礎上設計並實現了基於離散對數困難問題（ dlp ）和diffie - hellman密鑰交換協議，輔以hash函數和公鑰證書，進行會話密鑰交換方法。
  3. The security of elliptic curve cryptography ( ecc ) depends on the intractability of the elliptic curve analogue of the discrete logarithm problem. ecc has gained increasing popularity in public key cryptography, because of its computation and storage

    橢圓曲線密碼是基於橢圓曲線離散對數難題的一種密碼體制，由於它在運算量和安全性方面的優勢，是目前最具有廣泛應用前景的一種公鑰密碼體制，近幾年一直是人們的研究熱點。
  4. The primary advantage that elliptic curve systems have over systems based on the multiplicative group of a finite field ( and also over systems based on the intractability of integer factorization ) is the absence of a subexponential - time algorithm ( such as those of index calculus type ) that could find discrete logs in these groups

    與基於有限域的乘法群系統（及基於整數分解的難解性之上的系統）相比，橢圓曲線系統的優勢在於，迄今為止還沒找到這類群上離散對數的次指數時間演算法（如微積分類）
  5. Firstly, by means of the intractability of discrete logarithm problem, a threshold secret sharing scheme with periodic renewing to identify cheaters is established. shares are periodically renewed without changing the secret. every participant is able to verify the share he receives and those other participants show

    首先，利用離散對數問題的難解性，給出了一個定期更新防欺詐的門限秘密共享方案，它在保持共享秘密不變的情況下定期對子秘密進行更新，每個參與者可以對自己的子秘密及其他成員出示的子秘密進行驗證，不但能有效阻止敵手竊取秘密或子秘密，也能有效地防止內部成員之間的互相欺詐。
  6. Abstract : two new digital signature schemes whose security are based onboth discrete logarithms and factorization are proposed. the paper also considers some possible attacks to the schemes, shows that the two schemes are more secure than the elgamal ' s signature scheme and the rabin ' s signature scheme

    文摘:提出了兩個新的數字簽名方案，它們的安全性同時基於離散對數和素因子分解兩個困難問題，並各有特點.對兩個方案的性能和可能遭受到的攻擊進行了詳細討論
  7. Blind proxy signature mending scheme based on discete logarithm

    對基於離散對數的代理盲簽名方案的改進
  8. The set of participants to perform key agreement should satisfy threshold

    該方案使得參與者可以協商秘密密鑰，而不用基於離散對數假設。
  9. The security of elliptic curve cryptogrphy ( ecc ) is based on the difficulty of elliptic curve discrete logarithm

    橢圓曲線密碼體制的安全性基於橢圓曲線離散對數問題的難解性。
  10. The security of the elliptic curve cryptography is built upon the difficulty of solving the elliptic curve discrete problem

    橢圓曲線密碼系統的安全性建立在橢圓曲線離散對數問題的難解性上。
  11. The difficulties of elliptic curve discrete logarithm problem and safety of 3 - des encryption is analyzed in detail. this cryptographic system applies a key exchange scheme based on ecc and trusty data encryption algorithm

    文章最後分析了該密碼系統的安全性，對橢圓曲線離散對數問題的難解性以及三重des加密演算法的安全性作了較詳細的分析。
  12. Its security is ensured by the difficulty of elliptic curve ' s discrete logarithm problem by means of the exclusion of supersingle and anomalous elliptic curves and the adoption of a big prime ( more than 160 bits ) for the order of base - point in elliptic curve in this scheme of data encryption

    加密方案中沒有使用超奇異橢圓曲線及異常橢圓曲線，橢圓曲線上基點的階為大素數（長度160比特） ，保證了橢圓曲線離散對數問題的難解性，從而最終保證了整個方案的安全性。
  13. Baby - step - giant - step attack algorithm is universally suitable to solve all discrete logarithm problems, but its relatively larger storage cost is an obvious defect

    小步大步攻擊演算法是一個求解離散對數問題通用且高效的演算法，但較大的存貯開銷是它的一個明顯不足。
  14. Cryptology eprint archive, report 2004 104, http : eprint. iacr. org 2004 104. 11 camenisch j. group signature schemes and payment systems based on the discrete logarithm problem dissertation

    該方案可以使證明方對驗證方證明他知道橢圓曲線上兩個點的離散對數- alpha ， - beta - in - z q 。
  15. This scheme is based on the elliptic curve discrete logarithm, which is one of the mathematic puzzles. compared with other cipher systems, it has shorter length of secret key and grouping in the same security intensity

    該體制是建立在橢圓曲線離散對數問題這一數學難題之上的，和其它密碼體制相比較而言在同等安全強度下具有小得多的秘鑰長度及分組長度。
  16. The knapsack public key cryptosystem based on np completeness problem and the elliptic curve cryptography ( ecc ) based on discrete logarithm problem ( dlp ) are two significant ones, which plays an crucial role in the development and research of computer cryptology

    基於np完全問題的背包公鑰密碼和基於離散對數問題的橢圓曲線密碼（ ecc ）是兩種著名的公鑰密碼系統，在計算機密碼學的發展和研究中具有十分重要的地位。
  17. The second approach is to use the concept of discrete logarithm. understanding this concept requires understanding some properties of multiplicative groups

    第二種方法就是運用離散對數的概念。要掌握這些概念首先需要了解乘法群的概念。
  18. Secondly, we described the fundamental concepts and properties of group signature scheme and some general digital signatures that can be used to construct group signature amply, and presented a group signature scheme based on the integer factorization. thirdly, we explained the fundamental concepts and properties of authorized group signature in detail and propounded a secure authorized group signature based upon the discrete logarithm. finally, we illuminated electronic payment system in e - commerce and designed a simple and high secure electronic cash system with multiple banks based on group signature

    首先，對群簽名體制的研究背景、意義以及發展現狀進行了介紹;接著針對群簽名體制的基本概念和性質以及可用於構造群簽名的一些普通的數字簽名體制進行了詳細描述，並基於大整數分解問題給出一個群簽名方案;同時還對授權群簽名的基本概念和必須滿足的基本性質進行了詳細說明，並且基於離散對數問題給出一個安全的授權群簽名方案;最後，對電子商務中的一個重要組成部分? ?電子支付系統進行了詳細的闡述，利用群簽名技術設計出一個簡單、高安全性的多銀行電子現金系統方案。
  19. The scheme is more efficient than the basic cramer - shoup ' s encryption scheme while its security against adaptive chosen cipher - text attack can be proved under the hardness assumption of decisional difhe - hellman problem. 2. study existing digital signature and develop an efficient digital signature based on certificate data

    在分析基本數字簽名方法的基礎上，設計並實現了基於離散對數困難問題（ dlp ） ，輔以hash函數和公鑰證書進行簽名和驗證簽名的數字簽名方法。
  20. The elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ). it was accepted in 1999 as an ansi standard, and was accepted in 2000 as ieee and nist standards. unlike the ordinary discrete logarithm problem and the integer factorization problem, no subexponential - time is known for the elliptic curve discrete logarithm problem. for this reason, the strength - per - key - bit is substantially greater in an algorithm that uses elliptic curves

    橢圓曲線數字簽名演算法（ ecdsa ）是數字簽名演算法（ dsa ）的橢圓曲線對等。它先後成為ansi ， ieee ， nist和iso的標準，而且其它的一些組織正在考慮成為其標準。不象普通的離散對數問題和因數分解問題，橢圓曲線離散對數問題沒有已知的亞指數演算法，所以使用橢圓曲線的演算法在密鑰的位強度是足夠高的。
分享友人
分享到 Line

分享到臉書