Search - c B - CodeBus

Search - c B - List

[CA auth] AuthorWeb(.net) DL : 0: 用c#开发的B/S模式的图书在线出版系统DB事sql server,为三层模式,用户层,业务逻辑层,DB层,详细说明见附录-with the development of B / S mode of books online publishing system DB things sql server, for the three-tier model, the user layer, business logic tier, DB layer details, see appendix
Date : 2008-10-13 Size : 653.58kb User : 钟波
[CA auth] RFC2560 DL : 0: 本文档描述了无需证书撤消列表就可以决定一张数字证书当前状态的协议。第二章中有协议的概述。功能必要条件在第三章中有详细描述。第四章是具体协议。第五章我们将讨论一些和协议有关的安全问题。附录A定义了在HTTP之上的OCSP，附录B有ASN.1的语义元素，附录C详细描述了信息的mime类型。-This document describes the need to withdraw the certificate on the list can decide a digital certificate current status agreement. The second chapter is an overview of the agreement. Functions of the necessary conditions for the third chapter, a detailed description. The fourth chapter is a specific agreement. The fifth chapter we will discuss some agreement and related security issues. Appendix A definition in the HTTP above OCSP, Appendix B is the ASN.1 semantic elements, described in detail in Appendix C of information mime types.
Date : 2008-10-13 Size : 12.03kb User : 夏珊
[CA auth] RFC2560 DL : 0: 本文档描述了无需证书撤消列表就可以决定一张数字证书当前状态的协议。第二章中有协议的概述。功能必要条件在第三章中有详细描述。第四章是具体协议。第五章我们将讨论一些和协议有关的安全问题。附录A定义了在HTTP之上的OCSP，附录B有ASN.1的语义元素，附录C详细描述了信息的mime类型。-This document describes the need to withdraw the certificate on the list can decide a digital certificate current status agreement. The second chapter is an overview of the agreement. Functions of the necessary conditions for the third chapter, a detailed description. The fourth chapter is a specific agreement. The fifth chapter we will discuss some agreement and related security issues. Appendix A definition in the HTTP above OCSP, Appendix B is the ASN.1 semantic elements, described in detail in Appendix C of information mime types.
Date : 2025-12-21 Size : 12kb User : 夏珊
[CA auth] AuthorWeb(.net) DL : 0: 用c#开发的B/S模式的图书在线出版系统DB事sql server,为三层模式,用户层,业务逻辑层,DB层,详细说明见附录-with the development of B/S mode of books online publishing system DB things sql server, for the three-tier model, the user layer, business logic tier, DB layer details, see appendix
Date : 2025-12-21 Size : 653kb User : 钟波
[CA auth] prob3 DL : 0: Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to answer each of the below questions. (a) Given a positive integer N, check whether it is prime or not. 1-1• Input: N • Output: Prime or Not • For example, Input: 31 • Output: prime (b) Given a positive integer N, find the smallest prime greater than N. • Input: N • Output: M • Example: Input: 25 • Output: 29 (c) For a composite number, N = 221 (13 ×17), Miller-Rabin test outputs N = 221 as ‘prime’ for a = 174. Such a are known as strong liars. Find all other strong liars for the N = 221. Similarly, for a = 137 , it shows that N = 221 is composite. Such a’s are known as strong witness of compositeness. Find other strong witnesses if any.-Miller-Rabin test is a primality test algorithm which determines whether a given number is prime or not. Implement Miller-Rabin primality test as given in the text book page 257, Algorithm 7.44. (aN− 1 6= 1 mod N) Write three functions to answer each of the below questions. (a) Given a positive integer N, check whether it is prime or not. 1-1• Input: N • Output: Prime or Not • For example, Input: 31 • Output: prime (b) Given a positive integer N, find the smallest prime greater than N. • Input: N • Output: M • Example: Input: 25 • Output: 29 (c) For a composite number, N = 221 (13 ×17), Miller-Rabin test outputs N = 221 as ‘prime’ for a = 174. Such a are known as strong liars. Find all other strong liars for the N = 221. Similarly, for a = 137 , it shows that N = 221 is composite. Such a’s are known as strong witness of compositeness. Find other strong witnesses if any.
Date : 2025-12-21 Size : 1kb User : jitender grover
[CA auth] q1 DL : 0: Consider an organization with three roles: A, B and C. Whenever B has to issue some instruction to A, B has to take permission via C and then only it will be obeyed by A. This permission is issued with the help of a digital signature. A verifies the credibility of the message using C s public key (and digital signature), like any other digital signature scheme.
Date : 2025-12-21 Size : 1kb User : jitender grover
[CA auth] 数字签名实验 DL : 0: DSA签名程序和DSA验证程序。签名程序流程： a. 读入字符串（从屏幕或文本文件中），字符串内容应包含自己的学号或姓名； b. 计算该字符串的SHA-1值； c. 生成DSA密钥对（利用dsa_make_key）； d. 利用dsa_export函数导出所生成的DSA密钥对的公钥，并保存到文件中（dsa_key.pub），供验证程序使用； e. 对第2步产生的SHA-1值进行签名，保存签名到文件中（signature.txt）(DSA signatures and DSA validator. Signature program flow: A. reads into a string (from screen or text file), and the string content should contain its own student number or name. B. calculates the SHA-1 value of the string. C. generates a DSA key pair (using dsa_make_key); D. uses the dsa_export function to derive the public key of the generated DSA key pair and saves it to the file (dsa_key.pub) for verification. E. signatures the SHA-1 value generated in the second step and saves the signature to the file (signature.txt).)
Date : 2025-12-21 Size : 2.83mb User : 王可爱努力