scholarly journals GENERAL TECHNOLOGY OF ENCRYPTION AND INTEGRATION OF DATA IN A PATTERN OF A PICTURE OF IMAGES THAT IS RESISTANT TO JPEG COMPRESSION

2021 ◽  
pp. 22-28
Author(s):  
Oleksandr Kravchenko
Keyword(s):  
Statistical Methods ◽  
Programming Language ◽  
Communication Channel ◽  
Lossy Compression ◽  
Jpeg Compression ◽  
Covert Communication ◽  
Information Protection ◽  
Secret Key ◽  
Original Message ◽  
High Level

The object of the thesis is the use of steganographic methods for organizing a covert communication channel in a public channel, providing resistance to lossy compression. The aim of the thesis is to develop an algorithm for embedding data into bitmap images that is resistant to JPEG compression and attacks on the container. In this thesis, the features of the JPEG algorithm are investigated, steganographic methods of information protection are analyzed, and a steganographic algorithm is designed that is resistant to JPEG compression and attacks on the container. Additional security is provided by the polyalphabetic substitution cipher and user secret key used to encrypt the original message. The algorithm was developed using the Python 3 programming language, the NumPy, SciPy, MatPlotLib libraries and the Jupyter Lab package. The task was completed using standard mathematical and statistical methods and tools of the high-level programming language Python 3.

scholarly journals Subject Review: Comparison Between 3DES, AES and HiSea Algorithms

2019 ◽  
pp. 97-103
Author(s):  
Shaimaa Khudhair Salah ◽  
Waleed Rasheed Humood ◽  
Ahmed Othman Khalaf ◽  
Zainab Khyioon Abdalrdha
Keyword(s):  
Encryption Algorithm ◽  
The Internet ◽  
Sensitive Information ◽  
Information Protection ◽  
Sources Of Information ◽  
Secret Key ◽  
High Level ◽  
Security Communication

Security is one of the main sources of information protection, especially sensitive information that is transmitted over the Internet. Encryption is one of the most important elements used, which is an effective and necessary element to provide high-level security communication between different entities by transmitting unclear and encrypted information that does not allow unauthorized person to access, the method of choosing the appropriate and correct encryption algorithm is important to provide a secure connection that provides a more efficient and accurate encryption system. In this paper, we will review the algorithms (Triple DES, AES & HiSea) for secret key encryption that are most commonly used for this type of encryption.

scholarly journals A Runtime System for XML Transformations in Java

2004 ◽  
Vol 11 (33) ◽  
Author(s):  
Aske Simon Christensen ◽  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Programming Language ◽  
Program Analysis ◽  
Companion Paper ◽  
General Purpose ◽  
Runtime System ◽  
Xml Documents ◽  
Level Data ◽  
High Level ◽  
The Given

We show that it is possible to extend a general-purpose programming language with a convenient high-level data-type for manipulating XML documents while permitting (1) precise static analysis for guaranteeing validity of the constructed XML documents relative to the given DTD schemas, and (2) a runtime system where the operations can be performed efficiently. The system, named Xact, is based on a notion of immutable XML templates and uses XPath for deconstructing documents. A companion paper presents the program analysis; this paper focuses on the efficient runtime representation.

scholarly journals Learners Programming Language a Helping System for Introductory Programming Courses

2016 ◽  
Vol 35 (3) ◽  
pp. 347-358
Author(s):  
Muhammad Shumail Naveed ◽  
Muhammad Sarim ◽  
Kamran Ahsan
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Retention Rate ◽  
Introductory Programming ◽  
Source Program ◽  
Definition Of ◽  
High Level ◽  
Novice Students ◽  
Introductory Programming Courses ◽  
Programming Courses

Programming is the core of computer science and due to this momentousness a special care is taken in designing the curriculum of programming courses. A substantial work has been conducted on the definition of programming courses, yet the introductory programming courses are still facing high attrition, low retention and lack of motivation. This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory programming before introducing the first imperative programming course. The overall objective and design philosophy of LPL is based on a hypothesis that the soft introduction of a simple and paradigm specific textual programming can increase the motivation level of novice students and reduce the congenital complexities and hardness of the first programming course and eventually improve the retention rate and may be fruitful in reducing the dropout/failure level. LPL also generates the equivalent high level programs from user source program and eventually very fruitful in understanding the syntax of introductory programming languages. To overcome the inherent complexities of unusual and rigid syntax of introductory programming languages, the LPL provide elementary programming concepts in the form of algorithmic and plain natural language based computational statements. The initial results obtained after the introduction of LPL are very encouraging in motivating novice students and improving the retention rate.

scholarly journals Tree-Shaped Formats of Address Programming Language

2021 ◽  
Vol 4 ◽  
pp. 78-87
Author(s):  
Yury Yuschenko
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Theoretical Research ◽  
Direct Access ◽  
Complex Data ◽  
Abstract Data Types ◽  
Data Types ◽  
Abstract Data ◽  
The One ◽  
High Level

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

Migrating JAVA to Mobile Platforms through HAXE

2016 ◽  
pp. 240-268 ◽  
Author(s):  
Pablo Nicolás Díaz Bilotto ◽  
Liliana Favre
Keyword(s):  
Programming Language ◽  
Mobile Applications ◽  
Software Evolution ◽  
Wide Spectrum ◽  
The Other ◽  
Model Transformations ◽  
Mobile Platforms ◽  
Model Driven ◽  
Definition Of ◽  
High Level

Software developers face several challenges in deploying mobile applications. One of them is the high cost and technical complexity of targeting development to a wide spectrum of platforms. The chapter proposes to combine techniques based on MDA (Model Driven Architecture) with the HaXe language. The outstanding ideas behind MDA are separating the specification of the system functionality from its implementation on specific platforms, managing the software evolution, increasing the degree of automation of model transformations, and achieving interoperability with multiple platforms. On the other hand, HaXe is a very modern high level programming language that allows us to generate mobile applications that target all major mobile platforms. The main contributions of this chapter are the definition of a HaXe metamodel, the specification of a model-to-model transformation between Java and HaXe and, the definition of an MDA migration process from Java to mobile platforms.

Idris, a general-purpose dependently typed programming language: Design and implementation

2013 ◽  
Vol 23 (5) ◽  
pp. 552-593 ◽  
Author(s):  
EDWIN BRADY
Keyword(s):  
Programming Language ◽  
Type Theory ◽  
Functional Programming ◽  
General Purpose ◽  
High Level Language ◽  
Type Checking ◽  
Programming Language Design ◽  
Implicit Arguments ◽  
Type Classes ◽  
High Level

AbstractMany components of a dependently typed programming language are by now well understood, for example, the underlying type theory, type checking, unification and evaluation. How to combine these components into a realistic and usable high-level language is, however, folklore, discovered anew by successive language implementors. In this paper, I describe the implementation ofIdris, a new dependently typed functional programming language.Idrisis intended to be ageneral-purposeprogramming language and as such provides high-level concepts such as implicit syntax, type classes anddonotation. I describe the high-level language and the underlying type theory, and present a tactic-based method forelaboratingconcrete high-level syntax with implicit arguments and type classes into a fully explicit type theory. Furthermore, I show how this method facilitates the implementation of new high-level language constructs.

Sign in / Sign up

Export Citation Format

Share Document