[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"$fW_K7_F3j60xJoHkU8v2EujhO20YYIX3t7XxCao3h6Fg":3},{"answer":4,"createTime":5,"id":6,"options":7,"origin":12,"question":19,"related":20,"source":24,"type":25},[],"2024-05-15 23:17:24",143888765,[8,9,10,11],"对称密码体制中,密钥为发送方和接收方所共享即可,因此密钥管理并不困难","对称加密体制可以实现信息的完整性","对称加密体制可以实现认证发送方的身份","对称加密体制无法达到不可否认服务",{"count":13,"courseId":14,"courseImg":15,"courseName":16,"workId":17,"workName":18},10,"93a0a195251b6ebdc856fdbcaced5ab4","https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F5cc04aa5822f38a27fa3341d5b6abd1f.jpg","工业互联网安全防护","work_34913431","项目二作业2","关于对称密码体制,以下叙述错误的是( )",[21,26,36,45,54,63,72,81,90,99],{"answer":22,"createTime":5,"id":6,"options":23,"question":19,"source":24,"type":25},[],[8,9,10,11],"v1",0,{"answer":27,"createTime":28,"id":29,"options":30,"question":35,"source":24,"type":25},[],"2024-05-15 23:17:25",143888766,[31,32,33,34],"当攻击者不知道密钥K的时候,能够成功破解一个比特的密文的概率为50%","由于一个比特的密钥只可能有0和1两种取值,攻击者很容易穷举出所有密钥,异或运算加密非常不安全","加密算法和解密算法都是异或运算,极为方便CPU运算","如果明文为"0101",密钥为"1001",则密文为"1100"","逻辑运算中的异或运算⊕,也可以看作一种密码算法,其加密和解密的运算如下:\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fcec29a6a5763791d42e6255153fd8f82.jpg\">则以下叙述错误的是( )",{"answer":37,"createTime":28,"id":38,"options":39,"question":44,"source":24,"type":25},[],143888767,[40,41,42,43],"由于RSA算法比常规的对称密码算法安全性高,因此现在大部分的保密通信均采用RSA算法","RSA算法公钥和私钥,都可以用于加密","RSA算法的密钥管理比常规的对称密码算法更简单","RSA算法不能用于消息认证","关于RSA算法,以下叙述正确的是( )",{"answer":46,"createTime":28,"id":47,"options":48,"question":53,"source":24,"type":25},[],143888773,[49,50,51,52],"RSA算法除了可用于保密通信之外,还可以用于密钥交换","Diffie-Hellman算法除了可以用于密钥交换之外,还可以用于保密通信","与非对称密码算法的公钥不同,对称密码算法的共享密钥K是不可以明文传送的","所谓密钥交换,就是解决通信双方共享密钥K的安全传送过程","关于非对称密码算法,以下叙述错误的是( )",{"answer":55,"createTime":28,"id":56,"options":57,"question":62,"source":24,"type":25},[],143888775,[58,59,60,61],"公钥是可以公开传送的,无需加密","私钥只能己方持有,不能通过任何方式传递给通信的其他参与方","参与消息通信的每一方均应持有一对自己的密钥(公钥和私钥)","消息发送方和接收方分别持有公钥和私钥,即可完成保密通信和消息认证","关于公钥密码体制,以下叙述错误的是( )",{"answer":64,"createTime":28,"id":65,"options":66,"question":71,"source":24,"type":25},[],143888776,[67,68,69,70],"换位密码又称为移位密码,此方法是重新排列明文中的符号来达到加密的目的","如果按n个符号为一组的方式处理换位密码(即每次加密的对象为n个符号),最多可以有n!种不同的密钥","我们常见的"考场座位表"在本质上就是一种换位加密","换位密码比替代密码更为复杂,也更安全","关于换位密码算法,以下叙述错误的是( )",{"answer":73,"createTime":28,"id":74,"options":75,"question":80,"source":24,"type":25},[],143888777,[76,77,78,79],"能够找到e、d 和n的值,使得对于所有的0≤P<n,均有\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002F602391462496aa51c7fc4a3a727f4e43.png\">,即能对所有的数值进行加密和解密","给定e和n,不能确定d,即不能通过公钥求出私钥","给定n和C,不能确定P,即不能通过密文求出明文","对所有的0≤P<n来说,能够相对容易地计算出\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd278b3ec8507bbee7545595285173fb3.png\">和\u003Cimg src=\"https:\u002F\u002Ftihai-oss-cloud.itihey.com\u002Fimg\u002Fd60bb2c7e203315d819b71df767fc6e7.png\">,即加密和解密具有可计算性","关于RSA算法的密钥要求,以下叙述错误的是( )",{"answer":82,"createTime":28,"id":83,"options":84,"question":89,"source":24,"type":25},[],143888778,[85,86,87,88],"ZUC","IDEA","RC5","AES","以下哪个对称加密算法是我国的国密算法",{"answer":91,"createTime":28,"id":92,"options":93,"question":98,"source":24,"type":25},[],143888779,[94,95,96,97],"大数因式分解的困难性","背包算法的困难性","离散对数计算的困难性","椭圆双曲线计算的困难性","RSA算法的安全性是建立在( )之上的",{"answer":100,"createTime":28,"id":101,"options":102,"question":107,"source":24,"type":25},[],143888780,[103,104,105,106],"DES算法的有效密钥长度为64位,最多可以有2^64种不同的密钥","DES算法的逻辑结构是Festel的一个变种,它内部使用了10轮的移位密码操作","DES算法是美国早期的非国家保密机关使用的数据加密标准,由于安全性问题现在已很少使用","DES算法属于分组密码算法,它以128位的分组长度对数据进行加密","关于DES算法,以下叙述正确的是( )"]