原书出处
Introduction to Algorithms, Fourth Edition
31 第31章 数论算法
itally signed response M′. Figure 31.6 shows how the digital-signature scenario proceeds.
Alice computes her digital signature σ for the message M′ using her secret key SA and the equation σ = SA(M′). Alice sends the message/signature pair (M′, σ) to Bob. When Bob receives (M′, σ), he can verify that it originated from Alice by using Alice’s public key to verify the equation M′ = PA(σ). (Presumably, M′ contains Alice’s name, so
that Bob knows whose public key to use.) If the equation holds, then Bob concludes that t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter031.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea