☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
離散數學
›
Ch1 集合與基礎數論
第 15 題／共 15 題
◀
LS 15/15
錯題回報
00:00
15. RSA、Digital Signature、Number Theory
#LS-01-015
中
RSA
Digital Signature
Number Theory
📝
☆
In the RSA public key system,
A
its correctness is based on Fermat's theorem and Chinese remainder theorem.
B
two large primes are chosen so that one acts as the public key and the other the private key.
C
(
M
e
)
d
=
(
M
d
)
e
=
M
(M^e)^d = (M^d)^e = M
(
M
e
)
d
=
(
M
d
)
e
=
M
, where
M
M
M
represents a message,
e
e
e
represents the public key, and
d
d
d
the corresponding private key.
D
if Alice wants to send a message to Bob and prove her identity, Alice first generates a hash value from the message and encrypts the hash value by her own public key and then sends the plaintext message and the encrypted hash value to Bob. After Bob receives the message, he decrypts the hash value by Alice's private key. Besides, he also generates a hash value from the plaintext message. If both values match, it proves the message comes from Alice.
E
all of the above statements are incorrect.
📝 寫筆記
📄 中央111
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 離散數學》Ch1 集合與基礎數論
‹
本章題號 · 1–15 / 15
›
全部 15
易 6
中 8
難 1
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
