prime number 中文意思是什麼

prime number 解釋
【數學】質數,素數。

  • prime : adj 1 最初的;第一的,首位的;首要的,主要的;原始的;基本的;原有的。2 最好的,第一流的,頭等的...
  • number : n 1 數;數字;〈pl 〉算術。2 (汽車等的)號碼;第…,第…卷,第…期〈通常略作 No (復數 Nos ),用於...
  1. The quadratic equation algorithm utilizes spa, dpa and principle of rsa - crt, converts the complicated prime factorization of a large composite number into finding the solution of a quadratic equation and gains the private key at last

    該方法綜合利用spa 、 dpa攻擊手段和rsa - crt演算法原理,將rsa演算法的大數分解難題轉化為以私鑰p或q為解的二次方程,最終獲取演算法私鑰值。
  2. The future prime minister remained equally impish when at oxford - as this extraordinary picture of him making a lewd hand gesture demonstrates. a photograph of tony blair as a long - haired, boater - wearing student was reproduced in a number of newspapers with focus on his less than prime ministerial hand gesture

    布萊爾學生時代的一張照片日前在很多家報紙被轉載,照片上的布萊爾蓄著長頭發戴著一頂硬草帽,更引人注目的是,這位首相先生在照片中做了一個與其如今身份極不相稱的手勢。
  3. Prime number and two isomorphic group

    與兩個同構群
  4. Generally, this problem is reduced to quadratic residue problem of modulo a big prime number

    一般而言,該問題歸結為模大素數的二次剩餘問題,但這種歸結不能用於最優擴域oef 。
  5. The distribution law of prime number in natural number

    關于正整數數列中素數的分佈規律
  6. Which number on the card is a prime number

    在卡片上哪一個數字是最初的數字?
  7. On series made up of reciprocals of prime number

    試論素數的倒數所組成的級數
  8. The application of prime number to image scrambling

    基於素數的圖像置亂技術
  9. Must be a prime number between 64 and 128 bytes long

    必須為長度在64位元組和128位元組之間的質數。
  10. Cray number crunchers discovered the largest prime number

    克來公司的電腦發現了世界上最大的素數。
  11. Information technology - security techniques - prime number generation

    信息技術.安全技術.素數生成
  12. Prime number theorem of an algebraic function field of dimension 1 over a finite field

    有限域上單變量代數函數域中的素數定理
  13. According to the principle of generation of prime number through boolean algebra logic operation and phase angle matrix analysis of the periodic function it comes out that any even number larger than 4 can be expressed as the sum of two prime numbers , i. e. “ 1 + 1 ” is tenable, and thereby finishes demonstration of the validity of goldbach ' s conjecture

    根據素數的形成機理,從布爾代數的邏輯運算和周期函數的相角矩陣分析,都得出了大於4的任何偶數都可表示成兩個素數之和即「 1 + 1 」成立,從而完成了哥德巴赫猜想成立的論證。
  14. After then, a new method of solving the minimal cuts of s - coherent tree based on bdd and prime number was given in the qualitative analysis of fta based on bdd, the prime implicant sets of non s - coherent tree was calculated by an iterative method

    再次,在基於bdd的故障樹定性分析研究中,提出並實現了基於bdd和素數法相結合的單調關聯故障樹最小割集求解的新方法,用迭代法實現了非單調關聯故障樹質蘊含的求解。
  15. Rsa algorithm is a algorithm for public key instrument. its security based on the difficulty of dividing big prime number

    Rsa演算法是一種公開密鑰演算法,它的安全系數取決于大素數分解的難度。
  16. It can resist the attack named mov. an algorithm of detecting prime number based on division has been given

    同時結合除法篩思想提高了單純miller - rabin素性檢測演算法的效率。
  17. E - books about riddles in science, including ancient astronomy, prime number patterns, medical abuses

    -介紹金字塔古馬雅之謎ufo及前世今生。
  18. The author mainly realized the method of generating the large random numbers and judging the prime number using lehmann means, then three pairs of secure key with different lengths ( 256 bits, 512 bits, 1024 bits ) was generated to meet the demand of different security grade. in encryption module, modular multiplication arithmetic of large number was realized adopting addition chaining. in decryption module, extended euclid was used to get inverse, and the chinese remainder theorem was used to realize decryption, which increased the speed of decryption greatly

    作者主要實現了大隨機數的生成、採用整除小素數和勒曼測試法判定素數,可以生成三種不同長度的密鑰對( 256位、 512位、 1024位)來滿足不同的加密安全等級的需求;加密模塊中,選用了二進制序列的乘法方法,實現了大數模冪乘運算;解密模塊中,引用了擴展的歐幾里德法求逆元,並採用中國剩餘定理實現解密過程,大大提高了解密速度。
  19. Prime number generation, primality testing, and primality certificates

    質數生成原始狀態試驗和原始狀態鑒定
  20. When the actual load factor reaches the specified load factor, the number of buckets is automatically increased to the smallest prime number that is larger than twice the current number of buckets

    當實際加載因子達到指定的加載因子時,存儲桶的數量會自動增加到比當前存儲桶數大兩倍的最小質數。
分享友人