blocks|key|738191|text|基于确定性随机比特生成器(DRBG)的哈希算法(如果有的话)并不重要。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|738192|DRBG的输出在统计上是随机的；如果您能够通过检查输出来确定有关比特源的任何内容，那么它就不适合用于密码学。|738193|顺便说一句，RSA签名算法在使用RSA-PSS方案时使用RNG+.旧的RSA签名是确定性的(这是一个弱点)。|738194|重要的是算法的有效强度。例如，您不希望使用带有3072位RSA签名密钥的SHA-1；哈希不像使用该密钥的加密算法那么强。DRBG也可以是按他们的实力分类。DRBG的安全强度表示需要多少计算才能预测其输出，而不给出其内部状态。|offset|length|738195|良好的基于哈希的DRBG的安全性与底层哈希函数的安全性相同。要找到这一点，请查看NIST+SP+800-57第1部分，表3。以获得较强的安全性，最小为112位，鼓励128位或更多位。这意味着使用基于SHA-224或SHA-256的DRBG，分别使用2048位或3072位RSA密钥。|738196|entityMap|0|LINK|mutability|MUTABLE|url|http://csrc.nist.gov/publications/nistpubs/800-90A/SP800-90A.pdf|1|http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf^0|0|0|0|1W|8|0|0|14|M|1|0^^$0|@$1|2|3|4|5|6|7|V|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|W|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|X|8|@]|9|@]|A|$]]|$1|F|3|G|5|6|7|Y|8|@]|9|@$H|Z|I|10|1|11]]|A|$]]|$1|J|3|K|5|6|7|12|8|@]|9|@$H|13|I|14|1|15]]|A|$]]|$1|L|3|-4|5|6|7|16|8|@]|9|@]|A|$]]]|M|$N|$5|O|P|Q|A|$R|S]]|T|$5|O|P|Q|A|$R|U]]]]

The hash algorithm, if any, underlying the deterministic random bit generator (DRBG) doesn't matter. 

The output of a DRBG is statistically random; if your were able to determine anything about the source of the bits by examining the output, it wouldn't be suitable for cryptographic use.

By the way, the RSA signature algorithm uses a RNG when using the RSA-PSS scheme. Older RSA signatures are deterministic (and this is a weakness).

What does matter is the effective strength of an algorithm. For example, you wouldn't want to use SHA-1 with a 3072-bit RSA signature key; the hash not as strong as the encryption algorithm using that key. DRBGs can be <a href="http://csrc.nist.gov/publications/nistpubs/800-90A/SP800-90A.pdf" rel="nofollow">classified by their strength</a> as well. The security strength of a DRBG indicates how much computation is needed predict its output without being given its internal state.

The security strength of a good hash-based DRBG is the same as that of the underlying hash function. To find this out, look at <a href="http://csrc.nist.gov/publications/nistpubs/800-57/sp800-57_part1_rev3_general.pdf" rel="nofollow">NIST SP 800&#x2011;57 Part&nbsp;1, Table&nbsp;3.</a> For strong security, 112 bits is the minimum, with 128 bits or more being encouraged. That means using a DRBG based on SHA-224 or SHA-256, with a 2048- or 3072-bit RSA key, respectively.

blocks|key|738223|text|SHA1PRNG的唯一问题是，由于某种原因，键空间仅限于20个字节。这是完全没有必要的，因为哈希可以在几乎无限数量的文本上执行。我不清楚为什么这个生成器的键大小有限制。好消息是，很容易复制源代码并消除这个限制。坏消息是它与标准实现不兼容。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|738224|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

The only issue with SHA1PRNG is that the keyspace is for some reason limited to 20 bytes. This is totally unnecessary since the hash can be performed on a virtually unlimited amount of text. It is not clear to me why there is a limit on the keysize for this generator. The good news it is easy to copy the source code and remove that limitation. The bad news is that it is then not compatible with the standard implementation.

If I use <code>MD5WithRSAEncryption</code> as a signature algorithm what is the corresponding random algorithm? 
I tried <code>MD5PRNG</code> but I got: 

<blockquote>
 java.security.NoSuchAlgorithmException: SecureRandom MD5PRNG
 implementation not found
</blockquote>

What is the proper random algorithm to be used here to initialize a <code>KeyPairGenerator</code>? 
Like <code>SHA1PRNG</code> when we use <code>SHA256WithRSAEncryption</code> 

I mean: <code>SHA256WithRSAEncryption</code> is a <code>key pair algorithm</code>, while <code>SHA1PRNG</code> is a <code>random generator</code> to be used by the keypair algorithm. E.g. <code>keyPairGenerator.initialize(keySize, secureRandom);</code> 
(where <code>keyPairGenerator</code> is of class <code>KeyPairGenerator</code>) 
Are they somehow depend on proper pairing?I.e. can I use MD5WithRSAEncryption with SHA1PRNG?

What is the correct random algorithm to use here?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

如果我使用MD5WithRSAEncryption作为签名算法，对应的随机算法是什么？我试过MD5PRNG，但我得到了：java.security.NoSuchAlgorithmException:找不到SecureRandom MD5PRNG实现这里用来初始化KeyPairGenerator的合适的随机算法是什么？就...

问这里正确的随机算法是什么？
EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问这里正确的随机算法是什么？EN

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问这里正确的随机算法是什么？
EN