Skip to content
体验新版
项目
组织
正在加载...
登录
切换导航
打开侧边栏
OpenHarmony
Third Party Openssl
提交
2e4a99f3
T
Third Party Openssl
项目概览
OpenHarmony
/
Third Party Openssl
接近 2 年 前同步成功
通知
12
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看板
提交
2e4a99f3
编写于
12月 30, 2004
作者:
A
Andy Polyakov
浏览文件
操作
浏览文件
下载
电子邮件补丁
差异文件
AES-CFB[18] 2x optimization. Well, I bet nobody cares about AES-CFB1
performance, but anyway...
上级
e90fadda
变更
1
隐藏空白更改
内联
并排
Showing
1 changed file
with
20 addition
and
46 deletion
+20
-46
crypto/aes/aes_cfb.c
crypto/aes/aes_cfb.c
+20
-46
未找到文件。
crypto/aes/aes_cfb.c
浏览文件 @
2e4a99f3
...
...
@@ -158,61 +158,35 @@ void AES_cfb128_encrypt(const unsigned char *in, unsigned char *out,
/* This expects a single block of size nbits for both in and out. Note that
it corrupts any extra bits in the last byte of out */
/* Untested, once it is working, it will be optimised */
void
AES_cfbr_encrypt_block
(
const
unsigned
char
*
in
,
unsigned
char
*
out
,
const
int
nbits
,
const
AES_KEY
*
key
,
unsigned
char
*
ivec
,
const
int
enc
)
{
int
n
;
int
n
,
rem
,
num
;
unsigned
char
ovec
[
AES_BLOCK_SIZE
*
2
];
assert
(
in
&&
out
&&
key
&&
ivec
);
if
(
enc
)
{
/* construct the new IV */
AES_encrypt
(
ivec
,
ovec
,
key
);
/* encrypt the input */
for
(
n
=
0
;
n
<
(
nbits
+
7
)
/
8
;
++
n
)
out
[
n
]
=
in
[
n
]
^
ovec
[
n
];
/* fill in the first half of the new IV with the current IV */
memcpy
(
ovec
,
ivec
,
AES_BLOCK_SIZE
);
/* and put the ciphertext in the second half */
memcpy
(
ovec
+
AES_BLOCK_SIZE
,
out
,(
nbits
+
7
)
/
8
);
/* shift ovec left most of the bits... */
memmove
(
ovec
,
ovec
+
nbits
/
8
,
AES_BLOCK_SIZE
+
(
nbits
%
8
?
1
:
0
));
/* now the remaining bits */
if
(
nbits
%
8
!=
0
)
for
(
n
=
0
;
n
<
AES_BLOCK_SIZE
;
++
n
)
{
ovec
[
n
]
<<=
nbits
%
8
;
ovec
[
n
]
|=
ovec
[
n
+
1
]
>>
(
8
-
nbits
%
8
);
}
/* finally, move it back into place */
memcpy
(
ivec
,
ovec
,
AES_BLOCK_SIZE
);
}
else
{
/* construct the new IV in the first half of ovec */
AES_encrypt
(
ivec
,
ovec
,
key
);
/* decrypt the input */
for
(
n
=
0
;
n
<
(
nbits
+
7
)
/
8
;
++
n
)
out
[
n
]
=
in
[
n
]
^
ovec
[
n
];
if
(
nbits
<=
0
||
nbits
>
128
)
return
;
/* fill in the first half of the new IV with the current IV */
memcpy
(
ovec
,
ivec
,
AES_BLOCK_SIZE
);
/* append the ciphertext */
memcpy
(
ovec
+
AES_BLOCK_SIZE
,
in
,(
nbits
+
7
)
/
8
);
/* shift ovec left most of the bits... */
memmove
(
ovec
,
ovec
+
nbits
/
8
,
AES_BLOCK_SIZE
+
(
nbits
%
8
?
1
:
0
));
/* now the remaining bits */
if
(
nbits
%
8
!=
0
)
/* construct the new IV */
AES_encrypt
(
ivec
,
ivec
,
key
);
num
=
(
nbits
+
7
)
/
8
;
if
(
enc
)
/* encrypt the input */
for
(
n
=
0
;
n
<
num
;
++
n
)
out
[
n
]
=
(
ovec
[
AES_BLOCK_SIZE
+
n
]
=
in
[
n
]
^
ivec
[
n
]);
else
/* decrypt the input */
for
(
n
=
0
;
n
<
num
;
++
n
)
out
[
n
]
=
(
ovec
[
AES_BLOCK_SIZE
+
n
]
=
in
[
n
])
^
ivec
[
n
];
/* shift ovec left... */
rem
=
nbits
%
8
;
num
=
nbits
/
8
;
if
(
rem
==
0
)
memcpy
(
ivec
,
ovec
+
num
,
AES_BLOCK_SIZE
);
else
for
(
n
=
0
;
n
<
AES_BLOCK_SIZE
;
++
n
)
{
ovec
[
n
]
<<=
nbits
%
8
;
ovec
[
n
]
|=
ovec
[
n
+
1
]
>>
(
8
-
nbits
%
8
);
}
/* finally, move it back into place */
memcpy
(
ivec
,
ovec
,
AES_BLOCK_SIZE
);
}
ivec
[
n
]
=
ovec
[
n
+
num
]
<<
rem
|
ovec
[
n
+
num
+
1
]
>>
(
8
-
rem
);
/* it is not necessary to cleanse ovec, since the IV is not secret */
}
...
...
编辑
预览
Markdown
is supported
0%
请重试
或
添加新附件
.
添加附件
取消
You are about to add
0
people
to the discussion. Proceed with caution.
先完成此消息的编辑!
取消
想要评论请
注册
或
登录