Arithmetic Operational Algorithm for Quick Data Encryption
Summary :
The paper proposes a method of variable-to-fixed length binary data encryption in the class of conventional cryptosystems. An encryption algorithm reduces an interval of the integers that mean candidates of cryptograph according to a key and messages. A decryption algorithm traces the trajectory of reduction of interval according to the key and cryptographs to reproduce the messages. These algorithms are executable with simple arithmetics on several registers. However, wiretappers without knowledge on the key cannot correctly reproduce messages since they cannot trace the trajectory of reduction. The exhaustive cryptanalysis identifies the correct decryption procedure only from cryptographs. The comparing cryptanalysis identifies the correct decryption procedure from some pairs of message and cryptograph. Asymptotic evaluations for the computational complexity of cryptanalysis show a satisfactory endurance against wiretapping.
- Publication
- IEICE TRANSACTIONS on transactions Vol.E71-E No.6 pp.567-573
- Publication Date
- 1988/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Foundations of Data Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hisashi SUZUKI, Suguru ARIMOTO, "Arithmetic Operational Algorithm for Quick Data Encryption" in IEICE TRANSACTIONS on transactions,
vol. E71-E, no. 6, pp. 567-573, June 1988, doi: .
Abstract: The paper proposes a method of variable-to-fixed length binary data encryption in the class of conventional cryptosystems. An encryption algorithm reduces an interval of the integers that mean candidates of cryptograph according to a key and messages. A decryption algorithm traces the trajectory of reduction of interval according to the key and cryptographs to reproduce the messages. These algorithms are executable with simple arithmetics on several registers. However, wiretappers without knowledge on the key cannot correctly reproduce messages since they cannot trace the trajectory of reduction. The exhaustive cryptanalysis identifies the correct decryption procedure only from cryptographs. The comparing cryptanalysis identifies the correct decryption procedure from some pairs of message and cryptograph. Asymptotic evaluations for the computational complexity of cryptanalysis show a satisfactory endurance against wiretapping.
URL: https://global.ieice.org/en_transactions/transactions/10.1587/e71-e_6_567/_p
Copy
@ARTICLE{e71-e_6_567,
author={Hisashi SUZUKI, Suguru ARIMOTO, },
journal={IEICE TRANSACTIONS on transactions},
title={Arithmetic Operational Algorithm for Quick Data Encryption},
year={1988},
volume={E71-E},
number={6},
pages={567-573},
abstract={The paper proposes a method of variable-to-fixed length binary data encryption in the class of conventional cryptosystems. An encryption algorithm reduces an interval of the integers that mean candidates of cryptograph according to a key and messages. A decryption algorithm traces the trajectory of reduction of interval according to the key and cryptographs to reproduce the messages. These algorithms are executable with simple arithmetics on several registers. However, wiretappers without knowledge on the key cannot correctly reproduce messages since they cannot trace the trajectory of reduction. The exhaustive cryptanalysis identifies the correct decryption procedure only from cryptographs. The comparing cryptanalysis identifies the correct decryption procedure from some pairs of message and cryptograph. Asymptotic evaluations for the computational complexity of cryptanalysis show a satisfactory endurance against wiretapping.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Arithmetic Operational Algorithm for Quick Data Encryption
T2 - IEICE TRANSACTIONS on transactions
SP - 567
EP - 573
AU - Hisashi SUZUKI
AU - Suguru ARIMOTO
PY - 1988
DO -
JO - IEICE TRANSACTIONS on transactions
SN -
VL - E71-E
IS - 6
JA - IEICE TRANSACTIONS on transactions
Y1 - June 1988
AB - The paper proposes a method of variable-to-fixed length binary data encryption in the class of conventional cryptosystems. An encryption algorithm reduces an interval of the integers that mean candidates of cryptograph according to a key and messages. A decryption algorithm traces the trajectory of reduction of interval according to the key and cryptographs to reproduce the messages. These algorithms are executable with simple arithmetics on several registers. However, wiretappers without knowledge on the key cannot correctly reproduce messages since they cannot trace the trajectory of reduction. The exhaustive cryptanalysis identifies the correct decryption procedure only from cryptographs. The comparing cryptanalysis identifies the correct decryption procedure from some pairs of message and cryptograph. Asymptotic evaluations for the computational complexity of cryptanalysis show a satisfactory endurance against wiretapping.
ER -
English
