Permutation Cipher Scheme Using Polynomials over a Field

スポンサーリンク

概要

• 論文の詳細を見る

• A permutation cipher scheme using polynomials over a field is presented. A permutation as well as substitution plays a major role in almost all conventional cryptosystems. But the security of the permutation depends on how symbols are permuted. This paper proposes the use of polynomials for the permutation and show that the scheme satisfies the following security criteria. (1) There are enough encryption keys to defend exhaustive attacks. (2) The permutation moves almost all samples into places which are different from the original places. (3) Most samples are shifted differently by different permutations. The permutation cipher scheme could be regarded as a scheme based on Reed-Solomon codes. The information symbols of the codes compose a key of the permutation cipher scheme.

• 社団法人電子情報通信学会の論文
• 1995-02-25

著者

• OKAMOTO Eiji

  School of Engineering, Hokkaido Tokai University

• Okamoto E

  Institute Of Information Sciences And Electronics University Of Tsukuba

• Mambo M

  Japan Advanced Inst. Sci. And Technol. Ishikawa‐ken Jpn

• Mambo Masahiro

  School Of Information Science Japan Advanced Institute Of Science And Technology

• Mambo Masahiro

  School Of Inform. Sci. Japan Advanced Institute Of Science And Technology

• Uyematsu T

  The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology

• Uyematsu T

  The Author Is With The Department Of Electrical And Electronic Engineering Tokyo Institute Of Techno

• UYEMATSU Tomohiko

  School of Information Science, Japan Advanced Institute of Science and Technology Ishikawa

• Okamoto Eiji

  Department Of Computer Science And Engineering Nagoya Institute Of Technology

関連論文

• Numerical estimation of heat distribution from the implantable battery system of an undulation pump LVAD
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem (Applications) (Cryptography and Information Security)
• The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem
• Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
• Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
• One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
• A Simple Parallel Algorithm for the Ziv-Lempel Encoding
• An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
• Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
• Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
• Permutation Cipher Scheme Using Polynomials over a Field
• A Secure Broadcast Communication Method with Short Messages (Special Section on Information Theory and Its Applications)
• Proxy Signatures: Delegation of the Power to Sign Messages (Special Section on Information Theory and Its Applications)
• Constructing Identity-Based Key Distribution Systems over Elliptic Curves (Special Section on Information Theory and Its Applications)
• The Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem(Public Key Cryptography)(Cryptography and Information Security)
• Complexity Analysis of the Cryptographic Primitive Problems through Square-Root Exponent(Discrete Mathematics and Its Applications)
• Proposal for New E-cash System Using Message Recovery Signature (特集 情報セキュリティの理論と応用)
• Feasibility of a remote monitoring system for patients with an implantable left ventricular assist device using Personal Handy-Phone System telecommunication technology
• On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks : Special Section on Cryptography and Information Security
• On the Security of the Okamoto-Tanaka ID-Based Key Exchange Scheme against Active Attacks
• Proxy Cryptosystems: Delegation of the Power to Decrypt Ciphertexts (Special Section on Cryptography and Information Security)
• Factoring Hard Integers on a Parallel Machine (Special Section on Discrete Mathematics and Its Applications)
• Application of Wavelet Packet Modulation to Mobile Communication(Wide Band Systems)
• Faster Factoring of Integers of a Special Form (Special Section on Discrete Mathematics and Its Applications)
• Algebraic Properties of Permutation Polynomials (Special Section on Discrete Mathematics and Its Applications)

もっと見る 閉じる

スポンサーリンク