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.

A Left Weighted Catalan Extension

Integers ◽  
2010 ◽  
Vol 10 (6) ◽  
Author(s):  
Paul R. F. Schumacher
Keyword(s):  
Catalan Numbers ◽  
Ballot Problem

AbstractThere are many representations of the Catalan numbers. In this article, we will examine the ballot problem and extend it beyond the standard

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.

scholarly journals ENCRYPTION OF 3D PLANE IN GIS USING VORONOI-DELAUNAY TRIANGULATIONS AND CATALAN NUMBERS

2021 ◽  
pp. 1205
Author(s):  
Faruk Selimović ◽  
Predrag Stanimirović ◽  
Muzafer Saračević ◽  
Selver Pepić
Keyword(s):  
Programming Language ◽  
Operating Systems ◽  
Combinatorial Problems ◽  
Catalan Numbers ◽  
Computer Architectures ◽  
Incremental Algorithm ◽  
Point Selection ◽  
Delaunay Triangulations ◽  
Java Programming ◽  
Selection Of

A method of encryption of the 3D plane in Geographic Information Systems (GIS) is presented. The method is derived using Voronoi-Delaunay triangulation and properties of Catalan numbers. The Voronoi-Delaunay incremental algorithm is presented as one of the most commonly used triangulation techniques for random point selection. In accordance with the multiple applications of Catalan numbers in solving combinatorial problems and their "bit-balanced" characteristic, the process of encrypting and decrypting the coordinates of points using the Lattice Path method (walk on the integer lattice) or LIFO model is given. The triangulation of the plane started using decimal coordinates of a set of given planar points. Afterward, the resulting decimal values of the coordinates are converted to corresponding binary records and the encryption process starts by a random selection of the Catalan key according to the LIFO model. These binary coordinates are again converted into their original decimal values, which enables the process of encrypted triangulation. The original triangulation of the plane can be generated by restarting the triangulation algorithm. Due to its exceptional efficiency in terms of launching programs on various computer architectures and operating systems, Java programming language enables an efficient implementation of our method.

scholarly journals COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE

2009 ◽  
Vol 20 (06) ◽  
pp. 659-678 ◽  
Author(s):  
R. BLANCO
Keyword(s):  
Monomial Ideal ◽  
Critical Value ◽  
Monomial Ideals ◽  
Combinatorial Problems ◽  
Catalan Numbers ◽  
Partial Sums ◽  
Ordered Trees ◽  
Plane Trees ◽  
Special Case ◽  
Made In

We study monomial ideals, always locally given by a monomial, like a reasonable first step to estimate in general the number of monoidal transformations of Villamayor's algorithm of resolution of singularities. The resolution of a monomial ideal [Formula: see text] is interesting due to its identification with the particular toric problem [Formula: see text]. In the special case, when all the exponents ai are greater than or equal to the critical value c, we construct the largest branch of the resolution tree which provides an upper bound involving partial sums of Catalan numbers. This case will be called "minimal codimensional case". Partial sums of Catalan numbers (starting 1,2,5,…) are 1,3,8,22,…. These partial sums are well known in Combinatorics and count the number of paths starting from the root in all ordered trees with n + 1 edges. Catalan numbers appear in many combinatorial problems, counting the number of ways to insert n pairs of parenthesis in a word of n + 1 letters, plane trees with n + 1 vertices,…, etc. The non-minimal case, when there exists some exponent ai0 smaller than c, will be called "case of higher codimension". In this case, still unresolved, we give an example to state the foremost troubles. Computation of examples has been helpful in both cases to study the behavior of the resolution invariant. Computations have been made in Singular (see [8]) using the desing package by Bodnár and Schicho, see [4].

A novel cryptosystem based on abstract automata and Latin cubes

2015 ◽  
Vol 52 (2) ◽  
pp. 221-232
Author(s):  
Pál Dömösi ◽  
Géza Horváth
Keyword(s):  
Block Cipher ◽  
Finite Automata ◽  
Theoretical Background ◽  
Point Of View ◽  
Theoretical Point ◽  
Transition Matrices ◽  
Encryption And Decryption ◽  
Secret Keys ◽  
Automata Network ◽  
Fully Functioning

In this paper we introduce a novel block cipher based on the composition of abstract finite automata and Latin cubes. For information encryption and decryption the apparatus uses the same secret keys, which consist of key-automata based on composition of abstract finite automata such that the transition matrices of the component automata form Latin cubes. The aim of the paper is to show the essence of our algorithms not only for specialists working in compositions of abstract automata but also for all researchers interested in cryptosystems. Therefore, automata theoretical background of our results is not emphasized. The introduced cryptosystem is important also from a theoretical point of view, because it is the first fully functioning block cipher based on automata network.

Enhanced Security Authentication of WiMAX using EC3A

2017 ◽  
Vol 7 (8) ◽  
pp. 219
Author(s):  
Mohd Javed ◽  
Khaleel Ahmad ◽  
Ahmad Talha Siddiqui
Keyword(s):  
Cellular Automata ◽  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Information Rate ◽  
Security Authentication ◽  
Encryption And Decryption ◽  
High Information

WiMAX is the innovation and upgradation of 802.16 benchmarks given by IEEE. It has numerous remarkable qualities, for example, high information rate, the nature of the service, versatility, security and portability putting it heads and shoulder over the current advancements like broadband link, DSL and remote systems. Though like its competitors the concern for security remains mandatory. Since the remote medium is accessible to call, the assailants can undoubtedly get into the system, making the powerless against the client. Many modern confirmations and encryption methods have been installed into WiMAX; however, regardless it opens with up different dangers. In this paper, we proposed Elliptic curve Cryptography based on Cellular Automata (EC3A) for encryption and decryption the message for improving the WiMAX security

ECG Acquisition Based AVR Microcontroller and Java Application for Visualisation via Email Service

2017 ◽  
Vol 7 (1) ◽  
pp. 153-158
Author(s):  
Christian TCHAPGA TCHITO ◽  
◽  
Gaby Eric TCHIMMOUE ◽  
Daniel TCHIOTSOP ◽  
Enow ABUNAW T. ◽  
...  
Keyword(s):  
Java Application ◽  
Avr Microcontroller

Kombinasi Mode Cipher Block Chaining Dengan Algoritma Triangle Chain Cipher Pada Penyandian Login Website

2018 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Dafirius Lombu ◽  
Siska Dame Tarihoran ◽  
Irwan Gulo
Keyword(s):  
Operation Mode ◽  
Feedback Mechanism ◽  
Database Access ◽  
Original Meaning ◽  
Mode Of Operation ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Block Chaining

Generally, the database access of a website lies in the user login. When the login data is not accompanied by security techniques, it is very easily accessible by other parties. One effort that can be done to solve the problem is to encode the login data of website users based on cryptographic technique algorithm. Triangle Chain Cipher (TCC) is one of the classic cryptographic algorithms that encode data doubly and generate keys randomly along the plain. The process of encryption and decryption are interdependent to be one of the advantages of this algorithm. This algorithm will be more effective when combined with the Cipher Block Chaining (CBC) operation mode that is widely used in modern cryptographic algorithms today. The feedback mechanism between the blocks in this mode of operation is the operating advantage. This study describes how to combine the mode of operation of block chaining cipher with triangle chain cipher algorithm so that cipher data login website generated more random and difficult to find its original meaning.

Spring Framework for Testing

2020 ◽  
Author(s):  
Darshak Mota ◽  
Neel Zadafiya ◽  
Jinan Fiaidhi
Keyword(s):  
Web Application ◽  
Application Development ◽  
Spring Framework ◽  
Java Application ◽  
Development Framework ◽  
Development Life Cycle ◽  
Form Model ◽  
Project Structure ◽  
Model View ◽  
The Web

Java Spring is an application development framework for enterprise Java. It is an open source platform which is used to develop robust Java application easily. Spring can also be performed using MVC structure. The MVC architecture is based on Model View and Controller techniques, where the project structure or code is divided into three parts or sections which helps to categorize the code files and other files in an organized form. Model, View and Controller code are interrelated and often passes and fetches information from each other without having to put all code in a single file which can make testing the program easy. Testing the application while and after development is an integral part of the Software Development Life Cycle (SDLC). Different techniques have been used to test the web application which is developed using Java Spring MVC architecture. And compares the results among all the three different techniques used to test the web application.

Sign in / Sign up

Export Citation Format

Share Document