全部科目 > 信息安全工程师 >
2020年下半年 上午试卷 综合知识
第 71 题
知识点 RSA   net  
章/节 网络信息安全专业英语  
 
 
Symmetric-key cryptosystems use the (71 ) key for encryption and decryption of a message,though a message or group of messages may have a different key than others. A significant disadvantage of symmetric ciphers is the key management necessary to use them securely. Each distinct pair of communicating parl ies must, ideally, share a different key, and perhaps each ciphertext exchanged as well. The number of keys required increases as the square of the number of network members, which very quickly requires complex key management schemes to keep them all straight and secret. The difficulty of securely establishing a secret (72) between two communicating parties, when a secure channel doesn’t already exist between them, also presents a chicken-and-egg problem which is a considerable practical obstacle for cryptography users in the real world.
Whitfield Diffie and Martin Heilman, authors of the first paper on public-key cryptography.
In a groundbreaking 1976 paper. Whitfield Diffie and Martin Heilman proposed the notion of public-key (also, more generally, called asymmetric key) cryptography in which two different but mathematically related keys are used—a public key and a private key. A public key system is so constructed that calculation of one key (the private key) is computationally infeasible _(73) the other (the public key), even though they are necessarily related. Instead, both keys are generated secretly, as an interrelated pair. The historian David Kahn described public-key cryptography as “the most revolutionary new concept in the field since poly-alphabetic substitution emerged in the Renaissance”.
In public-key cryptosystems, the (74) key may be freely distributed, while its paired private key must remain secret. The public key is typically used for encryption, while the private or secret key is used for decryption. Diffie and Heilman showed that public-key cryptography was possible by presenting the Diffie-Heilman key exchange protocol.
In 1978, Ronald Rivest, Adi Shamir, and Len Adleman invented (75),another public-key system.
In 1997,it finally became publicly known that asymmetric key cryptography had been invented by James H. Ellis at GCHQ, a British intelligence organization, and that, in the early 1970s, both the Diffie-Hellman and RSA algorithms had been previously developed (by Malcolm J. Williamson and Clifford Cocks, respectively).
 
  A.  different
 
  B.  same
 
  C.  public
 
  D.  private
 
 




 
 
相关试题     网络信息安全专业英语 

  第74题    2020年下半年  
Symmetric-key cryptosystems use the (71 ) key for encryption and decryption of a message,though a message or group of messages may have a different key than others. A significant d..

  第72题    2017年上半年  
There are different ways to perform IP based DoS Attacks. The most common IP based DoS attack is that an attacker sends an extensive amount of connection establishment (71)(e.g. ..

  第74题    2016年下半年  
( 71) is the science of hiding information. Whereas .the goal of cryptography is tomake dataulueadable by a third party, the goal of steganography is to hide the data from athirdpa..

 
知识点讲解
· RSA
· net
 
        RSA
        RSA算法是非对称算法,由Ronald Rivest、Adi Shamir、Leonard Adleman三人共同在1977年公开发表。在RSA加密算法中,公钥和私钥都可以用于加密消息,用于加密消息的密钥与用于解密消息的密钥相反。RSA算法提供了一种保护网络通信和数据存储的机密性、完整性、真实性和不可否认性的方法。目前,SSH、OpenPGP、S/MIME和SSL/TLS都依赖于RSA进行加密和数字签名功能。RSA算法在浏览器中使用,能够在不可信任的互联网中建立安全连接。RSA签名验证是网络连接系统中最常见的执行操作之一。
        RSA算法基于大整数因子分解的困难性,该算法的步骤如下:
        第一步,生成两个大素数pq
        第二步,计算这两个素数的乘积n=pq
        第三步,计算小于n并且与n互素的整数的个数,即欧拉函数φ(n)=(p-1)(q-1)。
        第四步,选取一个随机数e,且满足1<e<φ(n),并且eφ(n)互素,即gcd(eφ(n))=1。
        第五步,计算d=e-1modφn)。
        第六步,保密dpq,而公开ne,即d作为私钥,而ne作为公钥。
        下面,举一个RSA加密的具体实例。设素数p=3,q=17,并令e=13,则RSA的加密操作如下:
        第一步,计算nn=pq=3×17=51,得出公钥n=51,e=13。
        第二步,计算φ(n)和dφ(n)=(p-1)(q-1)=2×16=32。因为d=e-1modφ(n),所以,其中kp-1和q-1的最大公约数。由此算出d=(2×32+1)/13=5,即解密密钥d=5。
        第三步,加密和解密处理计算。假设Bob的公开密钥是e=13、n=51,Alice需要将明文“2”发送给Bob,则Alice首先用Bob的公开密钥加密明文,即:
        C=Memodn=213mod 51=8192 mod 51=32
        然后,Bob收到Alice发来的密文C后,用自己的私钥d解密密文C,即:
        M=Cdmodn=325mod 51=1024×1024×32 mod 51=512 mod 51=2
        RSA安全性保证要做到选取的素数pq足够大,使得给定了它们的乘积n后,在事先不知道pq的情况下分解n是计算上不可行的。因此,破译RSA密码体制基本上等价于分解n。基于安全性考虑,要求n长度至少应为1024比特,然而从长期的安全性来看,n的长度至少应为2048比特,或者是616位的十进制数。
 
        net
        在网络管理中,最为常用的就是net命令家族。常用的net命令有以下几个。
        .net view命令:显示由指定的计算机共享的域、计算机或资源的列表。
        .net share:用于管理共享资源,使网络用户可以使用某一服务器上的资源。
        .net use命令:用于将计算机与共享的资源相连接或断开,或者显示关于计算机连接的信息。
        .net start命令:用于启动服务,或显示已启动服务的列表。
        .net stop命令:用于停止正在运行的服务。
        .net user命令:可用来添加或修改计算机上的用户账户,或者显示用户账户的信息。
        .net config命令:显示正在运行的可配置服务,或显示和更改服务器服务或工作站服务的设置。
        .net send命令:用于将消息(可以是中文)发送到网络上的其他用户、计算机或者消息名称上。
        .net localgroup命令:用于添加、显示或修改本地组。
        .net accounts命令:可用来更新用户账户数据库、更改密码及所有账户的登录要求。



更多复习资料
请登录电脑版软考在线 www.rkpass.cn

京B2-20210865 | 京ICP备2020040059号-5
京公网安备 11010502032051号 | 营业执照
 Copyright ©2000-2023 All Rights Reserved
软考在线版权所有