搜索结果: 1-4 共查到“军事学 Random Bits”相关记录4条 . 查询时间(0.046 秒)
Masking is the best-researched countermeasure against side-channel analysis attacks. Even though masking was invented almost 20 years ago, research on the efficient implementation of masking continues...
RSA private key reconstruction from random bits using SAT solvers
SAT solvers RSA partial key exposure factoring public-key cryptography
2013/2/21
SAT solvers are being used more and more in Cryptanalysis, with mixed results regarding their efficiency, depending on the structure of the algorithm they are applied. However, when it comes to intege...
Close to Uniform Prime Number Generation With Fewer Random Bits
Prime number generation RSA efficient implementations random bits
2012/3/26
In this paper we analyze a simple method for generating prime numbers with fewer random bits. Assuming the Extended Riemann Hypothesis, we can prove that our method generates primes according to a dis...
Scrambling Adversarial Errors Using Few Random Bits，Optimal Information Reconciliation，and Better Private Codes
Scrambling Adversarial Errors Random Bits Optimal Information Reconciliation
2008/10/22
When communicating over a noisy channel, it is typically much easier to deal with random,
independent errors with a known distribution than with adversarial errors.