Search

Digital Steganography is the art of hiding secret messages behind an innocent looking digital media that do not raise suspicions. In this paper, a new proposed image realization steganography method is introduced which is a mapping-based method that hides in an unrevealed manner and without any change in the image cover file. The image cover is only used for referencing. The proposed method generates the cover-secret mapping that will realize the concealed secret message without embedding the real message. A mapping between the American Standard Code of Information Interchange (ASCII) codes of a secret message and an image is performed and the positions of the secret message in the image is noted in a position array. This reference positions are then sent to the receiver after first being compressed by Huffman algorithm and then encrypted using Advanced Encryption Standard with 128 bits key (AES-128). The position array and the cover image are transferred separately, so that the interception of any one file alone will not conceal any information. In addition, it has unlimited capacity as specific matching positions can be used more than once. Furthermore, the proposed method has a reduced size of position key and mapping table, hence having high-speed searching and matching compared to prevailing methods. Furthermore, several experimental tests have been applied to assess the efficiency and performance of the new proposed method to evaluate it according to the widely used metrics: Mean Squared Error (MSE) and Peak Signal to Noise Ratio (PSNR). From the security point of view, Structural Similarity Index Measure (SSIM) together with Histogram have been performed. Moreover, it is critiqued showing its pros and cons and further compared with existing state-of-the-art research. The experimental results verified the efficacy of the new proposed method.

The purpose of this work are consideration of use of GPS for a research of roads and modeling of the vehicle/wheel machines (WM).Implementation for this problem of the measuring registering complex on a basis the Raspberry Pi 3/4 minicomputer, the GN-803G sensor and creation of the software in the language C/C ++ is considered.The obtained information about GPS and approaches of selection of necessary data from the messages on the basis of the NMEA 0183 standard submitted in the text ASCII form with the fields divided by a comma is analyzed. An assessment of opportunities of use of the obtained information is given.The scheme of connection of the GN-803N module to Raspberry 3/4 through the GPIO protocol is developed and proved.Reduction of the obtained data to a constant step with use of a polynom of Lagrange of the 2-nd order on three points of a variable step is considered.It is recommended at further use of this corrected data array in process modeling of the car application of a method of interpolation CatMull-Rom on the 4-th points at the fixed step. Program fragments are given in C/C ++.It is offered in the territory of RB during the determining of relative distances and a binding to cards at conversion it is possible to use the simplified linear formula lat_m= 112297,6196∙ Ddec lat , lon_m= 63215,444 ∙ Ddec lon .The offered technique of application of GPS, software, received data are planned to be used for a research of influence of the driver and road conditions on the movement of the vehicle and the subsequent their application when modeling in Matlab/ Simulink, and also in problems of preliminary debugging of management systems by self-driving vehicles.

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.

Cryptography is widely used to secure data and information so that it is not easily misused by parties who are not interested in the data. One type of cryptographic algorithm is Caesar Cipher and Vigenere Cipher. Both of these algorithms are classic cryptographic algorithms that need to be modified so that they become more optimal in the data security process. The first modification is to modify the Vigenere key using Fibonacci. In general, Vigenere Cipher will repeat the same keyword to complete the number of characters that are lacking so that the number of characters is the same as the number of characters in the plaintext. The second modification is to change or convert plaintext letters into ASCII letters so that the code is more difficult to solve. After the ASCII conversion process is done, the next results will be converted back in Hexa letters. In addition to the two modifications made, the steganography technique is also added by hiding the code behind the media in the form of images. Images that are sampled will be renamed and stored in different places.

With rapid evaluation of technologies, huge amount of critical information can exchange over unsecure network every day, secure and fast encryption schemes become more and more urgent need to provide the desirable confidentiality and thwart unauthorized access, lately and for many reasons, chaotic based encryption algorithms become more and more popular technique due to exceptionally superior characteristics such as simplicity, resistance attacks and high speed, in this paper the advantages of two nonlinear hyper-chaotic systems will utilized to strength the proposed encryption algorithm, the random sequences generated from systems will used to position scramble and value change of the plaintext, the main features of such method are efficiency, large key space, low computational overhead, and simple design as well as the experimental results demonstrate that the proposed method have more ability to thwart attacks.

A fundamental requirement for scientific treatment of board games is a simple and practical numbering of the map locations. With square grids, an obvious solution is coordinates along two orthogonal axes. Hexagonal grids, however, have three axes, and only one of them can be aligned with an edge of a square board. Various systems have been proposed for numbering hexagonal grids, and several remain in use. Computational tools that support games with hexagonal grids will presumably need to convert, or operate directly on, the grid coordinates. While it would be possible to write separate software for each of the different coordinate systems, a more general approach is to define a formal description of the coordinate system, which is then supplied as data, and have a single piece of software that can handle all possible hexagonal grid coordinates. Such a system is proposed here, after an exhaustive survey of the various existing coordinate systems, and a comprehensive investigation of the logical possibilities for defining a coordinate system on a hexagonal grid. The formal expression that defines any specific coordinate system consists of around ten characters in the standard 7-b ASCII alphabet, for maximum computational interoperability.

The active development of computer systems and information technologies implies an increase in the importance of ensuring the protection and security of information during its transfer or storage. Today, the fulfillment of the necessary data confidentiality requirements tends to the direction of cryptography and steganography. The choice of the applied method of encoding information directly depends on the goals of the user, as well as the available software. The main requirement for the message encoding process is the availability of acceptable computational complexity of the implementation. The article discusses methods of ensuring data confidentiality employing digital steganography, using BMP images as container files, and carrying out their subsequent compression to the JPEG format without losing hidden information. Mathematical methods of constructing a stegosystem for encoding ASCII are studied — a message, each character of which is encoded with exactly one byte. As a result, a computer program was created based on the Microsoft Visual Studio 2017 programming environment and the C# programming language (.NET Framework). The stereotype, in this case, is a sequence of steps between image pixels, into which information is embedded. In this case, the algorithm allows you to memorize not the entire sequence of steps (that is, not the entire keystroke), but only the first five characters of the key or half of the key.

A survey on automated lip-reading approaches is presented in this paper with the main focus being on deep learning related methodologies which have proven to be more fruitful for both feature extraction and classification. This survey also provides comparisons of all the different components that make up automated lip-reading systems including the audio-visual databases, feature extraction, classification networks and classification schemas. The main contributions and unique insights of this survey are: 1) A comparison of Convolutional Neural Networks with other neural network architectures for feature extraction; 2) A critical review on the advantages of Attention-Transformers and Temporal Convolutional Networks to Recurrent Neural Networks for classification; 3) A comparison of different classification schemas used for lip-reading including ASCII characters, phonemes and visemes, and 4) A review of the most up-to-date lip-reading systems up until early 2021.

Quick response (QR) code is a printed code of black and white squares that is able to store data without the use of any of the electronic devices. There are many existing researches on coloured QR code to increase the storage capacity but from time to time the storage capacity still need to be improved. This paper proposes the use ofcompress, multiplexing and multilayered techniques, as an integrated technique known as CoMM, to increase the storage of the existing QR code. The American Standard Code for Information Interchange (ASCII) text characters are used as an input and performance is measured by the number of characters that can be stored in a single black and white QR code version 40. The experiment metrics also include percentage of missing characters, number of produced QR code, and elapsed time to create the QR code. Simulation results indicate that the proposed algorithm stores 24 times more characters than the black and white QR code and 9 times more than other coloured QR code. Hence, this shows that the coloured QR code has the potential of becoming useful mini-data storage as it does not rely on internet connection.

This article discusses the possibility of developing a postprocessor for turning center with 2 turrets and a multi-channel CNC system with NC program format characteristic of machine Mazak Integrex I series. Typical for these CNCs is the usage of two support programs - one for each turret. The CAD / CAM system PTC Creo is used to solve the problem, where tool transitions are developed for machining the workpieces. The postprocessor is software that translates the CL Data file i.e. turns it into a NC program with preparatory, technological, and supplementary commands to control the machine. G-POST, which is integrated into the PTC Creo CAD / CAM system, is used to develop the post-processor. To solve the problem, a specialized programming language FIL (Factory Interface Language) is used which, with its features and capabilities to work with files in ASCII code, achieves the ultimate goal - NC program in format characteristics suitable for machines Mazak Integrex I series.

Information security has immense importance in today’s world of digital communication. Sharing information between intended parties while keeping it secret from any outsider is a challenging task. Cryptography provides the security of information by keeping the information secret among only the communicating parties. In this paper, a new cryptographic algorithm is propounded, which is a block cipher algorithm. A positive integer, n, two $$n\times 256$$ tables of ASCII characters, and a string, Mapper, are used as shared private keys in the proposed method. Every row of the key tables and Mapper contains a random permutation of all the ASCII characters. In the beginning of encryption of a block, an Exclusive Or (XOR) operation is done between the block and a random array of integers. Then, a 3-round substitution operation is done using the key tables and Mapper. We found that the encryption and the decryption speed of the proposed algorithm is faster than the encryption–decryption speed of Advanced Encryption Standard (AES) and Data Encryption Standard (DES). The strength of the proposed cipher was analyzed in the light of some popular attacks, and we found that the system is strong enough against those attacks. We hope that if integrated with the modern cryptography protocols, this method will enhance modern digital communication security.

Information data security is an important aspect of exchanging data and information. Data and information security can be done in various ways, including by using the cesarean cipher method in cryptographic techniques. The cesarean cipher method of cryptographic technique is a substitution coding system which is done by replacing each alphabet character with other characters along the 26 alphabet characters so that the coding only occurs in the alphabet itself without any other punctuation. This study proposes a modification to the cesarean cipher technique by adding to the number of characters used, namely 256 characters in the ASCII code. The caesar cipher application or CaesarApp uses the methodology of library study, consultation, application design and application testing. The implementation of the CaesarApp application was created using the open-source Android Studio 3.5 application. The results of tests conducted on the CaesarApp application note that the modification of the caesar cipher with 256 ASCII characters results in a secure information data security application, this application has a deficiency in reading limitations on ASCII characters, so characters cannot be read properly on android users.

Most of the traditional cryptanalytic technologies often require a great amount of time, known plaintexts, and memory. This paper proposes a generic cryptanalysis model based on deep learning (DL), where the model tries to find the key of block ciphers from known plaintext-ciphertext pairs. We show the feasibility of the DL-based cryptanalysis by attacking on lightweight block ciphers such as simplified DES, Simon, and Speck. The results show that the DL-based cryptanalysis can successfully recover the key bits when the keyspace is restricted to 64 ASCII characters. The traditional cryptanalysis is generally performed without the keyspace restriction, but only reduced-round variants of Simon and Speck are successfully attacked. Although a text-based key is applied, the proposed DL-based cryptanalysis can successfully break the full rounds of Simon32/64 and Speck32/64. The results indicate that the DL technology can be a useful tool for the cryptanalysis of block ciphers when the keyspace is restricted.

The Optical Character Reader (OCR) process means the transition from scanned manual or written images to a machine-determined document. The American Standard Code for Information Interchange (ASCII...

The main challenge for American Standard Code for Information Interchange (ASCII) based image encryption methods is to increase security with less computational cost. Earlier, well known image encryption techniques are not only deficient in performance but also lacked in embedding of confidential data in an image using ASCII based methods. Therefore, this study aims to contribute an ASCII based efficient and secure image encryption method having additional feature of embedding confidential data in an image. Moreover, the embedding process is not static but it is dynamic as compared to the existing work. The novelty of proposed method encompasses optimal security, effective encryption speed and randomized embedding of secret data in an image even of having multi-operations. The proposed method was evaluated experimentally with variety of tests such as Pixel correlation analysis, Number of Pixels Change Rate (NPCR), Unified Average Changing Intensity (UACI), Histogram, Entropy, Peak Signal to Noise Ratio (PSNR), and Mean Square Error (MSE) including encryption decryption time. Thus the experimental results show that the proposed method is optimally secure and outperformed in image encryption as well as in randomized embedding of confidential data than the existing techniques.

The IP-core for QR-code generation, which supports codes of the first version and the M-type level of correction (allows to recover information from damaged up to 15% code image) is developed. Based on this IP-core and the DE1-SoC development board, containing the Cyclone V FPGA chip, the real QR-code generation device was implemented. The device uses the PS/2 interface to enter text data that should be encoded in the QR-code and output the result (generated code) on a VGA monitor as an image. The suggested device has the following structure: the control module, the IP-core for QR-code generation, and I/O modules. The control module performs the general device management and implemented as the state machine, which has the following states: reset and memory cleaning, read the text that should be encoded from the keyboard, create the main part of the QR-code, create correction data, combine the correction data with the main part of the QR-code, transform the result into a 21x21 pixel matrix and displaying the code on the screen. The input module reads the keyboard signals (synchronization and data signal) and converts them into the ASCII codes. To do this, on each falling edge of the synchronization signal the values of the data signal are registered and propagated to the 8-bit bus. Since the keyboard may have a contact bounce, this module additionally filters the received data using the delay filtering. The output module is the VGA controller that simply generates the necessary clock signals for the proper VGA monitor functioning. After the QR-code is generated, its matrix is enlarged and passed to the VGA controller. Also, in parallel with that, the text, which was encoded in the code, is printed on the display. The IP block for QR-code generation consists of three submodules. The first one receives a text in ASCII format (now only 14 characters are supported) and generates the primary sequence of data to be encrypted in the code. The second submodule calculates the correction data using the Reed-Solomon algorithm. To use this algorithm, the additional array is reserved to store the correction data. This array is filled with special information, depending on the level of correction and the code version number. The algorithm also requires tables of the forward and reverse Galois fields, which are precalculated and stored in the submodule’s ROM. The third module generates the matrix itself: it places the alignment patterns, the information of the used type of mask, level of correction, and adds timing patterns. After that, the mask superimposed on the data generated by the previous module, and the result is copied to the code’s matrix in the required order.

The simplest input is a switch, with an array of switches forming a numerical keypad input. Timers and interrupts are often used in input processing, such as debouncing. An LED is a simple output indicator, which can be used in a seven-segment display to provide a simple character display. The LCD provides a more versatile alphanumeric output.

Nowadays, the use of 3D printing has extensively increased, which support STereoLithography or Standard Tessellation Language (STL) 3D image for printing. STL file originated from the 3D systems. STL file format works over the triangles and estimates the surfaces of a solid model without any texture and color. It specifies both binary and ASCII formats. In this paper, a method has presented to convert 2D image to 3D printer acceptable STL file and STL file to 3D object generation.

This study developed a web-based text editor to eliminate the incompatibility of computer keyboard with the three major indigenous languages in Nigeria. It also aims to reduce the time taken to produce characters with diacritical marks. The editors produced valid Unicode characters and require pressing less buttons to generating all the symbols of the alphabets for the three major indigenous languages in Nigeria. Client-side technologies were used to develop these applications. Three web pages, designated for Yorùbá, Igbo and Hausa language were generated with HTML. CSS was used to define the look and feel of the HTML elements on each page. Regular Expressions implemented in JavaScript functions were used to convert selected ASCII characters into desired Unicode characters. The editors are available at http://www.gazaliwakil.com.ng. The editors work well on latest version of browsers like (Google Chrome, Mozilla Firefox, Opera, and Internet Explorer). They are very light, consume minimal server resources and can work offline. The system was launched Fifty-one (51) times to extract data comprising the Loading, Scripting, Rendering, Painting, System, and Idle time. The obtained result showed that on the average, it takes about 13.77ms to load the HTML DOM elements, 42.83ms to load the javaScript, 13.10ms and 1.73ms for rendering and painting the page by CSS. Additional time taken are 43.91ms and 3,045.10ms for the system and idle time respectively. A total time of 3,160.43ms (3.16s) is required when any of the editors is launched before the page can accept inputs from the users. It also takes the editors 2.66ms to add diacritical marks on a letter. This would, in effect, not reduce the typing speed of users.

This work reports a control platform development for a low-cost and portable medical imaging breast cancer detection system. Firmware was developed from scratch contemplating the hardware control, automated internal sweeping routines, and attending personal computer queries via USB communication. Custom commands were implemented for the external communication employing a simple and effective ASCII protocol. The platform allows both hardware technician and exam operator to interact with the hardware from register level to elaborated routines, enabling advanced intervention as well as automatic and fast measurement tasks. Results reported calibration and sweeping times reduced from minutes to less than 2.5 seconds per examination step. A complete 64 positions exam time is estimated in 28 minutes and currently depends primarily on the mechanical equipment setup.

There are several ways to achieve protection of information follow between user and client from attack, misuse or unauthorized access straightly, one of these ways is steganography, steganography is a science of secretly data transfer using different multimedia like audio, text, video or image as a carrier. In the current paper, the author proposes another steganography procedure that it is easy to find and hard to break by an outsider . It based on combine between ASCII Mapping Technology (AMT) with book cipher encryption method using the image as an encryption key for the book cipher. The (AMT) technique is used to create an encoded table by mapping the text message and match some bits with that of the image, The proposed procedure was tried and the outcome shows its robustness and low computational cost beside it maintain image quality.

A straightforward intuitive user-friendly compact graphical interface, PreDICT (Premier DICVOL Tool) has been developed to take full advantage of the new capabilities of the most recent version of the DICVOL14 Indexing Software. The latter, an updated version of DICVOL04, includes optimizations, e.g. for monoclinic and triclinic cases, a detailed review of the input data from the indexing solutions, cell centering tests, as well as the handling of a moderate number of impurity peaks. Among the most salient features of PreDICT, one can mention the ability (1) to use 2θnon-equistepped input 1D X-ray powder diffraction patterns as can be obtained from 2D detectors, (2) to strip laboratory data from itsKα2contribution when present, (3) to generate 2θequistepped output 1D X-ray powder diffraction patterns in both the “.XY” and “.GSA” formats. In addition, PreDICT allows for the following features: (1) full access to the native DICVOL14 input/output ASCII file system is retained, (2) for any selection of a DICVOL14 suggested unit cell, all predicted Bragg peaks up to a certain 2θMAXvalue are clearly displayed and indicated, thereby emphasizing the contribution of the unaccounted peaks (if any) to the 1D X-ray powder diffraction pattern under current investigation.

In the field of bioinformatics, the storing and transmission of deoxyribonucleic acid (DNA) is essential for compression rate, ratio and encryption point of view. The DNA sequence requires huge space for storing and time for encryption causing considerable delay transmission of information. The most of the users demand low storage and computational cost, therefore efficient algorithm is required for compression. Proposed algorithm will be based on combinations of reverse and palindrome (RP) technique or genetic palindrome and palindrome (GP2) technique substring substitution. The variable substring will be replaced by the corresponding American Standard Code for Information Interchange (ASCII) code which is extracted RP/GP2. The transmission of DNA/RNA/Protein sequence over wireless communication is common issue. The size of DNA sequence is growing twice in a year proportionally. As a result, security of these data from unauthorized user is essential. The proposed selection encryption reduces the computational recourses for this data. The DNA sequence security is ensured by signature which depends on ASCII code and dynamic library file acting as a key. This approach shows that 95% of original file is modified when 44–45% is encrypted. The experimental results shows that the compression rate is 3.7750 bits/base.

Cryptography is the branch of science. In cryptography, the techniques that are being used to protect data are derived from mathematical theories and a collection of calculations known as algorithms to process messages in many ways to encode it. In this paper, new approach to cryptography algorithm is mentioned in which the equation and numerals are adopted. This new finding is established on the unique amalgamation of mechanical concept and traces of alphabets used in NATO (North Atlantic Treaty Organization) phonetics alphabet.

Now a days the cloud computing became a trend of storage, computational power, and other advanced services. Already 90% of the companies are on the cloud, more and more corporate data and public data are being stored in the cloud. Nearly two-third of organizations see security as the tremendous challenge for cloud adoption. So now a days there are lot of research going on to reduce the security risk of storing confidential data over the cloud. In this research we introduced a novel encryption method to secure the data in the cloud using the color code encryption and the well-known DNA computing method. Here we used a 1024-bit encryption key to store the data in the cloud. This key has been designed by using the 256-RGB Color codes, User’s attributes like MAC address and personal data, decimal encoding, ASCII values and DNA bases with complementary rules. The Security analysis of the algorithm is discussed in this research.

To quickly create and display mathematical formulas in web browser, this paper presents an online formula editor with MathML and ASCII IMathML as transformation tools. It is implemented on the platform of the text editor FCKeditor and it includes the modules including online editing, storage and display of mathematical formulas. The system also realizes the online editing, storage and display of mathematical formulas, and solves the problems of mathematical information exchange and distance mathematics education by Mathedit. The experiment results analysis shows that the system fully implements the W3C MathML DOM model, and solves the problem of most formula editors which cannot input Chinese characters with Unicode encoding. In addition, the designed components can be easily used in the development of web application system.

In recent years, elliptic curve cryptography (ECC) has gained a lot of popularity because it provides a high level of security with smaller key size than other cryptographic techniques as RSA. It has emerged as a solution to the problem of faster operation because of its less computational complexity. Generally, the texts are mapped to the affine or Lopez-Dahab (LD) coordinates. Still, using the hexadecimal values of the text in blocks, the situation could be improved in terms of computational complexity and need to share a standard lookup table between the communicating parties. The present work uses defined ASCII values, binary values, and decimal values of the message in blocks of fixed length, depending upon the chosen curve, to map the text and symbols as points on the elliptic curve for encryption and decryption. The deterministic approach adopted has contributed in making the system immune to many attacks. The technique was implemented on Raspberry Pi 3, and its performance analysis was done. The relation between text size and encryption/decryption time was found approximately linear, which can be interpreted as being more efficient for smaller files as compared to the relatively larger files.

Elliptic curve cryptography (ECC) is public-key cryptography that is increasingly used today because it provides better security. In this study, we propose a new message encryption algorithm using an elliptic curve over finite fields. This new method converts each character of the message to its hexadecimal Unicode value and then separates the value divided into blocks that contain one character. Unicode contains many more characters than ASCII. In the Unicode table, the hexadecimal values of the characters range from one to six digits. The proposed new encryption algorithm can encrypt not just by using the values in the ASCII table but all values in the Unicode table, thus can use different alphabets and characters. The algorithm is implemented in C++.

Domain names and URLs are essential technologies in the current Internet. Thus, a failure in URL processing not only gives an inconvenience to users but also causes serious security vulnerability. If URLs are still organized with only ASCII characters, there may be no problem on URL processing. However, current URLs are further extended and complicated. One of the complexity is coming from Internationalized Domain Name (IDN) related extensions. Thus, there are no simple ways to process URLs due to their characteristics and historical extensions. In this paper, firstly, we introduce possible threats due to wrong IDN processing. Then, we present potential threats due to URL extraction operations in applications with classifying attack surfaces. We examined the above problems with various programming languages and web browsers and confirmed many issues in different environments. Furthermore, we confirmed and demonstrated that the failure pattern are not identical because the issues that come from IDN processing varies. Finally, we conclude the experimental result and propose ways to a comprehensive solution.

This paper shares a technique to generate a simple VGA test screen using VHDL and Verilog for used in an FPGA chip. Test pattern is a display that when correctly displayed, one can quickly acknowledge that the whole system is working well. Usually the pattern is designed to check fullness of display, aspect ratio, correctness of synchronizations, frequency response, resolution, and - in case of polychromatic monitor - the color. In this paper the construction is made for monochromatic and color display using only simple geometry. One usually use this technique when developing a display module from the scratch using FPGA and the bitmap-reading module (or ASCII ROM module) is yet to be built. In such cases, a quick functionality test is very useful. The technique was successfully implemented using VHDL and Verilog in a standard development board. We hope students of electrical and computer engineering program can confidently start from this test pattern for the design of their next project.

Cryptography plays an important role in secured data communication over the network using unknown, untrusted mediums. In the fast digital transformation, traffic on network increasing rapidly where users are always connected, being online, anytime anywhere. As part of data, extortions like altering, spoofing and snooping of are quite common over the network by unauthorized access. Cryptography is well known mechanism where asymmetric or symmetric algorithms using public or private keys provide secure data communication. There are many more cryptography algorithms existing but with emerging technologies and diverse application domains seeking consistent enhancement and better performance with resource restriction. In this paper, we present a novel symmetric cryptography technique based on Caesar cipher symmetric cryptography technique to transform the original text/message into secret text/message. In this technique, the sender transmits hash code instead of symmetric key and Hash code provides the symmetric key to the receiver to decrypt the message of a sender. Proposed method works for all 256 characters having ASCII value from 0 to 255.

The rapid development in data collecting devices and computation platforms produces an emerging number of agents, each equipped with a unique data modality over a particular population of subjects. While an agent’s predictive performance may be enhanced by transmitting others’ data to it, this is often unrealistic due to intractable transmission costs and security concerns. In this paper, we propose a method named ASCII for an agent to improve its classification performance through assistance from other agents, without sharing proprietary data and model information. The main idea is to iteratively interchange an ignorance value between 0 and 1 for each collated sample among agents, where the value represents the urgency of further assistance needed. The method is naturally suitable for privacy-aware, transmission-economical, and decentralized learning scenarios. The method is also general as it allows the agents to use arbitrary classifiers such as logistic regression, ensemble tree, and neural network, and they may be heterogeneous among agents. We demonstrate the proposed method with extensive experimental studies.

The paper discusses a unique technique developed initially at Nation Institute of Technology, Surat that is remodeled in real-world applications. The concept consists primarily of a user-friendly software facilitating direct communication with any intelligent or learning system/robot operating under known parameters of motor specifications. Any software base permitting high level PC interface without ASCII interrupt can be used for easy programming. This allows for a learning operation mode where a prevention of time lag is enabled by stored machine data, captured through movements such movements can be physically made or taught via programs to the device and such learning aspects make the machine more efficient where the robot can either perform individual actions as needed or learn new methods for the same results and can perform a series of actions continuously. Using the stored data, the machine is also capable of autonomous movements based on the path of least resistance as calculated by the time it takes to perform an act. Interfacing Technique Tool Machining Robot (ITTMR) was developed as robotic tool holder that can determine the shape and size of different OCTG pipes utilized in the downhole industry and enable it to machine appropriate threads on the pipe with no manual intervention. The process thereby completely negates any possibility of human error which can otherwise cause heavy loss on finished equipment that are rendered unusable because of threading errors on almost nearly finished complex milled parts or assemblies that are pending threads as the final operation. The purpose of the software codes is to provide a user-friendly GUI that can communicate with any machine by pulling in appropriate ACNC programs and performing the required tasks associated with the operating system and specifications of the motors/mobilization equipment’s used. For the purpose of this paper, the software code is not provided. Any firmware base that permits the usage of an ASCII interrupt can be used and for the purpose of this operation, an RS323 equivalent board will also suffice for basic operations, however a complex ITTMR system has been utilized. This paper solely addresses the technique of how the threading operation is performed and does not address the process of how the pipe is bought to the machine or other associated aspects of the software to retain any possible patent applications on the same.

Automatic number plate recognition system (or ANPR) is a system that uses optical character recognition to read characters from solid images automatically and immediately and then convert them to ASCII characters readable by machines. Such a system has been widely used to recognize vehicles plate by using several algorithms and methodologies, including optical character recognition, convolutional or deep neural network, morphological operations, and edge detection. This study aims at understanding and analyzing the concept of the vehicle number plate recognition system, especially those systems which don’t need any human resources to accomplish their missions. For this purpose, this paper presents an analytical and theoretical comparison between several previous works in this field. According to this study, there are different levels of the recognition process starting from collecting images by cameras, detecting the region of plate numbers, segmenting the characters individually, comparing each number with the stored database, and ending with detected the whole plate number. The performance is evaluated based on different factors such as accuracy, precision, and recall.

Since people existed, they have prioritized confidentiality in information sharing and communication. Although there are independent studies on encryption and music in literature, no study is seen on encryption methods that are created by using the properties of mathematical number strings and can be expressed with musical instruments. The purpose in this research is to develop ideas for an effective encryption method and to create a time and location variable encryption method considering this deficiency in the literature by getting advantage of the additive feature in Fibonacci and Lucas number sequences and moving from here to develop new perspectives on encryption science. In the research letters in alphabet, numbers and 10 of the most used symbols were selected and ASCII codes were determined. The objects to be encrypted are divided into 6 main groups (uppercase vowel, uppercase consonant, lowercase vowel, lowercase consonant letters, numbers, and symbols). ASCII codes are written with the additive property of the Fibonacci and Lucas numbers (Zeckendorf's Theorem) and matched with the corresponding notes. In addition to the first method in the study, the encryption system is encrypted by shifting depending on time. In addition to this method, the encryption system was encrypted by shifting depending on the location. In the last method, the text to be encrypted was encrypted by shifting depending on both location and time. The software of the first stage of the encryption system has been created. The encryption method we have created can be transmitted in both audio and text. Since encryption can be applied with various instruments, it offers variety in terms of data privacy. In the encryption system, people who have a musical ear can audibly decipher the password regardless of the written source. In the research, the same text differs as time and location change. This method allows multiple transformations of a character in a text. With these features, it differs from the encryption methods made until now.

Steganography is one of the leading strategy that is employed to hide restricted content into a cover media so that the person unaware of the fact can’t predict that the cover media can acquire some secret information. The effectiveness of any steganographic approach is appraised on imperceptibility of the stego-media, payload of the cover media, integrity of the secret information, security, and computational complexity. The work presented in this paper focuses on these important concerns of secured data transmission. The proposed steganographic approach uses multimedia files including animated image sequences as cover media for concealing secret messages. The entire secret information to be embedded is converted to a code using Secure Hash Algorithm-1 (SHA-1) (National Institute of Standards, and Technology (US). Technology Administration. Secure hash standard, 1993) and shared with the secret message to validate the authenticity of the transmitted secret information. The whole secret message is converted to its ASCII to embed them by replacing the least significant digit (LSD) (Liu et al. In Proceedings of the 2012 IEEE International Conference on Communications (ICC), IEEE, 2012). The receiver validates the transmitted information with SHA-1 again generating a code, which validates with the existing code sent over from the transmitting end. The proposed algorithm is worked upon a variety of text messages with a large set of color animated image sequences as cover media and also has been tested carefully by different parametric measures. This algorithm gives robust outputs in terms of visual imperceptibility, safety, and embedding capability.

Data security has become crucial to most enterprise and government applications due to the increasing amount of data generated, collected, and analyzed. Many algorithms have been developed to secure data storage and transmission. However, most existing solutions require multi-round functions to prevent differential and linear attacks. This results in longer execution times and greater memory consumption, which are not suitable for large datasets or delay-sensitive systems. To address these issues, this work proposes a novel algorithm that uses, on one hand, the reflection property of a balanced binary search tree data structure to minimize the overhead, and on the other hand, a dynamic offset to achieve a high security level. The performance and security of the proposed algorithm were compared to Advanced Encryption Standard and Data Encryption Standard symmetric encryption algorithms. The proposed algorithm achieved the lowest running time with comparable memory usage and satisfied the avalanche effect criterion with 50.1%. Furthermore, the randomness of the dynamic offset passed a series of National Institute of Standards and Technology (NIST) statistical tests.

Data Security offers praxis for the protection of the various forms of information. Information is transmitted in various kinds as ASCII textual content, image, video, audio, UNICODE text, and so on. Various algorithms are recommended by different scientists for dealing with copy protection. The current cryptographic algorithms are concentrating on ASCII textual content. Within the electronic data transmission era, a lot of symmetric cryptographic algorithms are unveiled by using S boxes. S box is a crucial part of certain clusters of cryptographic algorithms. A few cryptographic algorithms rely on a fixed S box, which produces insecurity to electronic information. The current S box idea manages ASCII copy just. This particular study newspaper provides the 2 sets of information that are carried out by AMES, the Hardy wall algorithm, the very first class applied to a concealed procedure. The next class was viewed as a method of each embedding as well as encryption. The information within the 2nd class is cut back towards the scope of enough for the modulation procedure, by removing the high-value properties of its then getting rid of them out of the mother's info trend. The procedure for encrypting the 2 sets of information will come in concert with the Hybrid Encryption Scheme (HES) feature. Algorithms have been designed to conceal as well as encrypt 1 as well as 2-dimensional information. Decryption algorithms have been designed to send back encrypted details to the original forms of theirs, as well as buying the imitation information. Results were satisfied with the security level on data transmission and also this scheme has reduced the number of attacks on comparing with various existing algorithms.

The procedure of translating images of handwritten, typewritten, or typed text into a format recognized by computers is called Optical Character Recognition (OCR). Editing, indexing, searching, and storage space reduction are the uses of Optical Character Recognition. This is done by scanning the picture of the text character-by-character first, then processing the scanned image and eventually converting the image of the character into character codes, such as ASCII. To translate text in an image into text format, the Optical Character Recognition system is used. There are three key aspects of OCR approach: pre-processing, character recognition, character segmentation and presentation of data. Convolutional Neural Network is a deep learning method which is used for character recognition. In this paper, CNN layers, architecture and implementation of CNN architecture are discussed. Here the CNN (VGG-16) model is trained over Telugu character data set which covers maximum of 1600 characters and its accuracy is measured.

Speech can be viewed as a sequence of linguistic units such as phonemes. Traditional speech-to-text and text-to-speech systems are based on statistical models of acoustic–phonetic units such as phones. It is desirable to assign printable ASCII labels for acoustic–phonetic units to enable supervised training of models using a computer. Since the letters of the Roman alphabet are unable to label all speech sounds of Indian languages without ambiguity, a common set of labels for speech sounds of Indian languages was devised. This set, Indian Language Speech Labels, has been extensively used by major speech groups in India and has become a de facto standard. The design principles of this label set and the tables containing labels for the phones of 16 Indian languages are presented here.

Emojis are little pictographs commonly added to electronic messages on several social media platforms. Besides being considered as a way to express emotions in electronically-mediated communication (EMC), similarly to ASCII emoticons, emojis are strictly involved in the performance of humour in everyday digital conversation. Drawing on a corpus of casual Whats­App dyadic chats, this paper analyses the contribution of emojis to humour in conversation. Results show that these pictographs not only help to signal the opening and closing of the play frame, but also to respond to humour, graphically reproducing laughter. For these purposes, the most common emojis employed by Whats­App users are the popular yellow smiling and laughing faces. Nevertheless, other pictographs are also involved in electronic humour, as less common emojis can be used in playful ways by themselves.

Http requests represent the main component of a web navigation system. These requests, once received by the server, need to be analyzed to guarantee that they are attack-free. Attacks carried by Http requests can have disastrous effects. Due to the importance of Http requests, it is crucial to design an efficient and robust Http request analyzer that guarantees the detection of malicious ones and prevent them from being processed. In this paper, we propose a new technique to process the Http request called Code Embedding. The proposed method was integrated within the Convolutional neural network to provide an efficient and robust web attack detection tool. The experimental results prove that our method outperforms the previous works and reaches an accuracy of 98.125%.

Confidential data transfer or secure communication is always remaining as an essential need in this era of modern communication. This research work is an implementation of a new method named Split Key Unique Sudoku Steganography (SKUSS). It is a reversible data hiding with high embedding capacity, where high embedding signifies data bits per pixels of the cover image that are more with maintaining the naturalness of the cover image. For the implementation of SKUSS first, a unique Sudoku has been generated with a user-defined 64-bit key and a 64-bit public key, then that Sudoku is used for hiding data digits (ASCII code) into cover image pixels. The data can be only recovered with that same Sudoku with the correct public and user keys. This method is based on a hybrid algorithm that applies the techniques of Sudoku and Steganography to offer different security features to the images transmitted between entities on the Internet. Based on the proposed method, the authenticity and integrity of the transmitted images can be verified either in the spatial domain or in the encrypted domain or both domains. The work is implemented on MATLAB design and simulation tools.

The paper presents development of a data acquisition system designed for collecting data from a large number of Smart Multifunctional Meters (SMFMs) located in an electric sub-station of a university. For this purpose, the SMFMs are connected in an RS-485 PAN (personal area network) and the data read from meters is sent through a gateway module to the Ethernet LAN already available in the campus. The gateway has the capability of conversion between Modbus RTU/ASCII running on RS485 PAN and Modbus TCP/IP running on Ethernet LAN. The data can be accessed from the Ethernet LAN on any Windows compatible device like PC, using WinTech ModScan32 software. This system has been tested extensively. The results are entirely satisfactory and encouraging. The scope of the system can be expanded by adding suitable data processing and monitoring software on the PC.

Bangla is the fifth most-spoken native language in the world. Despite having such a large number of speakers, the resources related to development of language processing solutions are very limited. To realize the full potential of Machine Learning (ML) and Artificial Intelligence (AI) solutions for computer vision and Natural Language Processing (NLP), a complete and standardized fully-annotated corpus is an essential prerequisite. Specifically, development of Optical Character Recognition systems (OCRs) for printed characters, an important resource for language automatic and digitization, requires a large corpus with high coverage and variability of fonts, representing the nuances of the language usage, which does not exist for Bangla. In this paper, we present a novel synthetic corpus of over 5 million printed Bangla characters containing 60 alphanumeric characters, 10 vowel modifiers, 159 compound characters, which corresponds to 229 different classes of both Unicode and ASCII encodings. This is entirely novel work, since there exists no such corpus currently for the Bangla language.

The particle therapy system simulation framework (PTSIM) is a Geant4 based Monte Carlo simulation software developed for radiation therapy. It has been continuously extending the functions to facilitate advanced researches in medical physics domain. Consequently, the PTSIM is used in many facilities for verification of treatment plans and quality assurances. In the PTSIM, various types of beam devices are provided as software components named “beam-modules”. The geometry is constructed using a class of the beam-module and the detail geometric parameters in the ASCII data format. This strategy contributed that allows the PTSIM users to easily find the beam-module from the categorized types of beam devices and to develop a rapid prototyping of treatment port in the simulation. However, radiation therapy facilities may introduce variants of existing beam-modules, that may require the implementation of a new class for the beam-module in the PTSIM. In order to respond to such requirements without any coding effort, the interface for the Geometry Description Markup Language (GDML) has been introduced in the PTSIM. The GDML is a specialized XML-based language for an application-independent persistent format. Therefore, it can describe a user-defined complex geometry and exchanging the geometry data file among different facilities. In addition, for the purpose of examining complex geometries, a new interface for the ParaView visualization software has been developed. The interface converts the geometry in the PTSIM to the structured points data in the VTK legacy format. This paper reports on the implementations and the usages of GDML and ParaView interfaces in the PTSIM.

DNA Cryptography contributes significantly in the field of network security. Data is the crucial aspect which has to be secured during transmission. Several traditional cryptographic algorithms are developed with variant cryptographic approaches. Among all of them, DNA Cryptography is prevalent because of its inherent property of storing huge information in small amount of DNA. In the present scenario, everything is done online. All the services, infrastructure or platforms are provided on demand to the clients. In such a situation, there is a need to impart the trust to the client in the storage of a cloud. In the present paper, the authors implemented DNA-based Cryptosystem in a Cloud using DNA ASCII Table and extended the playfair key matrix from 5 × 5 to 16 × 16. The key matrix developed in this paper contains only the DNA Sequences instead of alphabets. The key aspect of this algorithm is the DNA ASCII Table and the Key matrix is randomly generated so that it becomes a challenging task for the intruder to perform bruteforce attack.

The Waikato Environment for Knowledge Analysis (WEKA) is popular tool for knowledge discovery and analysis. Researchers prefer WEKA over other similar tools due to the vast set of preprocessing and visualization mechanisms that it has to offer. Aimed at measuring performance of various supervised and unsupervised classification and clustering techniques, WEKA offers a wide range of data exploration facilities. However, a major shortcoming of this powerful tool is the output that it generates. Stored in ASCII, these files need manual conversion to spreadsheets for analysis and interpretation. Certain parameters even need recomputation, as these are returned as weighted averages. The current paper presents WEKA Result Reader a handy yet powerful tool that transforms WEKA output to spreadsheet. Thoroughly tested for system- and application-level performances, WRR proves to be a worthy and much-needed augmentation to WEKA.

The reliable distributed data storage system based on the Redundant Residue Number System (RRNS) is developed. The structure of the system, data splitting and recovery algorithms based on RRNS are developed. A study of the total time and time spent on converting ASCII-encoded data into a RRNS for files of various sizes is conducted. The research of data recovery time is conducted for the inverse transformation from RRNS to ASCII codes.