Log in

Relevant bibliographies by topics / Polyalphabetic cipher / Journal articles

To see the other types of publications on this topic, follow the link: Polyalphabetic cipher.

Journal articles on the topic 'Polyalphabetic cipher'

Author: Grafiati

Published: 28 May 2022

Last updated: 29 May 2022

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

Select a source type:

Consult the top 32 journal articles for your research on the topic 'Polyalphabetic 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Mahmudah, Muhlisatul, and Tri Novita Irawati. "Cryptosystem Polyalphabetic Cipher Application." Jurnal Axioma : Jurnal Matematika dan Pembelajaran 5, no. 1 (2020): 11–19. http://dx.doi.org/10.36835/axi.v5i1.539.

Full text

Abstract:

Polyalphabetic cipher cryptosystem is the study of mathematical techniques that related to aspects of information security such as confidentiality, data integrity, authentication and authentication of data origin. With the internet, long distance communication can be done quickly and cheaply. However, the internet is not very secure because it is a public communication medium that can be used by anyone so it is very vulnerable to information tapping. Cryptography has been widely used in life for example banking atm ATMs, account numbers sacrificed, sending secret military messages. By applying polyalphabetic cipher cryptosystems, pins, account numbers and secret messages sent will be more secure and the information will not be easily known. Keywords: polyalphabetic cipher cryptosystem, banking, pin

APA, Harvard, Vancouver, ISO, and other styles

2

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

3

Hewage, Chaminda, Ambikesh Jayal, Glenn Jenkins, and Ryan J. Brown. "A Learned Polyalphabetic Decryption Cipher." SNE Simulation Notes Europe 28, no. 4 (2018): 141–48. http://dx.doi.org/10.11128/sne.28.tn.10441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

Astuti, Lestari Fidi, Kiswara Agung Santoso, and Ahmad Kamsyakawuni. "PENGAMANAN POLYALPHABETIC DENGAN AFFINE CIPHER BERDASARKAN BARISAN FIBONACCI." Majalah Ilmiah Matematika dan Statistika 19, no. 2 (2019): 95. http://dx.doi.org/10.19184/mims.v19i2.17274.

Full text

Abstract:

Affine cipher is a classic cryptographic algorithm substitution technique. Substitution technique is the encryption process for every character in the plaintext will be subtituted by another character. Affine cipher uses two types of keys. Each character of plaintext to be encrypted substituted by the same key. This research discusses about modify one of the key affine cipher, to produce a different key that will be substituted with each plaintext character. Key modifications are made by the Fibonacci sequence rules. This study also compares affine cipher and key modification affine cipher by finding corelation coeffiecient values. The results obtained from the comparison of the two algorithms, encryption that uses affine cipher key modification is better than affine cipher. Keywords: Cryptography, Affine Cipher, Fibonacci, Correlation Value

APA, Harvard, Vancouver, ISO, and other styles

6

Kartha, Ranju S., and Varghese Paul. "Polyalphabetic Substitution Cipher Using Multiple Random Table." International Journal of Computer Sciences and Engineering 6, no. 5 (2018): 51–58. http://dx.doi.org/10.26438/ijcse/v6i5.5158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Basheer, Ghusoon. "Application of Polyalphabetic Substitution Cipher using Genetic Algorithm." AL-Rafidain Journal of Computer Sciences and Mathematics 5, no. 1 (2008): 57–68. http://dx.doi.org/10.33899/csmj.2008.163949.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Som, Sukalyan, and Sabyasachi Ghosh. "A Simple Algebraic Model based Polyalphabetic Substitution Cipher." International Journal of Computer Applications 39, no. 8 (2012): 53–56. http://dx.doi.org/10.5120/4844-7111.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pasaribu, Meliana, Yundari Yundari, and Muhammad Ilyas. "Graceful Labeling and Skolem Graceful Labeling on the U-star Graph and It’s Application in Cryptography." Jambura Journal of Mathematics 3, no. 2 (2021): 103–14. http://dx.doi.org/10.34312/jjom.v3i2.9992.

Full text

Abstract:

Graceful Labeling on graph G=(V, E) is an injective function f from the set of the vertex V(G) to the set of numbers {0,1,2,...,|E(G)|} which induces bijective function f from the set of edges E(G) to the set of numbers {1,2,...,|E(G)|} such that for each edge uv e E(G) with u,v e V(G) in effect f(uv)=|f(u)-f(v)|. Meanwhile, the Skolem graceful labeling is a modification of the Graceful labeling. The graph has graceful labeling or Skolem graceful labeling is called graceful graph or Skolem graceful labeling graph. The graph used in this study is the U-star graph, which is denoted by U(Sn). The purpose of this research is to determine the pattern of the graceful labeling and Skolem graceful labeling on graph U(Sn) apply it to cryptography polyalphabetic cipher. The research begins by forming a graph U(Sn) and they are labeling it with graceful labeling and Skolem graceful labeling. Then, the labeling results are applied to the cryptographic polyalphabetic cipher. In this study, it is found that the U(Sn) graph is a graceful graph and a Skolem graceful graph, and the labeling pattern is obtained. Besides, the labeling results on a graph it U(Sn) can be used to form a table U(Sn) polyalphabetic cipher. The table is used as a key to encrypt messages.

APA, Harvard, Vancouver, ISO, and other styles

11

Patni, Prachi. "Implementation and Result Analysis of Polyalphabetic Approach to Caesar Cipher." IOSR Journal of Computer Engineering 16, no. 4 (2014): 100–106. http://dx.doi.org/10.9790/0661-1643100106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Ibraheem, Noor, and Mokhtar Hasan. "Combining Several Substitution Cipher Algorithms using Circular Queue Data Structure." Baghdad Science Journal 17, no. 4 (2020): 1320. http://dx.doi.org/10.21123/bsj.2020.17.4.1320.

Full text

Abstract:

With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security. This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for every single incoming letter. The present work can be applied efficiently for personal information security and network communication security as well, and the time required for ciphering and deciphering a message is less than 0.1 sec.

APA, Harvard, Vancouver, ISO, and other styles

13

Clark, Andrew, and Ed Dawson. "A PARALLEL GENETIC ALGORITHM FOR CRYPTANALYSIS OF THE POLYALPHABETIC SUBSTITUTION CIPHER." Cryptologia 21, no. 2 (1997): 129–38. http://dx.doi.org/10.1080/0161-119791885850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Imam Riadi, Abdul Fadlil, and Fahmi Auliya Tsani. "Pengamanan Citra Digital Berbasis Kriptografi Menggunakan Algoritma Vigenere Cipher." JISKA (Jurnal Informatika Sunan Kalijaga) 7, no. 1 (2022): 33–45. http://dx.doi.org/10.14421/jiska.2022.7.1.33-45.

Full text

Abstract:

Cryptography is one of the most popular methods in data security by making data very difficult to read or even unreadable. One of the well-known techniques or algorithms in cryptography is Vigenere Cipher. This classic algorithm is classified as a polyalphabetic substitution cipher-based algorithm. Therefore, this algorithm tends to only handle data in text form. By this research, a console-based application has been developed which is made from PHP programming language to be able to encrypt and decrypt digital image media using Vigenere Cipher. The encryption process is done by first converting a digital image into a base64 encoding format so that the encryption process can be carried out using the tabula recta containing the radix-64 letter arrangement used for base64 encoding. Conversely, the decryption process is carried out by restoring the encrypted file using radix-64 letters, so we get the image file in the base64 encoding format. Then, the image with the base64 encoding format is decoded into the original file. The encryption process took less than 0,2 seconds and 0.19 seconds for the decryption process and 33.34% for average file size addition on the encrypted file from the original file size. Testing on ten different images with different sizes and dimensions showed a 100% success rate which means this research was successfully carried out.

APA, Harvard, Vancouver, ISO, and other styles

15

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

16

Xia, Zhihua, Qiuju Ji, Qi Gu, Chengsheng Yuan, and Fengjun Xiao. "A Format-compatible Searchable Encryption Scheme for JPEG Images Using Bag-of-words." ACM Transactions on Multimedia Computing, Communications, and Applications 18, no. 3 (2022): 1–18. http://dx.doi.org/10.1145/3492705.

Full text

Abstract:

The development of cloud computing attracts enterprises and individuals to outsource their data, such as images, to the cloud server. However, direct outsourcing causes the extensive concern of privacy leakage, as images often contain rich sensitive information. A straightforward way to protect privacy is to encrypt the images using the standard cryptographic tools before outsourcing. However, in such a way the possible usage of the outsourced images would be strongly limited together with the services provided to users, like the Content-Based Image Retrieval (CBIR). In this article, we propose a secure outsourced CBIR scheme, in which an encryption scheme is designed for the widely used JPEG-format images, and the secure features can be directly extracted from such encrypted images. Specifically, the JPEG images are encrypted by the block permutation, intra-block permutation, polyalphabetic cipher, and stream cipher. Then secure local histograms are extracted from the encrypted DCT blocks and the Bag-Of-Words (BOW) model is further used to organize the encrypted local features to represent the image. The proposed image encryption gets all of the image data protected and the experimental results show that the proposed scheme achieves improved accuracy with a small file size expansion.

APA, Harvard, Vancouver, ISO, and other styles

17

Kravchenko, Oleksandr. "GENERAL TECHNOLOGY OF ENCRYPTION AND INTEGRATION OF DATA IN A PATTERN OF A PICTURE OF IMAGES THAT IS RESISTANT TO JPEG COMPRESSION." Bulletin of the National Technical University "KhPI". Series: Innovation researches in students’ scientific work, no. 2 (December 16, 2021): 22–28. http://dx.doi.org/10.20998/2220-4784.2021.02.04.

Full text

Abstract:

The object of the thesis is the use of steganographic methods for organizing a covert communication channel in a public channel, providing resistance to lossy compression. The aim of the thesis is to develop an algorithm for embedding data into bitmap images that is resistant to JPEG compression and attacks on the container. In this thesis, the features of the JPEG algorithm are investigated, steganographic methods of information protection are analyzed, and a steganographic algorithm is designed that is resistant to JPEG compression and attacks on the container. Additional security is provided by the polyalphabetic substitution cipher and user secret key used to encrypt the original message. The algorithm was developed using the Python 3 programming language, the NumPy, SciPy, MatPlotLib libraries and the Jupyter Lab package. The task was completed using standard mathematical and statistical methods and tools of the high-level programming language Python 3.

APA, Harvard, Vancouver, ISO, and other styles

18

Fadlil, Abdul, Imam Riadi, and Achmad Nugrahantoro. "Kombinasi Sinkronisasi Jaringan Syaraf Tiruan dan Vigenere Cipher untuk Optimasi Keamanan Informasi." Digital Zone: Jurnal Teknologi Informasi dan Komunikasi 11, no. 1 (2020): 81–95. http://dx.doi.org/10.31849/digitalzone.v11i1.3945.

Full text

Abstract:

Kriptografi pengubahan pesan asli menjadi disamarkan berguna menjaga kerahasiaan, integritas, keaslian, autentikasi pesan ketika proses komunikasi. Kriptografi klasik dengan subtitusi polialfabetik Vigenere memiliki tabel alphabet 26 baris yang relatif sederhana menjamin kerahasiaan. Kini pendekatan pembelajaran mesin Jaringan Syaraf Tiruan (JST) menjadi solusi layak untuk kriptografi dengan membentuk kunci rahasia dalam bobot jaringan sulit terpecahkan. Kunci dihasilkan dari bidirectional learning, dua pohon paritas saling tersinkronisasi dengan paramater hidden neuron, input neuron dan bobot. Sinkronisasi pada saluran publik dengan mengadopsi cara kerja Tree Parity Machine (TPM) dengan tipe feed forward. Pendekatan Kriptografi JST bermanfaat sebagai perlindungan dan serangan kriptografi. Penelitian ini memanfaatkan kombinasi sinkronisasi JST dan Vigenere dalam bentuk generator untuk optimasi pesan. Hasil pengujian kombinasi metode tidak berpengaruh dengan jumlah tampungan karakter pesan dan nilai parameter. Keunggulan kunci yang dihasilkan tidak bisa digunakan secara berulang meski nilai parameter sama, namun panjang karakter kunci berjumlah sama. Sisi fungsionalitas menghasilkan nilai 100%.  Kata kunci: Kriptografi, Jaringan Syaraf Tiruan (JST), Tree Parity Machine (TPM), Vigenere Cipher  Abstract Cryptography changes the original message to be disguised useful to maintain the security message. Vigenere polyalphabetic substitution relatively simple 26-row alphabetical table guaranteeing confidentiality. Machine learning approach Artificial Neural Network (ANN) becomes feasible solution for cryptography by forming secret key in the weight of the network that’s difficult to solve. The key’s generated from bidirectional learning, two parity trees synchronized with hidden neurons, input neurons, and weights. Synchronize public channels by adopting the work of Tree Parity Machine (TPM) with feedforward type. This research utilizes the combination of synchronization ANN and Vigenere from generators. The result of testing the combination of methods doesn’t affect the number of message character and parameter values. The advantages of the resulting key cannot be used repeatedly even though the parameter values are the same, but the key length is the same number of characters. The functionality produces 100% value.  Keywords: Cryptography, Artificial Neural Networks (ANN), Tree Parity Machine (TPM), Vigenere Cipher

APA, Harvard, Vancouver, ISO, and other styles

19

Abeles, Francine, and Stanley H. Lipson. "SOME VICTORIAN PERIODIC POLYALPHABETIC CIPHERS." Cryptologia 14, no. 2 (1990): 128–34. http://dx.doi.org/10.1080/0161-119091864823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Carroll, John M., and Lynda Robbins. "THE AUTOMATED CRYPTANALYSIS OF POLYALPHABETIC CIPHERS." Cryptologia 11, no. 4 (1987): 193–205. http://dx.doi.org/10.1080/0161-118791862018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Carroll, John M., and Lynda Robbins. "The automated cryptananysis of polyalphabetic ciphers." Computers & Security 7, no. 1 (1988): 104. http://dx.doi.org/10.1016/0167-4048(88)90535-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

King, John C. "AN ALGORITHM FOR THE COMPLETE AUTOMATED CRYPTANALYSIS OF PERIODIC POLYALPHABETIC SUBSTITUTION CIPHERS." Cryptologia 18, no. 4 (1994): 332–55. http://dx.doi.org/10.1080/0161-119491882928.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Kaeding, Thomas. "Slippery hill-climbing technique for ciphertext-only cryptanalysis of periodic polyalphabetic substitution ciphers." Cryptologia 44, no. 3 (2019): 205–22. http://dx.doi.org/10.1080/01611194.2019.1655504.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Cassal-Quiroga, B. B., and E. Campos-Cantón. "Generation of Dynamical S-Boxes for Block Ciphers via Extended Logistic Map." Mathematical Problems in Engineering 2020 (March 19, 2020): 1–12. http://dx.doi.org/10.1155/2020/2702653.

Full text

Abstract:

In this work, we present a simple algorithm to design n × n-bits substitution boxes (S-boxes) based on chaotic time series of the logistic map for different carrying capacities. The use of different carrying capacities in the chaotic map leads to low computational complexity, which is desirable to get high-speed communication systems. We generate a main sequence by means of two auxiliary sequences with uniform distribution via the logistic map for different carrying capacities. The elements of the main sequence are useful for generating the elements of an S-box. The auxiliary sequences are generated by considering lag time chaotic series; this helps to hide the chaotic map used. The U-shape distribution of logistic chaotic map is also avoided, in contrast with common chaos-based schemes without considering lag time chaotic series, and uncorrelated S-box elements are obtained. The proposed algorithm guarantees the generation of strong S-boxes that fulfill the following criteria: bijection, nonlinearity, strict avalanche criterion, output bits independence criterion, criterion of equiprobable input/output XOR distribution, and maximum expected linear probability. Finally, an application premised on polyalphabetic ciphers principle is developed to obtain a uniform distribution of the plaintext via dynamical S-boxes.

APA, Harvard, Vancouver, ISO, and other styles

25

Boklan, Kent D. "How I deciphered a Robert E. Lee letter—and a note on the power of context in short polyalphabetic ciphers." Cryptologia 40, no. 5 (2016): 406–10. http://dx.doi.org/10.1080/01611194.2016.1170424.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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

27

"New Polyalphabetic Substitution Scheme for Secure Communication." International Journal of Innovative Technology and Exploring Engineering 9, no. 3 (2020): 3303–10. http://dx.doi.org/10.35940/ijitee.c9043.019320.

Full text

Abstract:

The internet is a very powerful and useful tool for communication, information and connectivity. So it is very important to keep yourself safe and secure online. The best way of secure information is encryption; there are many cryptographic algorithms available for encryption. These cryptographic algorithms are classified according to their encrypting process; as substitution cipher or transposition cipher. In Polyalphabetic ciphers, the substitution rule changes continuously from character to character according to the keyword and plaintext. Vigenere cipher is considered to be the most efficient Polyalphabetic substitution cipher. But it is vulnerable to attacks, due to its repeating nature of the keyword. To overcome this vulnerability, here we are presenting a new Polyalphabetic substitution scheme which uses infinite number of 26 x 26 random tables for encryption. During encryption, whenever the keyword repeats, this proposed Polyalphabetic substitution cipher generates a 26 x 26 alphabetical random table. Instead of using the same Vigenere Table here we are using an infinite number of alphabetical tables depending on the length of the plaintext and keyword. Each random table will be completely independent from the previous table. This will reduces the repeating sequences in the ciphertext. The repeating nature of the keyword does not help the crackers to break this code. So this proposed Polyalphabetic substitution cipher is considered as an unbreakable cryptosystem. The Proposed Polyalphabetic cipher can provide security for many applications such as web transactions, web transactions, personal emails, secret information transmitted between public or private organization, military application etc.

APA, Harvard, Vancouver, ISO, and other styles

28

"Cryptanalysis of Polyalphabetic Cipher Using Differential Evolution Algorithm." Tehnicki vjesnik - Technical Gazette 27, no. 4 (2020). http://dx.doi.org/10.17559/tv-20190314095054.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

"Software Analytical Method for Protecting Digital Information." International Journal of Innovative Technology and Exploring Engineering 9, no. 8 (2020): 460–63. http://dx.doi.org/10.35940/ijitee.g5675.069820.

Full text

Abstract:

Known to date means of information protection does not have a high degree of noise immunity and reliability. This work is related to the development of a more effective way to protect the source information using a software-analytical method based on the Vigenère cipher. The best known and most widely used methods of symmetric encryption are DES and the Vigenère cipher. The Vigenère cipher is a polyalphabetic encryption method for alphabetic text by using key words. The Vigenère cipher requires a single key asked a set b of letters. These sets are signed with the repetition of the message, and then the generated sequence is added back to the plaintext on modul (the power of the alphabet). To achieve this goal we propose to use multiple iteration in which the corresponding algorithms of encryption and decryption consist of successive cycles of the same type of encryption. The developed mathematical model for block coding, as well as methods and algorithms for their decoding. Presented in a modified Vigenère algorithm with the use of a block cipher based on variation of number of iteration with shift key, allows, in contrast to the known algorithms that more reliably protect the data on the Web server.

APA, Harvard, Vancouver, ISO, and other styles

30

"A Binomial Crossover Based Artificial Bee Colony Algorithm for Cryptanalysis of Polyalphabetic Cipher." Tehnicki vjesnik - Technical Gazette 27, no. 6 (2020). http://dx.doi.org/10.17559/tv-20190422225110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Muhammad Aziz Fatchu Rachman, Rizqi Sukma Kharisma,. "PEMBUATAN APLIKASI NOTES MENGGUNAKAN ALGORITMA KRIPTOGRAFI POLYALPHABETIC SUBSTITUTION CIPHER KOMBINASI KODE ASCII DAN OPERASI XOR BERBASIS ANDROID." Respati 12, no. 2 (2017). http://dx.doi.org/10.35842/jtir.v12i2.176.

Full text

Abstract:

Di era digital ini, teknologi berbasis android berkembang begitu cepat. Maka dari itu faktor keamanan sangat berperan penting, sehingga seluruh aplikasi berbasis mobile butuh keamanan. Saat ini menyimpan catatan singkat baik bersifat umum dan pribadi tidak membutuhkan buku dan pena lagi. Kita dapat menyimpannya di smartphone karena hampir semua masyarakat memilikinya. Kerahasiaan informasi catatan tersebut tentunya tidak ingin diketahui dan dicuri oleh orang lain. Maka dari itu dibutuhkannya suatu sistem keamanan yang dapat menjaga informasi tersebut yaitu aplikasi note menggunakan kriptografi. Dengan menggunakan kriptografi ini, informasi yang kita simpan dapat dienkripsi dan dideskripsi dengan suatu kunci yang kita inputkan sehingga hanya kita saja yang tahu isi dari informasi tersebut.Keywords – Polyalphabetic Substitution Cipher, Notes, ASCII, XOR.

APA, Harvard, Vancouver, ISO, and other styles

32

"An enhanced approach on vigenere cipher by polyalphabetics." International Journal of Latest Trends in Engineering and Technology 8, no. 1 (2016). http://dx.doi.org/10.21172/1.81.048.

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!