Academic literature on the topic 'Monoalphabetic cipher'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Monoalphabetic cipher.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Monoalphabetic cipher"

1

Agustini, Siti, Weny Mistarika Rahmawati, and Muchamad Kurniawan. "Modified Vegenere Cipher to Enhance Data Security Using Monoalphabetic Cipher." International Journal of Artificial Intelligence & Robotics (IJAIR) 1, no. 1 (2019): 25. http://dx.doi.org/10.25139/ijair.v1i1.2029.

Full text
Abstract:
The rapid progression of exchange data by public networks is important, especially in information security. We need to keep our information safe from attackers or intruders. Furthermore, information security becomes needed for us. Many kind cipher methods of cryptography are improved to secure information such as monoalphabetic cipher and polyalphabetic cipher. Cryptography makes readable messages becoming non-readable messages. One of the popular algorithms of a polyalphabetic cipher is Vigenere cipher. Vigenere cipher has been used for a long time, but this algorithm has weaknesses. The calculation of the encryption process is only involving additive cipher, it makes this algorithm vulnerability to attacker based on frequency analysis of the letter. The proposed method of this research is making Vigenere cipher more complex by combining monoalphabetic cipher and Vigenere cipher. One of the monoalphabetic ciphers is Affine cipher. Affine cipher has two steps in the encryption process that are an additive cipher and a multiplicative cipher. Our proposed method has been simulated with Matlab. We also tested the vulnerability of the result of encryption by Vigenere Analyzer and Analysis Monoalphabetic Substitution. It shows that our method overcomes the weakness of Vigenere Cipher. Vigenere cipher and Affine cipher are classical cryptography that has a simple algorithm of cryptography. By combining Vigenere cipher and Affine cipher will make a new method that more complex algorithm.
APA, Harvard, Vancouver, ISO, and other styles
2

Aung, Tun Myat, Htet Htet Naing, and Ni Ni Hla. "A Complex Transformation of Monoalphabetic Cipher to Polyalphabetic Cipher: (Vigenère-Affine Cipher)." International Journal of Machine Learning and Computing 9, no. 3 (2019): 296–303. http://dx.doi.org/10.18178/ijmlc.2019.9.3.801.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Shao, Zehui, S. Kosari, R. Anoos, S. M. Sheikholeslami, and J. A. Dayap. "Outer-Convex Dominating Set in the Corona of Graphs as Encryption Key Generator." Complexity 2020 (October 25, 2020): 1–8. http://dx.doi.org/10.1155/2020/8316454.

Full text
Abstract:
In this paper, we present a new type of symmetric encryption by converting the classical monoalphabetic affine cipher into a polyalphabetic cipher. The proposed encryption utilizes the properties of outer-convex dominating set in the corona of graphs to generate random keys from the shared keyword to every character of the message. The new encryption eliminates the weaknesses of affine cipher, thus increasing the level of confidence for exchanging messages.
APA, Harvard, Vancouver, ISO, and other styles
4

Hauer, Bradley, and Grzegorz Kondrak. "Decoding Anagrammed Texts Written in an Unknown Language and Script." Transactions of the Association for Computational Linguistics 4 (December 2016): 75–86. http://dx.doi.org/10.1162/tacl_a_00084.

Full text
Abstract:
Algorithmic decipherment is a prime example of a truly unsupervised problem. The first step in the decipherment process is the identification of the encrypted language. We propose three methods for determining the source language of a document enciphered with a monoalphabetic substitution cipher. The best method achieves 97% accuracy on 380 languages. We then present an approach to decoding anagrammed substitution ciphers, in which the letters within words have been arbitrarily transposed. It obtains the average decryption word accuracy of 93% on a set of 50 ciphertexts in 5 languages. Finally, we report the results on the Voynich manuscript, an unsolved fifteenth century cipher, which suggest Hebrew as the language of the document.
APA, Harvard, Vancouver, ISO, and other styles
5

Antal, Eugen, and Martin Eliáš. "Evolutionary Computation in Cryptanalysis of Classical Ciphers." Tatra Mountains Mathematical Publications 70, no. 1 (2017): 179–97. http://dx.doi.org/10.1515/tmmp-2017-0026.

Full text
Abstract:
Abstract Evolutionary computation has represented a very popular way of problem solving in the recent years. This approach is also capable of effectively solving historical cipher in a fully automated way. This paper deals with empirical cryptanalysis of a monoalphabetic substitution using a genetic algorithm (GA) and a parallel genetic algorithm (PGA). The key ingredient of our contribution is the parameter analysis of GA and PGA. We focus on how these parameters affect the success rate of solving the monoalphabetic substitution.
APA, Harvard, Vancouver, ISO, and other styles
6

Satapure, Pratiksha. "Different Methods of Encryption and Decryption." International Journal for Research in Applied Science and Engineering Technology 9, no. 11 (2021): 170–77. http://dx.doi.org/10.22214/ijraset.2021.38732.

Full text
Abstract:
Abstract: Data is any type of stored digital information. Security is about the protection of assets. Data security refers to protective digital privacy measures that are applied to prevent unauthorized access to computers, personal databases and websites. Cryptography is evergreen and developments. Cryptography protects users by providing functionality for the encryption of data and authentication of other users. Compression is the process of reducing the number of bits or bytes needed to represent a given set of data. It allows saving more data. Cryptography is a popular ways of sending vital information in a secret way. There are many cryptographic techniques available and among them AES is one of the most powerful techniques. The scenario of present day of information security system includes confidentiality, authenticity, integrity, nonrepudiation. The security of communication is a crucial issue on World Wide Web. It is about confidentiality, integrity, authentication during access or editing of confidential internal documents. Keywords: Cryptography, Hill Cipher, Homophonic Substitution Cipher, Monoalphabetic Cipher, Ceaser Cipher.
APA, Harvard, Vancouver, ISO, and other styles
7

Wijaya, Angga. "Modifikasi Algoritma Kriptografi Klasik dengan Implementasi Deterministic Finite Automata melalui Partisi Pesan Asli berdasarkan Kriteria Pesan Bagian." Journal of Science and Applicative Technology 4, no. 2 (2020): 133. http://dx.doi.org/10.35472/jsat.v4i2.346.

Full text
Abstract:
Classical cryptography is study of securing a secret message (plaintext) into a hidden message (ciphertext) which in the process changes each character. The process of converting plaintext into ciphertext is called encryption, the reverse process is called decryption. There is monoalphabetic algorithm, which changes each plaintext letter paired wisely with one particular letter in the ciphertext. The weakness of this algorithm is that the encryption rules can be guessed by analysing the frequency of occurrence of letters. Meanwhile, in polyalphabetic cipher, an algorithm that allows the same letter to be encrypted into different letters. One of them is the Vigenere cipher, which uses keywords that can be repeated to add to the plaintext in the computation of integer modulo. However, this algorithm can be solved using the Kasiski method, because pattern of repeating keywords. In this research, a Deterministic Finite Automata computation model is applied to partition messages before being processed with keywords. Partitions that are formed based on the criteria of message parts ending by the letter E, as letters that often appear in English text. This can increase the security of classical cryptographic algorithms, because they cannot be attacked by frequency analysis or Kasiski methods.
APA, Harvard, Vancouver, ISO, and other styles
8

Sari, Christy Atika, Lalang Erawan, Eko Hari Rachmawanto, De Rosal Ignatius Moses Setiadi, and Tan Samuel Permana. "An Enhancement of One Time Pad Based on Monoalphabeth Caesar Cipher to Secure Grayscale Image." Journal of Applied Intelligent System 2, no. 2 (2018): 88–100. http://dx.doi.org/10.33633/jais.v2i2.1616.

Full text
Abstract:
Image is an object that has been used by various people since long ago. Utilization of these images evolve in line with advances in technology. Image in this information technology era is not only in a physical form, there is also a form of so-called digital image. Many people use digital images for personal use, so prone to be manipulated by others. Cryptographic technique, such as Caesar Cipher and OTP is a security techniques that can be applied to the digital image to avoid manipulation or theft of data image. The result is, an image can be read only by the sender and the recipient's image alone. Combined the two algorithms have fast turnaround time, up to 0.017791 seconds for the image to the size of 512x341 and 0.032302 seconds for the image to the size of 768x512. In addition, the resulting image has a very low degree of similarity, with the highest PSNR value obtained is 6.8653 dB. It can be concluded that the combined algorithm and OTP Caesar Cipher algorithm is fast and difficult to solve.
APA, Harvard, Vancouver, ISO, and other styles
9

Permanasari, Yurika, and Erwin Harahap. "Kriptografi Polyalphabetic." Matematika 17, no. 1 (2018). http://dx.doi.org/10.29313/jmtm.v17i1.4065.

Full text
Abstract:
Abstrak. Kriptografi polyalphabetic merupakan improvisasi dari teknik substitusi monoalphabetic. Polyalphabetic substitution chiper melakukan teknik kriptografi monoalphabetic satu kali proses untuk suatu plainteks pesan. Algoritma polyalphabetic cipher membuat ciperteks lebih kuat untuk dapat dipecahkan karena karakter plainteks yang sama tidak dienkripsi dengan cipherteks yang sama. Kunci enkripsi polyalphabetic cipher dapat berbeda sehingga mempunyai kemungkinan kombinasi yang lebih bervariasi dan lebih sulit dipecahkan. Metode Vigenere cipher menjadi dasar dari polyalphabetic substitution cipher. Teknik enkripsi Vigenere cipher menggunakan tabel yang dikenal dengan tabel Vigenere yang digunakan dan menjadi acuan dibeberapa algoritma pengembangan metode polyalphabetic cipher. Metode polyalphabetic cipher lain adalah playfair cipher, menggunakan tabel kunci berupa matriks 5x5 untuk proses enkripsi sehingga memiliki 25! kemungkinan kunci yang cukup sulit dipecahkan.Kata kunci : polyalphabetic cipher, vigenre cipher, playfair cipherAbstract. (Polyalphabetic Cryptography) Polyalphabetic cryptography is an improvisation of monoalphabetic substitution techniques. Polyalphabetic substitution cipher performs one-time monoalphabetic cryptographic technique for a message text message. The polyalphabetic cipher algorithm makes cipertext stronger to be solved because the same plaintext character is not encrypted with the same ciphertext. The key to polyalphabetic cipher encryption can be different so that it has a more varied and more difficult to solve combination possibilities. The Vigenere cipher method is the basis of polyalphabetic substitution cipher. Vigenere cipher encryption techniques use tables known as Vigenere tables which are used and become references in several algorithms for developing polyalphabetic cipher methods. Another polyalphabetic cipher method is playfair cipher, using a key table in the form of a 5x5 matrix for the encryption process so that it has 25! Possible keys that are quite difficult to solve.Keywords: polyalphabetic cipher, vigenere cipher, playfair cipher
APA, Harvard, Vancouver, ISO, and other styles
10

"Lightweight Coap Based Authentication Scheme by Applying Two-Way Encryption for Secure Transmission." International Journal of Innovative Technology and Exploring Engineering 9, no. 6 (2020): 404``—412. http://dx.doi.org/10.35940/ijitee.e3017.049620.

Full text
Abstract:
With the widespread popularity of the Internet of Things (IoT), different sectors-based applications are increasingly developed. One of the most popular application layer protocols is the Constrained Application Protocol (CoAP), and the necessity of ensuring data security in this layer is crucial. Moreover, attackers target the vulnerabilities of IoT to gain access to the system, which leads to a security threat and violate privacy. Typically, user authentication and data encryption are applied for securing data communication over a public channel between two or more participants. However, most of the existing solutions use cryptography for achieving security, with the exception of high computation cost. Hence, these solutions fail to satisfy the resource-constrained characteristics of IoT devices. Therefore, a lightweight security mechanism is required for achieving both secure transmission and better performance. This paper proposes a Lightweight Authentication with Two-way Encryption for Secure Transmission in CoAP Protocol (LATEST) that provides a secure transmission between the server and IoT devices. This mutual authentication mechanism uses ROT 18 Cipher with XoR operation and 128-bit AES based encryption for securing the data transmission. The ROT18 Cipher is a monoalphabetic substitution cipher, which is a combination of ROT13 and ROT5. The proposed scheme employs symmetric encryption in both client and server for ensuring secure authentication and mutually confirm each other identity. In addition, the proposed LATEST scheme ensures confidentiality and integrity by being resistant to replay attacks, impersonation attacks, and modification attacks. The experimental evaluation demonstrates that the proposed LATEST scheme is lightweight and provides better security compared to the existing scheme.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Monoalphabetic cipher"

1

Porto, Victor Monteiro Ferreira. "Criptografia: Da origem aos dias atuais." Universidade do Estado do Rio de Janeiro, 2015. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=9182.

Full text
Abstract:
Esta pesquisa foi realizada com a intenção de motivar o estudo da criptografia, mostrando que a matemática e a comunicação estão presentes em diversos momentos, tanto no passado quanto no presente. Este trabalho mostra a origem da criptoanálise e toda a sua evolução dando ênfase nos mecanismos de codificação e decodificação através de exemplos práticos. Além disso, alguns métodos criptográficos são destacados como a cifra de substituição monoalfabética, a cifra de Vigenère, a criptografia RSA que é o método mais conhecido de criptografia de chave pública, as cifras de Hill, o método das transformações lineares e o método de Rabin, devido a sua grande importância para a evolução de sistemas computacionais e assinaturas digitais entre outros. Por fim, mostra-se a importância e a necessidade dos recursos criptográficos nos dias de hoje, na tentativa de impedir que hackers e pessoas que fazem mau uso do conhecimento matemático possam causar danos a sociedade, seja por uma simples mensagem ou até mesmo através de situações mais imprudentes como as transações bancárias indevidas<br>This research was conducted with the intention of motivating the study of cryptography, showing that mathematics and the communication are present at various times, both past and present. This work shows the origin of cryptanalysis and all its evolution giving emphasis on coding and decoding mechanisms through practical examples. In addition, some methods cryptographic are highlighted as the monoalphabetic substitution cipher, the Vigenere cipher, RSA encryption that is the best known method of public key cryptography , ciphers Hill, the method of linear transformations and the Rabin method, due to its great importance for the evolution of computer systems and signatures digital among others. Finally, we show the importance and the need for cryptographic resources these days, in an attempt to prevent hackers and people who make bad use of mathematical knowledge can cause damage to society, whether by a simple message or through more situations reckless as improper banking transactions
APA, Harvard, Vancouver, ISO, and other styles
2

Цубера, Василь Васильович, та Vasyl Vasylovych Tsubera. "Криптоаналіз історичних шифрів заміни". Bachelor's thesis, 2021. http://elartu.tntu.edu.ua/handle/lib/35363.

Full text
Abstract:
Кваліфікаційна робота присвячена розробці програмного забезпечення для криптоаналізу історичних шифрів та дослідженню впливу частотного аналізу на них. В роботі обґрунтовано вибір програмного середовища розробки та вибір методів криптоаналізу моно- та поліалфавітних шифрів.. Розроблено програмне забезпечення, в якому реалізовано найпростіші методи криптоаналізу шифрів заміни, яке може бути використане в навчальних цілях для злому шифрованих текстів. В роботі використано відомі методи криптоаналізу для моноалфавітних, біграмних та поліалфавітних шифрів та проведено оцінку складності злому текстів, зашифрованих різними шифрами. Встановлено, що шифр Віженера є найбільш складним для взлому, особливо якщо період ключа достатньо великий, або текст достатньо короткий. Встановлено також, що всі ці методи використовують частотний аналіз, який можливий лише при достатній довжині шифротексту.<br>The qualification thesis is devoted to the development of software for cryptanalysis of historical ciphers and research of the influence of frequency analysis on them. The paper substantiates the choice of software development environment and the choice of methods of cryptanalysis of mono- and polyalphabetic ciphers. The known methods of cryptanalysis for monoalphabetic, bigram and polyalphabetic ciphers are used in the thesis and the complexity of hacking of texts encrypted with different ciphers is estimated. It is established that the Vigener cipher is the most difficult to crack, especially if the key period is long enough or the plaintext is short enough. It is also established that all these methods use frequency analysis, which is possible only with a sufficient length of ciphertext.<br>ЗМІСТ....6 ПЕРЕЛІК УМОВНИХ ПОЗНАЧЕНЬ, СИМВОЛІВ, ОДИНИЦЬ, СКОРОЧЕНЬ І ТЕРМІНІВ ...7 ВСТУП ...8 1 ОГЛЯД ЛІТЕРАТУРНИХ ДЖЕРЕЛ ...10 1.1 Криптографія та її застосування ...10 1.2 Класифікація криптографічних методів....13 1.3 Історичні шифри заміни ...15 1.3.1 Моноалфавітні шифри ...15 1.3.2 Поліалфавітні шифри заміни....18 2 КРИПТОАНАЛІЗ ІСТОРИЧНИХ ШИФРІВ ЗАМІНИ..22 2.1 Криптоаналіз моноалфавітних шифрів. ..22 2.1.1 Криптоаналіз шифру Цезаря ....23 2.1.2 Криптоаналіз шифру афінної підстановки ....23 2.1.3 Частотний криптоаналіз .....24 2.2 Криптоаналіз поліалфавітних шифрів заміни ....26 2.2.1 Криптоаналіз афінної підстановки біграм ...26 2.2.2 Криптоаналіз шифру Віженера .....30 3 Програмна реалізація методів криптоаналізу....33 3.1 Вибір програмного середовища...33 3.2 Програмна реалізація та тестування частотного криптоаналізу ...36 3.3 Програмна реалізація злому афінної підстановки біграм ....40 3.4 Програмна реалізація криптоаналізу шифру Віженера...43 4 Безпека життєдіяльності, основи хорони праці ....45 4.1 Гігієнічні вимоги до організації та обладнання робочих місць з ВДТ ....45 4.2 Долікарська допомога при ураженні електричним струмом....46 ВИСНОВКИ......50 СПИСОК ВИКОРИСТАНИХ ДЖЕРЕЛ ....51 ДОДАТКИ
APA, Harvard, Vancouver, ISO, and other styles
3

Chiu, Hung-Yu, and 邱虹瑜. "Cracking Monoalphabetic Substitution Ciphers By Reinforcement Learning." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/e5ezc8.

Full text
Abstract:
碩士<br>國立交通大學<br>資訊科學與工程研究所<br>108<br>Monoalphabetic Substitution Cipher is the basis of many cryptography, for example, Data Encryption Standard(DES) and Advanced Encryption Standard(AES). Studying how to crack a cipher contributes to designing a more secure cryptography. Many cryptanalysis of monoalphabetic substitution cipher relies on frequency analysis. For instance, Hill Climbing Algorithm, Simulated Annealing, Genetic Algorithm, Tabu Search and Particle Swarm Optimization. The differences between those methods are the way they generate a new key and the way they update the best key. It is worth noting that they all used fitness function to evaluate how good the current key is, which was designed according to unigram and bigram frequency analysis. However, the distribution of the alphabets in plaintext is unknown and we could not guarantee that it will be similar to the distribution of the statistics. Especially, when the cipher is very short, the distribution of alphabets in the cipher might be extremely different from the statistics. Therefore, the methods which rely on frequency analysis usually crack the cipher partially. Sometimes human effort is needed to complete the cryptanalysis. For the above reasons, we proposed a method to crack monoalphabetic substitution ciphers based on reinforcement learning. We model the cryptanalysis as a multi-armed bandit problem. At the stage of exploit and explore, we generate the new key according to the pattern. The pattern was designed on the basis of the length of a word and the repeated alphabets in a word. Through trial and error and the update of action value, the key becomes better and better. To evaluate how good the key is, a reward function was designed. The reward means the correctness of the alphabet in the key according to the mapping result of a dictionary with twenty thousand words. The experiment results showed that our method reached about 96% average correctness in 100 times of testing with different ciphers, which is readable. And the highest correctness for a single testing is 100%. To our best knowledge, we are the first to crack monoalphabetic substitution ciphers by multi-armed bandit. Last but not least, our method does not rely on unigram or bigram frequency analysis.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Monoalphabetic cipher"

1

Salomon, David. "Monoalphabetic Substitution Ciphers." In Data Privacy and Security. Springer New York, 2003. http://dx.doi.org/10.1007/978-0-387-21707-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

"Monoalphabetic Substitution Ciphers." In Cryptological Mathematics. American Mathematical Society, 2000. http://dx.doi.org/10.1090/clrm/016/01.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bauer, Craig P. "Monoalphabetic Substitution Ciphers, or MASCs: Disguises for Messages." In Secret History, 2nd ed. Chapman and Hall/CRC, 2021. http://dx.doi.org/10.1201/9781315162539-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Monoalphabetic cipher"

1

Sprengel, Matthew D., and Jason M. Pittman. "An Enhanced Visualization Tool for Teaching Monoalphabetic Substitution Cipher Frequency Analysis." In SIGMIS-CPR '16: 2016 Computers and People Research Conference. ACM, 2016. http://dx.doi.org/10.1145/2890602.2890613.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Luthra, Jitin, and Saibal K. Pal. "A hybrid Firefly Algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher." In 2011 World Congress on Information and Communication Technologies (WICT). IEEE, 2011. http://dx.doi.org/10.1109/wict.2011.6141244.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oranchak, David. "Evolutionary algorithm for decryption of monoalphabetic homophonic substitution ciphers encoded as constraint satisfaction problems." In the 10th annual conference. ACM Press, 2008. http://dx.doi.org/10.1145/1389095.1389425.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography