Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
0b5cfe32
T
Third Party Openssl
项目概览
OpenHarmony
/
Third Party Openssl
大约 1 年 前同步成功
通知
9
Star
18
Fork
1
代码
文件
提交
分支
Tags
贡献者
分支图
Diff
Issue
0
列表
看板
标记
里程碑
合并请求
0
Wiki
0
Wiki
分析
仓库
DevOps
项目成员
Pages
T
Third Party Openssl
项目概览
项目概览
详情
发布
仓库
仓库
文件
提交
分支
标签
贡献者
分支图
比较
Issue
0
Issue
0
列表
看板
标记
里程碑
合并请求
0
合并请求
0
Pages
分析
分析
仓库分析
DevOps
Wiki
0
Wiki
成员
成员
收起侧边栏
关闭侧边栏
动态
分支图
创建新Issue
提交
Issue看板
提交
0b5cfe32
编写于
1月 21, 2000
作者:
U
Ulf Möller
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
Use comment from md_rand.c in rand.pod
上级
cc8709a0
变更
2
显示空白变更内容
内联
并排
Showing
2 changed file
with
11 addition
and
8 deletion
+11
-8
crypto/rand/md_rand.c
crypto/rand/md_rand.c
+1
-1
doc/crypto/rand.pod
doc/crypto/rand.pod
+10
-7
未找到文件。
crypto/rand/md_rand.c
浏览文件 @
0b5cfe32
...
@@ -188,7 +188,7 @@ static void ssleay_rand_add(const void *buf, int num, int add)
...
@@ -188,7 +188,7 @@ static void ssleay_rand_add(const void *buf, int num, int add)
*
*
* The input is chopped up into units of 16 bytes (or less for
* The input is chopped up into units of 16 bytes (or less for
* the last block). Each of these blocks is run through the hash
* the last block). Each of these blocks is run through the hash
* function as follow: The data passed to the hash function
* function as follow
s
: The data passed to the hash function
* is the current 'md', the same number of bytes from the 'state'
* is the current 'md', the same number of bytes from the 'state'
* (the location determined by in incremented looping index) as
* (the location determined by in incremented looping index) as
* the current 'block', the new key data 'block', and 'count'
* the current 'block', the new key data 'block', and 'count'
...
...
doc/crypto/rand.pod
浏览文件 @
0b5cfe32
...
@@ -106,13 +106,16 @@ working hash function ('md') and a counter ('count').
...
@@ -106,13 +106,16 @@ working hash function ('md') and a counter ('count').
Whenever seed data is added, it is inserted into the 'state' as
Whenever seed data is added, it is inserted into the 'state' as
follows.
follows.
The input is chopped up into units of 16 bytes (or less for the last
The input is chopped up into units of 16 bytes (or less for
block). Each of these blocks is run through the hash function. The
the last block). Each of these blocks is run through the hash
data passed to the hash function is the current 'md', the same number
function as follows: The data passed to the hash function
of bytes from the 'state' (the location determined by in incremented
is the current 'md', the same number of bytes from the 'state'
looping index) as the current 'block' and the new key data 'block'.
(the location determined by in incremented looping index) as
The result of this is kept in 'md' and also xored into the 'state' at
the current 'block', the new key data 'block', and 'count'
the same locations that were used as input into the hash function. I
(which is incremented after each use).
The result of this is kept in 'md' and also xored into the
'state' at the same locations that were used as input into the
hash function. I
believe this system addresses points 1 (hash function; currently
believe this system addresses points 1 (hash function; currently
SHA-1), 3 (the 'state'), 4 (via the 'md'), 5 (by the use of a hash
SHA-1), 3 (the 'state'), 4 (via the 'md'), 5 (by the use of a hash
function and xor).
function and xor).
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录