Word-based encryption algorithm using dictionary indexing with variable encryption key length

<p>This paper proposes a new algorithm for text encryption utilizing English words as a unit of encoding. The algorithm vanishes any feature that could be used to reveal the encrypted text through adopting variable code lengths for the English words, utilizing a variable-length encryption key, applying two-dimensional binary shuffling techniques at the bit level, and utilizing four binary logical operations with randomized shuffling inputs. English words that alphabetically sorted are divided into four lookup tables where each word has assigned an index. The strength of the proposed algorithm concluded from having two major components. Firstly, each lookup table utilizes different index sizes, and all index sizes are not multiples of bytes. Secondly, the shuffling operations are conducted on a two-dimensional binary matrix with variable length. Lastly, the parameters of the shuffling operation are randomized based on a randomly selected encryption key with varying size. Thus, the shuffling operations move adjacent bits away in a randomized fashion. Definitively, the proposed algorithm vanishes any signature or any statistical features of the original message. Moreover, the proposed algorithm reduces the size of the encrypted message as an additive advantage which is achieved through utilizing the smallest possible index size for each lookup table.</p>

LSB-based pre-embedding video steganography with rotating & shifting poly-pattern block matrix

Background In terms of data-hiding areas, video steganography is more advantageous compared to other steganography techniques since it uses video as its cover medium. For any video steganography, the good trade-off among robustness, imperceptibility, and payload must be created and maintained. Even though it has the advantage of capacity, video steganography has the robustness problem especially regarding spatial domain is used to implement it. Transformation operations and statistical attacks can harm secret data. Thus, the ideal video steganography technique must provide high imperceptibility, high payload, and resistance towards visual, statistical and transformation-based steganalysis attacks. Methods One of the most common spatial methods for hiding data within the cover medium is the Least Significant Bit (LSB) method. In this study, an LSB-based video steganography application that uses a poly-pattern key block matrix (KBM) as the key was proposed. The key is a 64 × 64 pixel block matrix that consists of 16 sub-pattern blocks with a pixel size of 16 × 16. To increase the security of the proposed approach, sub-patterns in the KBM are allowed to shift in four directions and rotate up to 270° depending on the user preference and logical operations. For additional security XOR and AND logical operations were used to determine whether to choose the next predetermined 64 × 64 pixel block or jump to another pixel block in the cover video frame to place a KBM to embed the secret data. The fact that the combination of variable KBM structure and logical operator for the secret data embedding distinguishes the proposed algorithm from previous video steganography studies conducted with LSB-based approaches. Results Mean Squared Error (MSE), Structural Similarity Index (SSIM) and Peak Signal-to-Noise Ratio (PSNR) parameters were calculated for the detection of the imperceptibility (or the resistance against visual attacks ) of the proposed algorithm. The proposed algorithm obtained the best MSE, SSIM and PSNR parameter values based on the secret message length as 0.00066, 0.99999, 80.01458 dB for 42.8 Kb of secret message and 0.00173, 0.99999, 75.72723 dB for 109 Kb of secret message, respectively. These results are better than the results of classic LSB and the studies conducted with LSB-based video steganography approaches in the literature. Since the proposed system allows an equal amount of data embedding in each video frame the data loss will be less in transformation operations. The lost data can be easily obtained from the entire text with natural language processing. The variable structure of the KBM, logical operators and extra security preventions makes the proposed system be more secure and complex. This increases the unpredictability and resistance against statistical attacks. Thus, the proposed method provides high imperceptibility and resistance towards visual, statistical and transformation-based attacks while acceptable even high payload.

Text as tautology: an exploration in inference, transitivity, and logical compression

Rhetorical structure theory (RST) and relational propositions have been shown useful in analyzing texts as expressions in propositional logic. Because these expressions are systematically derived, they may be expected to model discursive reasoning as articulated in the text. If this is the case, it would follow that logical operations performed on the expressions would be reflected in the texts. In this paper the logic of relational propositions is used to demonstrate the applicability of transitive inference to discourse. Starting with a selection of RST analyses from the research literature, analyses of the logic of relational propositions are performed to identify their corresponding logical expressions and within each expression to identify the inference path implicit within the text. By eliminating intermediary relational propositions, transitivity is then used to progressively compress the expression. The resulting compressions are applied to the corresponding texts and their compressed RST analyses. The application of transitive inference to logical expressions results in abridged texts that are intuitively coherent and logically compatible with their originals. This indicates an underlying isomorphism between the inferential structure of logical expressions and discursive coherence, and it confirms that these expressions function as logical models of the text. Potential areas for application include knowledge representation, logic and argumentation, and RST validation.

Transformation Method for Solving System of Boolean Algebraic Equations

: In recent years, various methods and directions for solving a system of Boolean algebraic equations have been invented, and now they are being very actively investigated. One of these directions is the method of transforming a system of Boolean algebraic equations, given over a ring of Boolean polynomials, into systems of equations over a field of real numbers, and various optimization methods can be applied to these systems. In this paper, we propose a new transformation method for Solving Systems of Boolean Algebraic Equations (SBAE). The essence of the proposed method is that firstly, SBAE written with logical operations are transformed (approximated) in a system of harmonic-polynomial equations in the unit n-dimensional cube Kn with the usual operations of addition and multiplication of numbers. Secondly, a transformed (approximated) system in Kn is solved by using the optimization method. We substantiated the correctness and the right to exist of the proposed method with reliable evidence. Based on this work, plans for further research to improve the proposed method are outlined.

Controlling valley polarisation in graphene via tailored light pulses

Analogous to charge and spin, electrons in solids endows an additional degree of freedom: the valley pseudospin. Two-dimensional hexagonal materials such as graphene exhibit two valleys, labelled as $\mathbf{K}$ and $\mathbf{K}^{\prime}$. These two valleys have the potential to realise logical operations in two-dimensional materials. Obtaining the desired control over valley polarisation between the two valleys is a prerequisite for the logical operations. Recently, it was shown that two counter-rotating circularly polarised laser pulses can induce a significant valley polarisation in graphene. The main focus of the present work is to optimise the valley polarisation in monolayer graphene by controlling different laser parameters, such as wavelength, intensity ratio, frequency ratio and sub-cycle phase in two counter-rotating circularly polarised laser setup. Moreover, an alternate approach, based on single or few-cycle linearly polarised laser pulse, is also explored to induce significant valley polarisation in graphene. Our work could help experimentalists to choose a suitable method with optimised parameter space to obtain the desired control over valley polarisation in monolayer graphene.

Sound Biting Conspiracy: From India with “Love Jihad”

Since 2013, India has seen a remarkable growth of a conspiracy theory known as “love jihad”, which holds that Muslim men conspire to lure Hindu women for marriage to alter India’s religious demography as part of a political takeover strategy. While earlier scholarship on “love jihad” emphasizes the Hindu nationalist propagation of this conspiracy theory, this article pays equal attention to its appeal among conservative Hindus. Making its point of departure in the generative effects of speech, it argues that the “love jihad” neologism performs two logical operations simultaneously. Firstly, it fuses the long-standing Hindu anxiety about daughters marrying against their parents’ will, with the equally long-standing anxiety about unfavorable religious demographic trends. Secondly, it attributes a sinister political takeover intent to every Muslim man who casts his eyes on a young Hindu woman. To bring out these points, this article pays equal empirical attention to marriage and kinship practices as to the genealogy of, and forerunners to, the “love jihad” neologism, and develops the concept of “sound biting” to bring out its meaning-making effect.

Heuristic method for bitsliced representation of randomly generated 8×8 cryptographic S-Box

The article is devoted to the issues of increasing the security and efficiency of software implementation for the symmetric block ciphers. For the implementation of cryptoalgorithms on low-end CPUs (8/16/32-bit microcontrollers), it is important to provide increased resistance to power consumption analysis attacks. With regard to the implementation of ciphers on high-end CPUs (x86, ARM Cortex-A), it is important to eliminate the vulnerability primarily to timing and cache attacks. The authors used a bitslice approach to securely implement block ciphers, which has potential advantages such as high speed and low computing resources. However, the known bitsliced methods have a significant limitation, since they work with deterministic S-Boxes or arbitrary S-Boxes of smaller sizes. The paper proposes a new heuristic method for bitsliced representation of cryptographic 8×8 S-Boxes containing randomly generated values. These values defy description using algebraic expressions. The method is based on the decomposition of the truth table, which describes the S-Box, into two parts. One part of the table forms logical masks, and the other is split into bit vectors. To find a logical description of these vectors an exhaustive search is used. After finding the description of all vectors, these two parts of the table are combined into one using logical operations. The use of this method oriented on software implementation in the logical basis {AND, OR, XOR, NOT} ensures the minimization of arbitrary 8×8 S-Boxes. The proposed method can be implemented using standard logical instructions on any 8/16/32/64-bit processors. It is also possible to use logical SIMD instructions from the SSE, AVX, AVX-512 extensions for x86-64 processors, which provides high performance due to the use of long registers. The corresponding software has been developed that implements the method of searching for bitsliced representations of a given S-Box, and also automatically generates C++ code for it based on SSE, AVX and AVX-512 instructions. The effectiveness of the method on the S-Box of known block ciphers, in particular the Ukrainian encryption standard "Kalyna", has been investigated. It was found that the developed algorithm requires almost half as many gates for the bitsliced description of an arbitrary S-Box than the best of known algorithm (370 gates versus 680, respectively). For ciphers that use two or four S-Box tables, joint minimization can yield up to 330 or 300 gates per table, respectively. Keywords: bitslicing; S-Box; logical minimization; SIMD; x86-64 CPU; software implementation; block ciphers.

Device for Calculating Logical and Arithmetic Operations

A device has been developed that performs logical and arithmetic operations, which can be used to create high-performance, high-speed computing systems. Specialized blocks perform logical operations: AND, OR, NOT, arith­metic operations: addition and subtraction of binary numbers. Arithmetic operations are performed in direct fixed-point codes. The device is presented in the form of a structural scheme, structural and functional schemes of blocks and an algorithm for the operation of the device.