请输入您要查询的百科知识:

 

词条 Full Domain Hash
释义

  1. Exact security of full domain hash

  2. References

In cryptography, the Full Domain Hash (FDH) is an RSA-based signature scheme that follows the hash-and-sign paradigm. It is provably secure (i.e., is existentially unforgeable under adaptive chosen-message attacks) in the random oracle model. FDH involves hashing a message using a function whose image size equals the size of the RSA modulus, and then raising the result to the secret RSA exponent.

Exact security of full domain hash

In the random oracle model, if RSA is -secure, then the full domain hash RSA signature scheme is -secure where,

.

For large this reduces to .

This means that if there exists an algorithm that can forge a new FDH signature that runs in time t, computes at most hashes, asks for at most signatures and succeeds with probability , then there must also exist an algorithm that breaks RSA with probability in time .

References

  • Jean-Sébastien Coron(AF): On the Exact Security of Full Domain Hash. CRYPTO 2000: pp. 229–235 ([https://www.iacr.org/archive/crypto2000/18800229/18800229.pdf PDF])
  • Mihir Bellare, Phillip Rogaway: The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. EUROCRYPT 1996: pp. 399–416 (PDF)
{{crypto-stub}}

2 : Digital signature schemes|Theory of cryptography

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/9/22 6:43:30