粘
发表于 2025-3-30 11:30:23
http://reply.papertrans.cn/16/1598/159734/159734_51.png
subordinate
发表于 2025-3-30 15:22:06
http://reply.papertrans.cn/16/1598/159734/159734_52.png
凝视
发表于 2025-3-30 17:17:38
http://reply.papertrans.cn/16/1598/159734/159734_53.png
Obsequious
发表于 2025-3-30 20:50:16
Estimating the Prime-Factors of an RSA Modulus and an Extension of the Wiener Attack EPF can extend the Wiener attack to reduce the cost of exhaustive-searching for 2. + 8 bits down to 2. − 10 bits, where . depends on .and the private key .. The security boundary of private-exponent . can be raised 9 bits again over Verheul and Tilborg’s result.
aviator
发表于 2025-3-31 02:14:58
http://reply.papertrans.cn/16/1598/159734/159734_55.png
衰老
发表于 2025-3-31 05:26:27
A New Protocol for Conditional Disclosure of Secrets and Its Applicationsmulti-candidate electronic voting so that all voters only transmit an encryption of their vote. The only hardness assumption in all these protocols is that the underlying public-key cryptosystem is IND-CPA secure and the plaintext order does not have small factors.
泥土谦卑
发表于 2025-3-31 11:59:49
http://reply.papertrans.cn/16/1598/159734/159734_57.png
清楚
发表于 2025-3-31 14:00:45
Foundations of Engineering Mechanicsscribing and analyzing electronic cash protocols, and we analyze Ferguson’s electronic cash protocol as a case study. We believe that this approach is suitable for many different electronic cash protocols.
molest
发表于 2025-3-31 20:30:43
https://doi.org/10.1007/978-3-540-40970-0lid ciphertext and its corresponding TRMC-4 public key, we can derive the corresponding plaintext within 2..-operations, after performing once for the public key a computation of complexity less than 2.. Our results are confirmed by computer experiments.
有花
发表于 2025-4-1 01:44:04
http://reply.papertrans.cn/16/1598/159734/159734_60.png