arrow
返回

Reversible data mixing procedure for efficient public-key encryption

delete1998-01-01
delete5
PRE
AI
M
Mike Matyas *
M
Mohammad Peyravian
A
Allen Roginsky
N
Nev Zunic
DOI:10.1016/S0167-4048(98)80340-4delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper describes a data mixing method for encrypting a plain-text block using a block encryption algorithm (such as Elliptic Curve, RSA, etc.) having a block size smaller than that of the plaintext block. The process of encrypting a plaintext block consists of first mixing the plaintext block and then encrypting a portion or all of the mixed plaintext block. The mixing method is a reversible procedure which performs a 'complete' mixing of the plaintext block such chat no secret bit in the plaintext block can be determined unless every bit in the mixed plaintext block is known. The 'mixing' of the plaintext is done in such a way that encrypting only a small portion of the mixed plaintext will still provide the same level of protection as ii the entire plaintext was encrypted.
Keyword:
data mixing
encryption
hash function
symmetric key
asymmetric key
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Security
IF:
5.4
论文数:
4.6K
被引数:
1.4W

机构

暂无机构信息
引用论文

引用论文

暂无论文信息