Research on the File Encryption and Programming Based on Matrix Transformation

2014 ◽  
Vol 484-485 ◽  
pp. 876-880
Author(s):  
Jiang Tao Geng ◽  
Qi Huang
Keyword(s):  
Source Code ◽  
Matrix Multiplication ◽  
Combinatorial Problems ◽  
Matrix Transformation ◽  
Electronic Document ◽  
File Transfers ◽  
Encryption And Decryption ◽  
Linear Transform ◽  
Programming Software ◽  
Class Of Matrices

Any linear transform matrix can be used to easily calculate a consistent form, and a plurality of conversion can be easily connected together by matrix multiplication. When performing file transfers, you can encrypt files matrix transformation. Article presents a matrix-based electronic document encryption and decryption algorithm, which relies on a special class of matrices combinatorial problems, the method to improve the security of electronic document system is feasible and effective, and finally give the source code and programming software.

A new kind of encryption and decryption of RGB colour image using permutation matrix multiplication

2022 ◽  
Author(s):  
Avinash N. ◽  
Jaraldpushparaj S. ◽  
Sathinathan T. ◽  
Britto Antony Xavier G.
Keyword(s):  
Matrix Multiplication ◽  
Permutation Matrix ◽  
Colour Image ◽  
Encryption And Decryption

Matrix transformations between some classes of sequences

1970 ◽  
Vol 68 (1) ◽  
pp. 99-104 ◽  
Author(s):  
C. G. Lascarides ◽  
I. J. Maddox
Keyword(s):  
Matrix Transformation ◽  
Matrix Transformations ◽  
Complex Numbers ◽  
Infinite Matrix ◽  
The Matrix ◽  
Complex Sequences ◽  
Class Of Matrices

Let A = (ank) be an infinite matrix of complex numbers ank (n, k = 1, 2,…) and X, Y two subsets of the space s of complex sequences. We say that the matrix A defines a (matrix) transformation from X into Y, and we denote it by writing A: X → Y, if for every sequence x = (xk)∈X the sequence Ax = (An(x)) is in Y, where An(x) = Σankxk and the sum without limits is always taken from k = 1 to k = ∞. The sequence Ax is called the transformation of x by the matrix A. By (X, Y) we denote the class of matrices A such that A: X → Y.

scholarly journals A Modifying of Hill Cipher Algorithm with 3 Substitution Caesar Cipher

2017 ◽  
Vol 1 ◽  
pp. 157-163
Author(s):  
Azzam Mujaddid ◽  
Sumarsono Sumarsono
Keyword(s):  
Matrix Multiplication ◽  
Process Modification ◽  
Hill Cipher ◽  
Encryption And Decryption ◽  
Time Required ◽  
The Hill

The hill cipher algorithm has the uniqueness of using matrix multiplication in the process where the key used is a matrix that has weaknesses in the process of encryption and decryption. In this paper will be modified to the encryption process with caesar cipher substitution. The principle of the hill cipher algorithm using the multiplication of the 2x2 key matrix of keys is enhanced through process modification lies in the combination of initial character determination using the substitution of 3 caesar ciphers. From the results of this modification can be seen that the more the number of characters processed the time required will be longer. The magnitude of the determinant also affects time and size during the poses. A 1 character increment occurs if the initial character of the encryption process is an odd number.

scholarly journals Encryption based on Ballot, Stack permutations and Balanced Parentheses using Catalan-keys

2018 ◽  
Vol 14 (2) ◽  
Author(s):  
Muzafer Saračević ◽  
Edin Korićanin ◽  
Enver Biševac
Keyword(s):  
Combinatorial Problems ◽  
Catalan Numbers ◽  
Java Application ◽  
Encryption And Decryption ◽  
Ballot Problem

This paper examines the possibilities of applying Catalan numbers in cryptography. It also offers the application of appropriate combinatorial problems (Ballot Problem, Stack permutations and Balanced Parentheses) in encryption and decryption of files and plaintext. The paper analyzes the properties of Catalan numbers and their relation to these combined problems. Applied copyright method is related to the decomposition of Catalan numbers in the process of efficient keys generating. Java software solution which enables key generating with the properties of the Catalan numbers is presented at the end of the paper. Java application allows encryption and decryption of plaintext based on the generated key and combinatorial problems.

scholarly journals Efficient Parallel Implementation of Matrix Multiplication for Lattice-Based Cryptography on Modern ARM Processor

2018 ◽  
Vol 2018 ◽  
pp. 1-10 ◽  
Author(s):  
Taehwan Park ◽  
Hwajeong Seo ◽  
Junsub Kim ◽  
Haeryong Park ◽  
Howon Kim
Keyword(s):  
Parallel Implementation ◽  
Matrix Multiplication ◽  
Key Generation ◽  
Arm Processor ◽  
Large Size ◽  
Vector Addition ◽  
Encryption And Decryption ◽  
Previous State ◽  
Learning With Errors ◽  
Lattice Based Cryptography

Recently, various types of postquantum cryptography algorithms have been proposed for the National Institute of Standards and Technology’s Postquantum Cryptography Standardization competition. Lattice-based cryptography, which is based on Learning with Errors, is based on matrix multiplication. A large-size matrix multiplication requires a long execution time for key generation, encryption, and decryption. In this paper, we propose an efficient parallel implementation of matrix multiplication and vector addition with matrix transpose using ARM NEON instructions on ARM Cortex-A platforms. The proposed method achieves performance enhancements of 36.93%, 6.95%, 32.92%, and 7.66%. The optimized method is applied to the Lizard. CCA key generation step enhances the performance by 7.04%, 3.66%, 7.57%, and 9.32% over previous state-of-the-art implementations.

scholarly journals KernelFaRer

2021 ◽  
Vol 18 (3) ◽  
pp. 1-22
Author(s):  
João P. L. De Carvalho ◽  
Braedy Kuzma ◽  
Ivan Korostelev ◽  
José Nelson Amaral ◽  
Christopher Barton ◽  
...  
Keyword(s):  
Deep Learning ◽  
Linear Algebra ◽  
Pattern Matching ◽  
Source Code ◽  
Matrix Multiplication ◽  
Fully Integrated ◽  
General Matrix ◽  
The Past ◽  
Compiler Framework ◽  
Alternative Solutions

Well-crafted libraries deliver much higher performance than code generated by sophisticated application programmers using advanced optimizing compilers. When a code pattern for which a well-tuned library implementation exists is found in the source code of an application, the highest performing solution is to replace the pattern with a call to the library. Idiom-recognition solutions in the past either required pattern matching machinery that was outside of the compilation framework or provided a very brittle solution that would fail even for minor variants in the pattern source code. This article introduces Kernel Find & Replacer ( KernelFaRer ), an idiom recognizer implemented entirely in the existing LLVM compiler framework. The versatility of KernelFaRer is demonstrated by matching and replacing two linear algebra idioms, general matrix-matrix multiplication (GEMM), and symmetric rank-2k update (SYR2K). Both GEMM and SYR2K are used extensively in scientific computation, and GEMM is also a central building block for deep learning and computer graphics algorithms. The idiom recognition in KernelFaRer is much more robust than alternative solutions, has a much lower compilation overhead, and is fully integrated in the broadly used LLVM compilation tools. KernelFaRer replaces existing GEMM and SYR2K idioms with computations performed by BLAS, Eigen, MKL (Intel’s x86), ESSL (IBM’s PowerPC), and BLIS (AMD). Gains in performance that reach 2000× over hand-crafted source code compiled at the highest optimization level demonstrate that replacing application code with library call is a performant solution.

Programming and Implementation of File Encryption System Based on Matrix Transformation

2013 ◽  
Vol 416-417 ◽  
pp. 1502-1506
Author(s):  
Hai Fei Xiang
Keyword(s):  
Special Class ◽  
Encryption Algorithm ◽  
Matrix Transformation ◽  
The Internet ◽  
Electronic Document ◽  
File Transfer ◽  
Electronic Documents ◽  
E Mail

File transfer and e-mail business dealings have a lot of insecurity on the Internet. This paper presents a encryption algorithm of electronic documents based on matrix, and it brings forward implementing by VC.the algorithm relies on a special class of matrix combination, the method is feasible and effective to improve the security of the electronic document system. Finally, the code is given.

Sign in / Sign up

Export Citation Format

Share Document