ASCII Characters Research Articles

The concept of Minimal Spanning Tree (MST) for Symmetric Encryption

As the digital communication has become a vital part of the human life nowadays, cybercrimes are ever expanding. One major tool to protect the message from hacking and tampering is concealing the original information. Modern cryptography not only concerns the encryption of the message but also focuses on the protection of the encrypted information from cyber-attacks.Apart from secret communication modern cryptography focuses on authentication and integrity of the message. The present paper explains a symmetric block cipher basing on graph structures. In this technique the message is encrypted twice. The first stage encryption using adjacency matrix of undirected graph; the second stage using exclusive OR (XOR) operation on the output of first stage. Encryption/Decryption Keys are distinct for distinct blocks and distinct rounds; derived from Minimum Span Tree (MST) technique of an undirected graph. Here multiple peers can communicate messages simultaneously. One of the entries selects some random ASCII characters whose number is same as the block length and uploads those characters in the cloud. All the members of the group establish block keys using key generation technique which is secret among them.

Coding theory for h(x)-Fibonacci polynomials

The amount of information transmitted over the internet network has dramatically increased with the prevailing of internet use. As a result of this increase, the algorithms used in data encryption methods have gained importance. In this paper, h(x)-Fibonacci coding/decoding method for h(x)-Fibonacci polynomials is introduced. The proposed method is fast because it is based on basic matrix operations, and it is suitable for cryptographic applications because it uses the ASCII character encoding system. For this reason, it differs from the classical algebraic methods in literature. Furthermore, the fact that h(x) is a polynomial improves the security of cryptography.

Facile synthesis of multicolor emitting sulfur quantum dots and their applications in light blocking field, anti-counterfeiting and sensing

Sulfur quantum dots (SQDs) have aroused widespread interest from researchers in a wide range of fields due to their excellent photoluminescent properties. Ethylenediamine, diaminopropane and butanediamine were used as precursor amine raw materials to interact with sublimated sulfur to synthesize SQDs with blue, cyan and green fluorescence emission, respectively. Multicolour emitting SQDs were first prepared via sulfur-amine interactions. Further characterization and calculations showed that the precursor amine substances could alter growth size and band gap energy of SQDs to allow for a wider absorption and fluorescence transfer to long wavelength emission region, resulting in tunable fluorescence emission. In terms of application, the excellent down-conversion properties of SQDs were utilized to obtain highly transparent and flexible photoblocking films by blending SQDs with polyvinyl alcohol matrixes, achieving a blocking of light in UV region of up to 99.69 %. In addition, we constructed an encoded storage microarray based on standard 8-bit ASCII character binary codes using BSQDs and GSQDs to store and encrypt important information. Finally, GSQDs-based fluorescent sensors were designed to achieve fluorescent trace detection of o-nitrophenols with limits of detection as low as 2.54 μM. The multicolor emitting SQDs prepared in this work have great potential for applications in analytical detection, optical anti-counterfeiting and light blocking.

The use of binary digit mapping on ASCII characters to create a high-capacity, undetectable text steganography.

Plain text is commonly utilized for online news and social media transmission due to its lightweight and cross-platform nature. Unfortunately, it may easily be exploited by attackers (For instance, in cases when the language is altered for specific goals, illegal access to the material or its abuse is possible.) To solve this problem, we embed secret texts (ST) within seemingly innocuous cover texts (CT) so that we can track CT for modifications. Based on the findings of this study, a method is provided for ST embedding in CT in which binary ST digits are converted to CT binary digits through Characters in ASCII (containing whitespace, punctuation, and special characters). Before commencing the embedding procedure, Using a One-Time Pad (OTP), the ST text was translated into ciphertext, and the value of each character was changed into a binary integer with a length of seven bits. As opposed to the ST text, which required additional time to encode, the CT text could be converted into a binary integer using just the first seven bits. During the embedding process, It was decided to swap the first bit of the ST character for the first bit of the CT character, which both had the same amount of bits (putting the first bit of the ST character, for example, on the same line as the first bit of the CT character). Any piece of ST that was recorded on any bit of CT served as a stage key. Extracting ST from CT requires the stage key. The embedded information served effectively as text steganography or watermark, and the CT's appearance was unaffected by the embedding procedure. In other words, the 1 character of ST might be concealed by using 7 CT characters. Also, a Jaro-Winkler Distance of 1 meant that the stage texts made couldn't be told apart from CT by looking at them.

Making Room for Post-Authentic Domesticity

This creative response interrogates the persona that seems to inhabit sex webcam platforms, online services where people can stream and monetize amateur sexual performances (Henry & Farvid 2017; Jones 2020). If the perception of authenticity has been a crucial feature of camming since its inception (Senft 2008), this impression is no longer conveyed only through amateur signifiers (Hernández 2019). Domesticity on the sexcam platform oscillates between two poles. One of them is incarnated by the professional webcam studio, where uninhabited rooms are presented as private yet generic spaces (Korody 2019). The other pole is the personal space, staged for its transmission through the platform. Decorative trends and habits crossover between these extremes, creating a new type of domesticity with no other purpose than the sexual spectacle. The product of this mutual influence is referred to as ‘post-authentic domesticity’ in this article. Drawing upon literary studies, post-authenticity implies a fiction that engages with an ‘authentic’ referent but does not aim to replicate it (Gefter Wondrich 2020). As such, domesticity in the sexcam platform is both a second-hand reference and a space where its online persona unfolds.The exploration of this post-authentic domesticity is conveyed by means of a website that replicates some of the graphic conventions of sexcam performers’ profiles. The website is divided into different pages that address distinct aspects in the form of short poems. The images accompanying the texts, created by the author, were made using ASCII characters and they reference empty webcam rooms observed in the sexcam platform Chaturbate during 2022. The abstract character of the images aims to emphasize the role of the audience in the construction of online intimacy and meaning.

Homoglyph Attack Detection Model Using Machine Learning and Hash Function

Phishing is still a major security threat in cyberspace. In phishing, attackers steal critical information from victims by presenting a spoofing/fake site that appears to be a visual clone of a legitimate site. Several Unicode characters are visually identical to ASCII characters. This similarity in characters is generally known as homoglyphs. Malicious adversaries utilize homoglyphs in URLs and DNS domains to target organizations. To reduce the risks caused by phishing attacks, effective ways of detecting phishing websites are urgently required. This paper proposes a homoglyph attack detection model that combines a hash function and machine learning. There are two phases to the model approach. The machine was being trained during the development phase. The deployment phase involved deploying the model with a Java interface and testing the outcomes through actual user interaction. The results are more accurate when the URL is hashed, as any little changes to the URL can be recognized. The homoglyph detector can be developed as a stand-alone software that is used as the initial step in requesting a webpage as it enhances browser security and protects websites from phishing attempts. To verify the effectiveness, we compared the proposed model on several criteria to existing phishing detection methods. By using the hash function, the proposed security features increase the overall security of the homoglyph attack detection in terms of accuracy, integrity, and availability. The experiment results showed that the model can detect phishing sites with an accuracy of 99.8% using Random Forest, and the hash function improves the accuracy of homoglyph attack detection.

An overview of the JCAMP-DX format

Abstract The JCAMP-DX format is the most widely used vendor-independent data standard in spectroscopy. Based on the ASCII character set, the first standard was published for infrared spectroscopy in 1988 and over the years additional standards have been published covering most of the major spectroscopic techniques. This paper provides an overview of the JCAMP-DX standards, including a brief historical review. This is followed by a basic description of the format, example applications and a discussion of its continuing evolution.

Emoji image symbol’s social function and application

<p id="p00005">Nowadays, with the rapid development of the Internet, online communication has become increasingly popular and popular. However, due to the lack of nonverbal cues in face-to-face communication, it is difficult for people to detect the emotional state of each other, which hinders normal communication. Emoji, which compensate for nonverbal cues in online communication, have been introduced into cyberspace to compensate for the absence of gestures and facial attributes in online communication, and have been developing constantly. The development of Emojis has gone through Emoticon composed of ASCII characters, Emoji of pictographic icons and now emerging more vivid and interesting stickers. This paper will mainly comb, analyze and summarize the functions, influencing factors and interaction mechanisms of Emoji in network communication, as well as the current application of Emoji in different fields, and put forward the future research direction of Emoji based on the current research status of Emoji. <br/>At the beginning, Emoji is borrowed from Japanese animation symbols, and gradually developed into a widely used image symbol system. Since the creation of Emoji by Shigetaka Kurita in 1999, it has been enriched and developed continuously At present, Emoji has become a tool commonly used around the world to replace non-verbal cues such as body gestures and facial expressions in digital communication. In the process of continuous use in Internet communication, Emoji has been equipped with many functions, including expressing emotions, enhancing expression, changing tone, maintaining or enhancing interpersonal relationship, etc. At the same time, the use of Emoji is also affected by many factors, including age, gender, culture, context and platform. In addition, we also explore the interactive mechanism of Emoji in online communication from the perspective of symbol interaction theory, so as to clearly reveal the specific interaction process of people in online communication through Emoji. <br/>At present, with the continuous development and widespread use of Emoji, its application scope has been extended to many other fields besides Internet communication. In the field of sentiment analysis, Emoji has become an important object of sentiment analysis due to its rich emotions. In psychometrics, Emoji has been developed into a nonverbal tool for evaluating personality and depression which has the same reliability and validity as text items. In the field of commercial marketing, Emoji has begun to play a role in advertising marketing and attracting consumers, and can measure consumers' food-related emotions in the form of questionnaires. In the field of legal judgment, Emoji has gradually become a powerful evidence in judicial trials due to its widespread use. Through the above analysis and summary, we put forward the future research direction of Emoji from the following aspects: (1) explore the application and future development trend of Emoji in online communication; (2) study on the application of Emoji in other fields; (3) further explore the neurophysiological mechanism of Emoji; (4) discuss the positive effect of Emoji in online communication from the perspective of cognitive processing.

АНАЛИЗ БЕЗОПАСНОСТИ ПОДСИСТЕМ ЛОКАЛЬНОЙ АУТЕНТИФИКАЦИИ ОС СЕМЕЙСТВ WINDOWS И LINUX

The paper is devoted to the security analysis of authority subsystem services for Windows and Linux operating systems. The paper provides security analysis for both local and network-based authentication in Windows. The Mimikatz (France) will be presented to demonstrate attacks on the authentication subsystem. Mimikatz is a software tool that can extract users’ credentials and password information from the memory of the LSASS process. To prevent such attacks on process memory Windows OS includes several security mechanisms: Security Reference Monitor, Protected Process Light, and Virtualization-Based Security. However, attackers can bypass these mechanisms to get illegal access to the process memory and steal users’ credentials. A similar analysis of the local authority subsystem for Linux OSes shows that gnome-keyring-daemon stores the users’ passwords in plain text. As a result, attackers can easily extract this sensitive information using memory forensics techniques via user-mode applications. Several modern Linux Distributions based on Red Hat Enterprise Linux (RHEL) still have this security issue: CentOS, Ubuntu, GNU/ Linux Rolling. Experts have developed software tools to locate and remove passwords from the memory to tackle this security challenge: MimiPenguin (USA) and Mimipy (USA). Comparison analysis of these tools reveals their drawbacks: these security tools cannot locate passwords with Unicode characters, and these tools have low speed. The proposed security solution called MimiDove is designed to solve both these issues. MimiDove expands features of MimiPenguin and Mimipy by locating and deleting passwords with ASCII and Unicode characters. MimiDove is faster than MimiPenguin and Mimipy.

Penggunaan Karakter Kontrol ASCII Untuk Integrasi Data Pada Hasil Enkripsi Algoritma Caesar Cipher

&#x0D; &#x0D; &#x0D; Cryptography is a technique or method for securing data from other unauthorized parties. The substitution algorithm is the simplest algorithm and is classified as a classic in the field of cryptography, for example the Caesar cipher algorithm. ASCII code (American Standard Code for Information Interchange) is a code that contains characters that can be processed by a computer. By type, not all ASCII characters can be printed by the computer. Some characters are not printed or illegible as usual. These unreadable characters are called control characters. The control character can be used to improve the performance of the Caesar Cipher algorithm, because it focuses on processing text data. The application of control characters uses a simple method but has a complex solution. The results of this study are in the form of a new method with the Caesar cipher algorithm as a classical cryptographic method or technique and ASCII characters as the basis for the development of the ciphertext performance resulting from the encryption process. In testing this method, the success rate reaches 100% in securing the contents of the document with a sample of 500 letters. While the possibility of solving the ciphertext results is classified as difficult because the control characters of the ciphertext results that are illegible will make the decryption result multiple interpretations.&#x0D; &#x0D; &#x0D;

Web-based text editing system for Nigerian major languages

&#x0D; &#x0D; &#x0D; 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.&#x0D; &#x0D; &#x0D;

Simulations of text encryption and decryption by applying vertical bit rotation algorithm

Cryptography is the study of hiding text and numbers in the form of codes. Vertical Bit Rotation (VBR) is one of the most widely implemented cryptographic algorithms as a one-way hash function that simplifies the encryption process with a high degree of difficulty in decryption. The purpose of this study is to apply VBR hash algorithm modeling to binary value characters with bit rotation keys 10, 11, 7, 3, 2, 7, 5, and 4. Thus, generating a passcode. The results of the encryption simulation show the code in the form of letters and characters, then the result of the decryption with the opposite rotation to the encryption process returns the value from ciphertext to plaintext based on ASCII characters. Cryptographic algorithms are applied to avoid cryptanalytic experiments in opening encryption codes.

Hybrid encryption using playfair and RSA cryptosystems

The security is demanded to transport important data over the network. In this work a hybrid encryption depending on playfair cipher and RSA algorithm is proposed to give more confidentially and get rid of the defects of the two methods. The first cipher text is obtained by playfair cipher by using (812) expanded key matrix that is filled by decimal ASCII characters of Alphabets, numbers and common characters of ASCII table while the final cipher text is obtained by RSA cryptosystem by applying it for blocks of two characters. The proposed hybrid encryption avoids to take large numbers in RSA algorithm and performs complex operations that need a long time to do. The proposed hybrid cipher is tight security that is difficult to analyze and detect from hackers and intruders.

Modeling a Virtual Bare-Hand Interface System Using a Robust Hand Detection Approach for HCI

A practically deployable gesture recognition system is developed using a robust hand detection method implemented using a motion-based image segmentation process and a two-level bare hand classification model, which is integrated with a gesture classification system of 58 gestures using new robust features. Since detection of bare hand is affected by nonideal conditions, multiple color-texture features are analyzed in this study. In the second stage of the system, 18 new ASCII characters are introduced and analyzed along with the existing 40 characters (alphabets, numbers, and arithmetic operators). New 15 dimensional features are introduced along with the existing features to enhance the classification accuracy of the gestures. Significance of features statistically tested using one-way analysis of variance (ANOVA), Kruskal–Wallis and Friedman test, which are sequentially ranked and evaluated using incremental feature selection (IFS) method. Performance of the proposed hand detection system is observed to be 12.5% higher than the existing hand detection system under clean conditions, while 46.4% higher under the nonideal conditions. Performance of 58 gestures classification model has improved by 12.08% (Naïve Bayes), 8.86% (ELM), 10.83% (SVM), 8.02% ([Formula: see text]NN), and 6.61% (ANN) after using the new features. Majority voting-based classifier fusion method further improves the performance of the gesture recognition system by 3.88%, which is validated by Turkey’s HSD test.

Deep Learning-Based Automated Lip-Reading: A Survey

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.

A novel and efficient amino acid codon based medical image encryption scheme colligating multiple chaotic maps

Advancement of medical imaging in health care sector emerges new challenge of secure image transmission. Security of medical imaging is a prominent issue to keep patients information safe. In this paper an efficient and secure biomedical image encryption algorithm is proposed with two phases of encryption. In the first phase the image has to undergone a random substitution of 20 Amino Acid based Codon with one or more than alternate Codon in the form of triplets using the base DNA code (A, T, C and G) using Linear Congruential Generator. Upshot of the first phase encrypted image is divided into blocks and a logistic map is used to generate a series of unique initial condition and control parameter. Using a random ASCII character as a seed the unique initial conditions for each block is generating some Pseudo Random Number Generator. The seed is encrypted using RSA. Each block is circularly shifted using unique PRNG. These unique initial conditions and control parameters are utilized by a series of Tent Maps to perform block by block confusion in the second phase encryption using XOR operation. Keys used in both the phases are encrypted using AES technique. Proposed method is used to encrypt any biomedical and other images also. All type of security measure such as Differential attack, key space analysis to resist Brute force attack, Correlation analysis, key sensitivity test, resistance to Noise attack and plain text attack along with time analysis has been taken into consideration to test the vulnerability of the proposed algorithm. From the comparative study the proposed method outperform in many aspects than the existing methods.

A Novel Block Cipher Based on Randomly Shuffled Key Strings

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.

Development of a quasi‐real‐time distribution voltage monitoring system

Data compression has its own importance in numerous applications, including power systems and several algorithms were developed for managing data associated with the power system. As security is a matter of concern in transferring the compressed information through any communication channel, data encryption can ensure data security. A low computational, microcontroller implementable, asymmetric key encryption algorithm similar to Rivest–Shamir–Adleman algorithm is proposed here for encrypting any ASCII character. As combined differential binary encoding algorithm (C-DBEA) can handle almost all practical data sets and can achieve a moderately high compression ratio (CR), an attempt was made to ensure the security of the compressed data by developing the low computational compressed, encrypted algorithm. A data array is compressed by using C-DBEA in this compressed, encrypted algorithm and is encrypted by using the proposed encryption algorithm. After successful PC-based testing, the algorithm is implemented successfully at the microcontroller level as well. Finally, the compressed, encrypted Data Acquisition System is realised for measuring distribution voltage where compressed, encrypted data transfer occurs between two microcontrollers. High CR is obtained for the less fluctuating voltage profile data of urban areas where the volume of data reduces by >95%.

Implementation of CAESAR CIPHER Cryptography Techniques for Android Based Information Data 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.

Deep Learning-Based Cryptanalysis of Lightweight Block Ciphers

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.