信息安全工程師當(dāng)天每日一練試題地址：m.xiexiliangjiufa.com/exam/ExamDay.aspx?t1=6

往期信息安全工程師每日一練試題匯總：m.xiexiliangjiufa.com/class/27/e6_1.html

信息安全工程師每日一練試題（2021/8/26）在線測試：m.xiexiliangjiufa.com/exam/ExamDay.aspx?t1=6&day=2021/8/26

點(diǎn)擊查看：更多信息安全工程師習(xí)題與指導(dǎo)

信息安全工程師每日一練試題內(nèi)容（2021/8/26）

試題1：

S/Key口令是一種一次性口令生產(chǎn)方案，它可以對抗（）
A、惡意代碼木馬攻擊
B、拒絕服務(wù)攻擊
C、協(xié)議分析攻擊
D、重放攻擊

試題解析與討論：m.xiexiliangjiufa.com/st/2845025503.html
試題參考答案：D

試題2：

注入語句：http：//xxx.xxx.xxx/abc.asp?p=YY and user>0不僅可以判斷服務(wù)器的后臺(tái)數(shù)據(jù)庫是否為SQL-SERVER，還可以得到（）
A、當(dāng)前連接數(shù)據(jù)庫的用戶數(shù)據(jù)
B、當(dāng)前連接數(shù)據(jù)庫的用戶名
C、當(dāng)前連接數(shù)據(jù)庫的用戶口令
D、當(dāng)前連接的數(shù)據(jù)庫名

試題解析與討論：m.xiexiliangjiufa.com/st/2846214573.html
試題參考答案：B

試題3： 下列關(guān)于數(shù)字簽名說法正確的是（  ）。
A.數(shù)字簽名不可信
B.數(shù)字簽名不可改變
C.數(shù)字簽名可以否認(rèn)
D.數(shù)字簽名易被偽造
試題解析與討論：m.xiexiliangjiufa.com/st/411153134.html
試題參考答案：B

試題4： DSS數(shù)字簽名標(biāo)準(zhǔn)的核心是數(shù)字簽名算法DSA，該簽名算法中雜湊函數(shù)采用的是（）。
A. SHA1
B. MD5
C. MD4
D. SHA2
試題解析與討論：m.xiexiliangjiufa.com/st/3275324398.html
試題參考答案：A

試題5： 應(yīng)用代理防火墻的主要優(yōu)點(diǎn)是（）
A.加密強(qiáng)度高
B.安全控制更細(xì)化、更靈活
C.安全服務(wù)的透明性更好
D.服務(wù)對象更廣泛
試題解析與討論：m.xiexiliangjiufa.com/st/3271018450.html
試題參考答案：B

試題6： 無線傳感器網(wǎng)絡(luò)容易受到各種惡意攻擊，以下關(guān)于其防御手段說法錯(cuò)誤的是（）。
A.采用干擾區(qū)內(nèi)節(jié)點(diǎn)切換頻率的方式抵御干擾
B.通過向獨(dú)立多路徑發(fā)送驗(yàn)證數(shù)據(jù)來發(fā)現(xiàn)異常節(jié)點(diǎn)
C.利用中心節(jié)點(diǎn)監(jiān)視網(wǎng)絡(luò)中其它所有節(jié)點(diǎn)來發(fā)現(xiàn)惡意節(jié)點(diǎn)
D.利用安全并具有彈性的時(shí)間同步協(xié)議對抗外部攻擊和被俘獲節(jié)點(diǎn)的影響
試題解析與討論：m.xiexiliangjiufa.com/st/3274326177.html
試題參考答案：C

試題7： 身份認(rèn)證是證實(shí)客戶的真實(shí)身份與其所聲稱的身份是否相符的驗(yàn)證過程。目前，計(jì)算機(jī)及網(wǎng)絡(luò)系統(tǒng)中常用的身份認(rèn)證技術(shù)主要有：用戶名/密碼方式、智能卡認(rèn)證、動(dòng)態(tài)口令、生物特征認(rèn)證等。其中能用于身份認(rèn)證的生物特征必須具有（  ）。
A.唯一性和穩(wěn)定性
B.唯一性和保密性
C.保密性和完整性
D.穩(wěn)定性和完整性
試題解析與討論：m.xiexiliangjiufa.com/st/411269152.html
試題參考答案：A

試題8：

以下選項(xiàng)中，不屬于生物識別方法的是（）
A、指紋識別
B、聲音識別
C、虹膜識別
D、個(gè)人標(biāo)記號識別

試題解析與討論：m.xiexiliangjiufa.com/st/284607440.html
試題參考答案：D

試題9： The modern study of symmetric-key ciphers relates mainly to the study of block ciphers and stream ciphers and to their applications. A block cipher is, in a sense, a modern embodiment of Alberti's polyalphabetic cipher: block ciphers take as input a block of （71 ）and a key, and output a block of ciphertext of the same size. Since messages are almost always longer than a single block, some method of knitting together successive blocks is required. Several have been developed, some with better security in one aspect or another than others. They are the mode of operations and must be carefully considered when using a block cipher in a cryptosystem.
The Data Encryption Standard (DES) and the Advanced Encryption Standard (AES) are( 72 )designs which have been designated cryptography standards by the US government (though DES's designation was finally withdrawn after the AES was adopted). Despite its deprecation as an official standard, DES (especially its still-approved and much more secure triple-DES variant) remains quite popular; it is used across a wide range of applications, from ATM encryption to e-mail privacy and secure remote access. Many other block ciphers have been designed and released, with considerable variation in quality. Many have been thoroughly broken. See Category: Block ciphers.
Stream ciphers, in contrast to the ‘block’type, create an arbitrarily long stream of key material, which is combined ( 73 )the plaintext bit-by-bit or character-by-character, somewhat like the one-time pad. In a stream cipher, the output( 74 )is created based on an internal state which changes as the cipher operates. That state change is controlled by the key, and, in some stream ciphers, by the plaintext stream as well. RC4 is an example of a well-known, and widely used, stream cipher; see Category: Stream ciphers.
Cryptographic hash functions (often called message digest functions) do not necessarily use keys, but are a related and important class of cryptographic algorithms. They take input data (often an entire message), and output a short fixed length hash, and do so as a one-way function. For good ones, ( 75 ) (two plaintexts which produce the same hash) are extremely difficult to find.
Message authentication codes (MACs) are much like cryptographic hash functions, except that a secret key is used to authenticate the hash value on receipt. These block an attack against plain hash functions.
（71）
A.plaintext
B.ciphertext
C.data
D.hash
（72）
A.stream cipher
B.hash function
C.Message authentication code
D.Block cipher
（73）
A.of
B.for
C.with
D.in
（74）
A.hash
B.stream
C.ciphertext
D.plaintext
（75）
A.collisons
B.image
C.preimage
D.solution
試題解析與討論：m.xiexiliangjiufa.com/st/4115223167.html
試題參考答案：A、D、C、B、C

試題10：

利用公開密鑰算法進(jìn)行數(shù)據(jù)加密時(shí)，采用的方法是（）
A、發(fā)送方用公開密鑰加密，接收方用公開密鑰解密
B、發(fā)送方用私有密鑰加密，接收方用私有密鑰解密
C、發(fā)送方用公開密鑰加密，接收方用私有密鑰解密
D、發(fā)送方用私有密鑰加密，接收方用公開密鑰解密

試題解析與討論：m.xiexiliangjiufa.com/st/2847616861.html
試題參考答案：C