Irina Pashchenko | Searcharxiv

arXiv2023

One More Way to Encrypt a Message

This work describes an example of an application of a novel method for symmetric cryptography. Its purpose is to show how a regular message can be encrypted and then decrypted in an easy, yet secure way. The encrypting method introduced in this work is different from others because it involves decimals as well as integers, encrypting the same initial message differently every time, and inserting misleading digits into every encrypted message, thus making the task of breaking the code even harder. A C++ program was written to support each chapter.

cs.CR↗

arXiv2021

First Digit Probability and Benford's Law

The following work is written in easy language for college level students. It shows how the first digit probabilities of a group of continuous real-valued functions can be calculated. Thus, examples explaining how the probabilities are related to specific real-life situations, as well as the summary for all basic algebraic functions, were brought to the reader's attention. Besides, the Benford's formula was derived with no use of any additional guiding sources. Moreover, a comprehensive analysis of a group of certain discrete functions was performed by approximating the functions to the above-mentioned continuous ones, taking limits, and other methods. The work can be applied for calculating the first digit probabilities of more advanced functions as well while using the same approach. Furthermore, the technique can be useful while dealing with a large set of highly approximate numbers and a conclusion about their nature needs to be made.

math.HO↗