scholarly journals Playfair with Multi Strata Encryption

2021 ◽  
pp. 3237-3242
Author(s):  
Raghad K. Salih ◽  
Madeha Sh. Yousif
Keyword(s):  

     Playfair cipher is a substitution scheme. The classical playfair scheme has a limited matrix size  containing only uppercase letters, so it is prone to hackers and cryptanalysis. To increase the resistance of playfair cipher, a new encipherment and decipherment method is proposed in this work, which depends on the permutation and its inverse, respectively. In addition, a modified  key matrix is utilized, which includes capital and small Alphabets, numbers, and 38 special characters collected from ASCII codes. In the proposed method, both substitution and transposition schemes are used, where the first stratum of the cipher is a substitution by using  key matrix and the second stratum is a transposition by using permutation key which provides multi strata resistance to brute force and other cryptanalysis attacks. A comparison between the traditional playfair scheme and the proposed method demonstrates that the encoded text is hard to recognize by cryptanalysts, which improves the security of the encryption process.

2017 ◽  
Vol 8 (2) ◽  
Author(s):  
Andreas Budiman ◽  
Dennis Gunawan ◽  
Seng Hansun

Plagiarism is a behavior that causes violence of copyrights. Survey shows 55% of college presidents say that plagiarism in students’ papers has increased over the past 10 years. Therefore, an application for detecting plagiarism is needed, especially for teachers. This plagiarism checker application is made by using Visual C# 2010. The plagiarism checker uses hamming distance algorithm for matching line code of the source code. This algorithm works by matching the same length string of the code programs. Thus, it needs brute will be matched with hamming distance. Another important thing for detecting plagiarism is the preprocessing, which is used to help the algorithm for detecting plagiarized source code. This paper shows that the application works good in detecting plagiarism, the hamming distance algorithm and brute force algorithm works better than levenstein distance algorithm for detecting structural type of plagiarism and this thesis also shows that the preprocessing could help the application to increase its percentage and its accuracy. Index Terms—Brute Force, Hamming Distance, Plagiarisme, Preprocessing.


1982 ◽  
Vol 49 (5) ◽  
pp. 347-351 ◽  
Author(s):  
C. Nuytten ◽  
D. Vandeplassche ◽  
E. van Walle ◽  
L. Vanneste

2019 ◽  
Vol 14 (9) ◽  
pp. 2288-2299 ◽  
Author(s):  
Salman Salamatian ◽  
Wasim Huleihel ◽  
Ahmad Beirami ◽  
Asaf Cohen ◽  
Muriel Medard
Keyword(s):  

2007 ◽  
Vol 10 (3) ◽  
pp. 439-460 ◽  
Author(s):  
G. Laccetti ◽  
G. Schmid
Keyword(s):  

Author(s):  
Anh-Duy Vu ◽  
Jea-Il Han ◽  
Hong-An Nguyen ◽  
Young-Man Kim ◽  
Eun-Jin Im
Keyword(s):  

2012 ◽  
Vol 14 (3) ◽  
pp. 368-372
Author(s):  
David Cole ◽  
Melvyn Green
Keyword(s):  

2002 ◽  
Vol 734 ◽  
Author(s):  
Vladislav Skorokhod

ABSTRACTAn equivalent circuit model of electrical conduction in polymer-filler particulate composites was developed in this study. The equivalent circuit was constructed for an individual composite particle with a sub-monolayer of conductive filler, where the filler particles play the role of circuit nodes, and inter-particle contacts are represented by resistors between the nodes. The mathematical representation of the equivalent circuit in the form of a linear system of equations for nodal potentials was solved numerically with Matlab software to calculate conductance of the composite as a function of the amount of conductive filler, filled fraction of the monolayer, filler-to-matrix size ratio and the degree of structuredness (non-randomness) of the filler material. Additionally, percolation concentrations and statistical distributions of composite conductance were calculated as functions of the filler-to-matrix size ratio.


2010 ◽  
Author(s):  
J. Audenaert ◽  
G. Durinck ◽  
F. Vandeghinste ◽  
G. Deconinck ◽  
P. Hanselaer

Author(s):  
Francis Deboeverie ◽  
Sanne Roegiers ◽  
Gianni Allebosch ◽  
Peter Veelaert ◽  
Wilfried Philips

Sign in / Sign up

Export Citation Format

Share Document