当前位置：
首页 资源下载
搜索资源 - public key exchange
搜索资源列表
-
0下载：
这是最新的MIRACL的最新版本，支持多种算法，如IBE加密、签名、验证-MIRACL is a Big Number Library which implements all of the primitives necessary to design Big Number Cryptography into your real-world application. It is primarily a tool for cryptographic system implementors. RSA
-
-
0下载：
Step 1: Generating a Parameter Set for the Diffie‐Hellman Key Agreement Algorithm
Step 2: Generating a Secret Key Using the Diffie‐Hellman Key Agreement Algorithm
Step 3: Use UDP to exchange DH public key
Step 4: Establish an AES‐256 encrypted
-
-
0下载：
This document specifies EAP-IKEv2, an Extensible Authentication
Protocol (EAP) method that is based on the Internet Key Exchange
(IKEv2) protocol. EAP-IKEv2 provides mutual authentication and
session key establishment between an EAP peer and an
-
-
0下载：
pcks#1开发示例,r加密方式是用私钥加密用公钥解密，双方互换公钥。-pcks# 1 development sample, r is encrypted using public key to decrypt the private key encryption, both sides exchange public key.
-
-
0下载：
Needham 协议 简单的公钥和私钥的交换以及authentication-Needham simple protocol exchange, and public and private key authentication
-
-
0下载：
The interface for a public key in the Diffie-Hellman key exchange protocol.
-
-
0下载：
实习内容 基于Diffle-Human的密钥交换
1 问题描述：
Diffle-Human算法是建立在DH公钥和私钥基础上的密钥分配算法，如A需要和B共享密钥时，A和B各自生成DH的公钥和私钥，公钥对外公布而私钥各自秘密保存
2 基本要求
在java平台上实现基于Diffle-Human的密钥交换-
Practical content-based key exchange Diffle-Human
A descr iption of the problem:
-
-
1下载：
SM2椭圆曲线公钥密码算法
第3部分：密钥交换协议-SM2 elliptic curve public key cryptography algorithm
Part 3: Key Exchange Protocol
-
-
0下载：
实验目的
原根与指标是解高次同余式的基础。在密码学中的Diffe-Hellman密钥交换协议、ElGamal公钥密码体制，以及其他许多密码协议和数字签名方案中都会用到原根及其性质。
实验内容与要求
求模n=43的最小原根，并建立其关于模43的指标表，将指标表写入g.txt中。
-Purpose and targets of the original root is the solution of high-order congruence basis. In cryptogra
-
-
0下载：
The RSA cryptosystem is the most widely-used public key cryptography algorithm in the world. It can be used to encrypt a message without the need to exchange a secret key separately. The RSA algorithm can be used for both public key encryption and di
-
-
0下载：
Implement Diffie-Hellman Key exchange protocol and demonstrate that at the
end, both person will have a common Key.
Do the following:
1. Set a variable p ( e.g. p = 37) and g (e.g. g = 5).
2. Generate a, a random number mod p. Now generate A,
-
