integer factorization 中文意思是什麼

integer factorization 解釋
整數分解
  • integer : n. 1. 【數學】整數 （opp. fraction）。2. 完整的東西，整體。
  • factorization : 分解為因子
  1. Chun - chih peng and chung - huang yang, " design and implementation for integer factorization and primality testing tools with elliptic curve on windows platforms, " 2007 symposium on cryptography and information security, sasebo, japan, january 2007

    張家瀚、楊中皇，支援鏈結機制之標準化時戳實作， 2007知識社群與資訊安全研討會，文化大學， 2007年5月。
  2. A integrated algorithm of ambiguity resolution is proposed. by using triple carrier phase, integer gauss transformations, qr factorization, cholesky factorization, and geometry constraint, the correlation between ambiguity components is reduced, and more error ambiguity can be discarded, also process of ambiguity searching getting rapidly. the ratio test combining constraint of baseline is used to fix ambiguity rapidly

    利用三差最小二乘求解模糊度浮點解，然後採用整數高斯變換降低模糊度分量間的相關性，再根據qr分解和基線幾何約束減少需搜索的模糊度組合，採用cholesky分解在搜索過程中及早淘汰不正確的模糊度組合，最後利用ratio檢驗與基線幾何約束條件相結合檢驗模糊度組合，盡快固定正確的模糊度。
  3. 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

    與基於有限域的乘法群系統（及基於整數分解的難解性之上的系統）相比，橢圓曲線系統的優勢在於，迄今為止還沒找到這類群上離散對數的次指數時間演算法（如微積分類）
  4. The ordering process, the integer ldlt factorization and the ambiguity screen are three parts of the osd. the osd is based on diminishing the condition number of covariance matrix

    Osd處理過程包括排序、整數ldl ~ t分解和模糊度篩選，該演算法的去相關處理過程，是以降低協方差矩陣的條件數為準則。
  5. 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

    首先，對群簽名體制的研究背景、意義以及發展現狀進行了介紹;接著針對群簽名體制的基本概念和性質以及可用於構造群簽名的一些普通的數字簽名體制進行了詳細描述，並基於大整數分解問題給出一個群簽名方案;同時還對授權群簽名的基本概念和必須滿足的基本性質進行了詳細說明，並且基於離散對數問題給出一個安全的授權群簽名方案;最後，對電子商務中的一個重要組成部分? ?電子支付系統進行了詳細的闡述，利用群簽名技術設計出一個簡單、高安全性的多銀行電子現金系統方案。
  6. Information technology - security techniques - digital signature schemes giving message recovery - integer factorization based mechanisms

    信息技術.安全技術.使電文恢復的數字簽名方案.基於整數因子分解的機制
  7. Information technology - security techniques - digital signature schemes giving message recovery part 2 : integer factorization based mechanisms

    信息技術.保密技術.具有信息恢復功能的數字簽名方案.第2部分:基於整數因子分解的機構
  8. Using the idea of secret - sharing and signature - of - knowledge, a new perfect and strong key - insulated signature scheme based on the assumption of integer factorization problem is proposed. the scheme has a low computation in key updating and signing, thus fitting for the mobile devices

    （ 6 ）對簽名系統中的密鑰泄露問題進行了研究，在分析相關技術的基礎上，利用秘密分享和知識簽名，給出了一個完善的強key - insulated簽名方案。
  9. 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

分享到臉書