Relevant bibliographies by topics / Substitution ciphers

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Substitution ciphers'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 July 2024

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 'Substitution ciphers.'

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 "Substitution ciphers"

1

Lysytska, Iryna, Kostiantyn Lysytskyi, Oleksii Nariezhnii, and Tetiana Hrinenko. "The influence of S-boxes on the arrival of the cipher to the state of random substitution." Radioelectronic and Computer Systems, no. 3 (September 29, 2023): 150–58. http://dx.doi.org/10.32620/reks.2023.3.12.

Full text
Abstract:
The subject of this study is the process of developing block symmetric ciphers with improved cryptographic stability indicators for solving the problems of information protection in information and communication systems. The goal of this study is to develop a mathematical model of the optimal s-box design (non-linear substitution block) for modern block symmetric ciphers. Task: to show that the stability of block symmetric ciphers does not significantly depend on the indicators of the s-boxes included in these ciphers; to justify their use without reducing the stability of random substitutions as s-box constructions of modern block symmetric ciphers; and to prove the futility of searching for s-boxes with special properties. The methods used are: methods of probability theory; mathematical statistics; combinatorics and system analysis; methods of statistical tests; and methods of Boolean algebra. The following results were obtained. In modern ciphers, nonlinear substitution transformations are used as S-boxes (in most ciphers, byte substitutions are used). S-boxes perform the main function of encryption transformation - mixing of text bits. Dynamic indicators of the arrival of the cipher in the state of random substitution depend on their effectiveness. The presented results confirm that the indicators of cipher stability do not significantly depend on the indicators of the S-boxes included in the ciphers. It is not the individual properties of substitutions, but the results of their sequential interactions decisive for achieving stability indicators. It is shown that the fee for encryption is chosen to be three to four times greater than the depth of the avalanche effect - the minimum number of cycles of the cipher’s arrival to the state of random substitution) is hardly noticeable. Conclusions. The scientific novelty of the obtained results is as follows. This work represents a generalization of the transition to the use of random permutations as S-boxes is an increase of only one cycle in the number of cycles of the arrival of the cipher to the state of random permutations, and this is hardly noticeable against the background of the stability margin used in modern ciphers. The result of this generalization is a scientific statement that can be described as follows: random S-boxes can be used in all known modern ciphers without reducing stability. That is, the task of finding S-boxes with special properties loses any meaning, which means that the scientific direction related to the search for S-boxes with special properties becomes redundant.
APA, Harvard, Vancouver, ISO, and other styles
2

Pan, Yining. "The Scope of Application of Letter Frequency Analysis in Substitution Cipher." Journal of Physics: Conference Series 2386, no. 1 (December 1, 2022): 012015. http://dx.doi.org/10.1088/1742-6596/2386/1/012015.

Full text
Abstract:
Abstract Since its inception, substitution ciphers have been a popular type of cipher, and over time, academics have studied them in an effort to discover patterns that will allow them to be broken. They created it because substitution ciphers are a reasonably simple type of cipher. Through a survey of the literature, this paper investigates the encryption and decryption of three sub-types of monoalphabetic ciphers: shift cipher, affine cipher, and random substitution cipher. Letter frequency analysis is the foundation of the primary decryption technique. After that, two sub-kinds of monoalphabetic ciphers, Hill cipher and Playfair cipher, which are resistant to this decryption method because the letters encrypted hardly keep the original frequency, will be introduced. The paper shows that statistical analysis of letter frequency is only useful for deciphering single-table substitution ciphers.
APA, Harvard, Vancouver, ISO, and other styles
3

Bandjur, Milos. "Novel method of discrete message ciphering with equal length of message and cryptogram." Facta universitatis - series: Electronics and Energetics 16, no. 2 (2003): 251–58. http://dx.doi.org/10.2298/fuee0302251b.

Full text
Abstract:
Systems for ciphering contain substitution or transpositions or combination of both. The goal of the present work is to suggest the new cipher that belongs to substitutional ciphers with constant cryptogram length, where cryptogram length is equal with message length. Cipher system suggested here is new and belongs to perfect cipher class regarding the aspect of reliability, as will be shown.
APA, Harvard, Vancouver, ISO, and other styles
4

Hieu, Minh Nguyen, Duy Ho Ngoc, Canh Hoang Ngoc, Trung Dinh Phuong, and Manh Tran Cong. "New primitives of controlled elements F2/4 for block ciphers." International Journal of Electrical and Computer Engineering (IJECE) 10, no. 5 (October 1, 2020): 5470. http://dx.doi.org/10.11591/ijece.v10i5.pp5470-5478.

Full text
Abstract:
This paper develops the cipher design approach based on the use of data-dependent operations (DDOs). A new class of DDO based on the advanced controlled elements (CEs) is introduced, which is proven well suited to hardware implementations for FPGA devices. To increase the hardware implementation efficiency of block ciphers, while using contemporary FPGA devices there is proposed an approach to synthesis of fast block ciphers, which uses the substitution-permutation network constructed on the basis of the controlled elements F2/4 implementing the 2 x 2 substitutions under control of the four-bit vector. There are proposed criteria for selecting elements F2/4 and results on investigating their main cryptographic properties. It is designed a new fast 128-bit block cipher MM-128 that uses the elements F2/4 as elementary building block. The cipher possesses higher performance and requires less hardware resources for its implementation on the bases of FPGA devices than the known block ciphers. There are presented result on differential analysis of the cipher MM-128
APA, Harvard, Vancouver, ISO, and other styles
5

Ratseev, S. M., and V. M. Ratseev. "ON PERFECT IMITATION RESISTANT CIPHERS BASED ON COMBINATORIAL OBJECTS." Vestnik of Samara University. Natural Science Series 22, no. 1-2 (April 24, 2017): 46–50. http://dx.doi.org/10.18287/2541-7525-2016-22-1-2-46-50.

Full text
Abstract:
We study perfect imitation resistant ciphers, highlighting particularly the case in which the probabilities of successful imitation and substitution attain their lower limits. On the basis of A.Yu. Zubov’s mathematical model of substitution cipher with unbounded key model of perfect and imitation resistant cipher based on combinatorial objects is constructed.
APA, Harvard, Vancouver, ISO, and other styles
6

Ratseev, S. M. "ON PERFECT IMITATION RESISTANT CIPHERS OF SUBSTITUTION WITH UNBOUNDED KEY." Vestnik of Samara University. Natural Science Series 19, no. 9.1 (June 5, 2017): 42–48. http://dx.doi.org/10.18287/2541-7525-2013-19-9.1-42-48.

Full text
Abstract:
Constructions of perfect imitation resistant ciphers are investigated in the work. It is well known that Vernam cipher with equiprobable gamma is a perfect cipher but it is not imitation resistant. It is because in Vernam cipher equipotent alphabets for plaintexts and ciphertexts are used. On the basis of A.Yu. Zubov's mathematical model of substitution cipher with unbounded key a model of perfect and imitation resistant cipher is constructed. At that reference cypher of the given model is perfect and reaches lower boundaries for success probability of imitation and substitution of communication.
APA, Harvard, Vancouver, ISO, and other styles
7

Tran Thi, Luong. "PROVING THE SECURITY OF AES BLOCK CIPHER BASED ON MODIFIED MIXCOLUMN." Journal of Computer Science and Cybernetics 40, no. 2 (June 10, 2024): 187–203. http://dx.doi.org/10.15625/1813-9663/18058.

Full text
Abstract:
Block ciphers in general, Substitution-Permutation Network (SPN) block ciphers in particular are cryptographic fields widely applied today. AES is an SPN block cipher used in many security applications. However, there are many strong attacks on block ciphers as linear attacks, differential attacks, and algebraic attacks which are challenging for cryptographers. Therefore, the research to improve the security of block ciphers in general and AES, in particular, is a topic of great interest today. Along with security, the issue of the execution cost of block ciphers is also crucial in practice. In this paper, we clarify the role of the MDS matrix in increasing the branch number of the diffusion layer of the block ciphers, thereby improving the security of the block ciphers. We propose a method improving the security of the AES block cipher by changing the Mixcolumn transformation of AES using execution-efficient MDS matrices of size 4, 8, or 16. We present a method to find a new diffusion matrix of modified AES block ciphers from which to evaluate the number of fixed points and coefficient of fixed points of the modified AES diffusion layers. In addition, we prove the branch number of the modified AES diffusion layers with MDS matrices of sizes 8, and 16. Then we also analyze the security, statistical standards and execution speed of modified AES block ciphers generated from those MDS matrices. The results show that our proposed method can significantly improve the security of the AES block cipher.
APA, Harvard, Vancouver, ISO, and other styles
8

Sayyed, Karishma Shaukat, Prof S. R. Ganolkar, and Prof S. O. Rajankar. "FPGA Implementation of Rectangle Lightweight Block Cipher." International Journal for Research in Applied Science and Engineering Technology 10, no. 5 (May 31, 2022): 2426–33. http://dx.doi.org/10.22214/ijraset.2022.42143.

Full text
Abstract:
Abstract: Block ciphers are basic building blocks for network security. In recent years, designing a lightweight block cipher is the main goal of VLSI design engineers. In this paper, we have designed and verified the functionality of the RECTANGLE block cipher which is one of the lightweight block cipher using Modelsim simulator and implemented using Intel Quartus Prime 18.0 FPGA device. Using the bit-slice technique a RECTANGLE block cipher allows lightweight and fast implementations. The en-cryption architecture has two parts one is round transformation and the other is key scheduling. RECTANGLE uses Substitution-Permutation network. It takes 64-bit plain text and an 80-bit key as an input and converts it into a 64-bit ciphertext. There are three main advantages of using the RECTANGLE block cipher. First, it has a simple design. Second, it is very hardware friendly. By selecting the proper S-block RECTANGLE can achieve good security performance. Index Terms: Lightweight Block Cipher, Block Ciphers, Encryption, Bit-slice technique, Round Transformation, Key Scheduling, Substitution Block, Permutation Block.
APA, Harvard, Vancouver, ISO, and other styles
9

Zahid, Amjad, Muhammad Arshad, and Musheer Ahmad. "A Novel Construction of Efficient Substitution-Boxes Using Cubic Fractional Transformation." Entropy 21, no. 3 (March 5, 2019): 245. http://dx.doi.org/10.3390/e21030245.

Full text
Abstract:
A symmetric block cipher employing a substitution–permutation duo is an effective technique for the provision of information security. For substitution, modern block ciphers use one or more substitution boxes (S-Boxes). Certain criteria and design principles are fulfilled and followed for the construction of a good S-Box. In this paper, an innovative technique to construct substitution-boxes using our cubic fractional transformation (CFT) is presented. The cryptographic strength of the proposed S-box is critically evaluated against the state of the art performance criteria of strong S-boxes, including bijection, nonlinearity, bit independence criterion, strict avalanche effect, and linear and differential approximation probabilities. The performance results of the proposed S-Box are compared with recently investigated S-Boxes to prove its cryptographic strength. The simulation and comparison analyses validate that the proposed S-Box construction method has adequate efficacy to generate efficient candidate S-Boxes for usage in block ciphers.
APA, Harvard, Vancouver, ISO, and other styles
10

Et al., Al-Bahrani. "A New Cipher Based on Feistel Structure and Chaotic Maps." Baghdad Science Journal 16, no. 1 (March 17, 2019): 0270. http://dx.doi.org/10.21123/bsj.16.1.(suppl.).0270.

Full text
Abstract:
Chaotic systems have been proved to be useful and effective for cryptography. Through this work, a new Feistel cipher depend upon chaos systems and Feistel network structure with dynamic secret key size according to the message size have been proposed. Compared with the classical traditional ciphers like Feistel-based structure ciphers, Data Encryption Standards (DES), is the common example of Feistel-based ciphers, the process of confusion and diffusion, will contains the dynamical permutation choice boxes, dynamical substitution choice boxes, which will be generated once and hence, considered static, While using chaotic maps, in the suggested system, called Chaotic-based Proposed Feistel Cipher System (CPFCS), we made the confusion and diffusion in dynamical behavior based on Standard and Lorenz maps. The first is used for substitution, and the second one for permutation operations .A proposed cryptographic system uses the same work (the same way) for both enciphering and deciphering. The proposed cipher operates on more than 500 bytes (4000-bit) readable text blocks by six round computing. Within the basic operator of the cipher, i.e., in the function of the round F, a dynamical lookup table 2D standard map system is used to enhance the complexity and diffusion of the unreadable text. Also, a 3D Logistic map used for key sequence generator and chaos based dynamical Initial Permutation (dynamical IP) are used to increase the diffusion and confusion. Three different image sizes and three different text length were implemented in CPFCS. The results of the proposed system and security tests improve the applicability of PFCS in the data protection and security.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Substitution ciphers"

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
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

Vozák, Petr. "Knihovna algoritmů pro šifrování textu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2011. http://www.nusl.cz/ntk/nusl-237044.

Full text
Abstract:
p, li { white-space: pre-wrap; } p, li { white-space: pre-wrap; } This thesis deals with text ciphering. The presented paper describes at first basic theoretical background of cryptology and basic distribution of cryptographic algorithms. Then it describes a brief history of encryption from beginning to present. Theoretical description of ciphering methods and its implementation details are discussed here. All basic types of conventional encryption algorithms and also some modern ciphering methods are included; these are substitution, transposition, steganographic or combinations encryption systems. The result of this thesis is the library of algorithms for text ciphering in Java with a sample application, which demonstrates its funcionality.
APA, Harvard, Vancouver, ISO, and other styles
3

Bayer, Tomáš. "Návrh hardwarového šifrovacího modulu." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2009. http://www.nusl.cz/ntk/nusl-218076.

Full text
Abstract:
This diploma’s thesis discourses the cryptographic systems and ciphers, whose function, usage and practical implementation are analysed. In the first chapter basic cryptographic terms, symmetric and asymetric cryptographic algorithms and are mentioned. Also usage and reliability are analysed. Following chapters mention substitution, transposition, block and stream ciphers, which are elementary for most cryptographic algorithms. There are also mentioned the modes, which the ciphers work in. In the fourth chapter are described the principles of some chosen cryptographic algorithms. The objective is to make clear the essence of the algorithms’ behavior. When describing some more difficult algorithms the block scheme is added. At the end of each algorithm’s description the example of practical usage is written. The chapter no. five discusses the hardware implementation. Hardware and software implementation is compared from the practical point of view. Several design instruments are described and different hardware design programming languages with their progress, advantages and disadvantages are mentioned. Chapter six discourses the hardware implementation design of chosen ciphers. Concretely the design of stream cipher with pseudo-random sequence generator is designed in VHDL and also in Matlab. As the second design was chosen the block cipher GOST, which was designed in VHDL too. Both designs were tested and verified and then the results were summarized.
APA, Harvard, Vancouver, ISO, and other styles
4

Clark, Andrew J. "Optimisation heuristics for cryptology." Thesis, Queensland University of Technology, 1998. https://eprints.qut.edu.au/15777/1/Andrew_Clark_Thesis.pdf.

Full text
Abstract:
The aim of the research presented in this thesis is to investigate the use of various optimisation heuristics in the fields of automated cryptanalysis and automated cryptographic function generation. These techniques were found to provide a successful method of automated cryptanalysis of a variety of the classical ciphers. Also, they were found to enhance existing fast correlation attacks on certain stream ciphers. A previously proposed attack of the knapsack cipher is shown to be flawed due to the absence of a suitable solution evaluation mechanism. Finally, a new approach for finding highly nonlinear Boolean functions is introduced.
APA, Harvard, Vancouver, ISO, and other styles
5

Clark, Andrew J. "Optimisation Heuristics for Cryptology." Queensland University of Technology, 1998. http://eprints.qut.edu.au/15777/.

Full text
Abstract:
The aim of the research presented in this thesis is to investigate the use of various optimisation heuristics in the fields of automated cryptanalysis and automated cryptographic function generation. These techniques were found to provide a successful method of automated cryptanalysis of a variety of the classical ciphers. Also, they were found to enhance existing fast correlation attacks on certain stream ciphers. A previously proposed attack of the knapsack cipher is shown to be flawed due to the absence of a suitable solution evaluation mechanism. Finally, a new approach for finding highly nonlinear Boolean functions is introduced.
APA, Harvard, Vancouver, ISO, and other styles
6

Fojtová, Lucie. "Softwarová podpora výuky klasické kryptoanalýzy." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2010. http://www.nusl.cz/ntk/nusl-218739.

Full text
Abstract:
Number of today's modern cipher systems are based on the classical symmetric cipher systems, such as the transposition principle in the DES cipher. Successful analysis and deciphering of these ciphers is therefore underlined by solid knowledge of the elementary cryptanalysis methods. This implies the importance of classical cryptanalysis education -- for better a understanding of the field, using visual means is of utmost importance. The aim of the thesis is to summarize selected cipher methods of the classical cryptanalysis, namely the mono-- and polyalphabetical substitution and transposition route cipher. Along with the theoretical part, ciphering/deciphering software is introduced to be used for educational purposes, particularly a website and a standalone application providing tools for ciphering, analysis and code breaking of the classical cipher based code.
APA, Harvard, Vancouver, ISO, and other styles
7

Smékal, David. "Zabezpečení vysokorychlostních komunikačních systémů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2015. http://www.nusl.cz/ntk/nusl-220420.

Full text
Abstract:
The diploma thesis deals with 128–bit AES data encryption and its implementation in FPGA network card using VHDL programming language. The theoretical part explains AES encryption and decryption, its individual steps and operating modes. Further was described the VHDL programming language, development environment Vivado, FPGA network card Combo–80G and configurable framework NetCOPE. The practical part is the implementation of AES–128 in VHDL. A simulation was used to eliminate errors, then the synthesis was performed. These steps were made using Vivado software. Last step of practical part was testing of synthesized firmware on COMBO–80G card. Total of 4 projects were implemented in FPGA card. Two of them were AES encryption and decryption with ECB mode and another two describe the encryption and decryption with CBC mode.
APA, Harvard, Vancouver, ISO, and other styles
8

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

Full text
Abstract:
碩士
國立交通大學
資訊科學與工程研究所
108
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
9

Xu, Jianhong. "Design and implementation of an advanced substitution-permutation encryption network /." 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Su, Dong-Po, and 蘇東波. "A Study on Symmetric Block Cipher Scheme with Preimplemented Substitution Boxes." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/46193517794089583865.

Full text
Abstract:
碩士
國防大學
資訊管理學系
103
Information technology is rapidly developing nowadays; it is a trend for people to use more digitialized documentations in their life and jobs. Therefore, it becomes important that how to protect these digitialized documentations. Data encryption is a good solution to protect confidentiality of these digitialized documentations. However, there exists a process overhead for data encryption. This study proposes an encryption scheme with preimplemented substitution boxes / inverse substitution boxes to enhance data encryption performance. In this study, we use random numbers to generate a million of different substitution boxes / inverse substitution boxes and store them in files. The proposed encryption scheme will base on these preimplemented substitution boxes / inverse substitution boxes to perform a data encryption process. Moreover, for realizing encryption performance of the proposed encryption scheme, we execute a comparison of data encryption processes without preimplemented substitution boxes / inverse substitution boxes. This study implements the proposed encryption scheme with C. We base on several possible scenarios, different sizes of substitution boxes / inverse substitution boxes and different types of files, to perform many data encryption processes and collect the encryption / decryption performance data. Analyzing the collected encryption / decryption performance data, we found that the proposed encryption scheme can receive better performance with a large size (16 * 16) of substitution boxes / inverse substitution boxes.
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Substitution ciphers"

1

Conan, Doyle Arthur. Odoru ningyō. Tōkyō: Popurasha, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Conan, Doyle A. El círculo rojo: Y otros casos de Sherlock Holmes. Madrid: Siruela, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Conan, Doyle Arthur. The Adventure of the Dancing Men: And Other Sherlock Holmes Stories. Mineola, N.Y., USA: Dover Publications, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Conan, Doyle A. The Valley of Fear and Selected Cases. London, England: Penguin Books, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Conan, Doyle Arthur. Favorite Sherlock Holmes Detective Stories. Mineola, N.Y., USA: Dover Publications, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Conan, Doyle A. The Extraordinary Cases of Sherlock Holmes. London, England: Puffin Books, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Conan, Doyle A. Sherlock Holmes Reader. Philadelphia, USA: Courage Books, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Conan, Doyle A. Treize enquêtes élémentaires de Sherlock Holmes. Paris: Librio, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Conan, Doyle Arthur. The Baker Street dozen. New York: Congdon & Weed, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Conan, Doyle A. The Best of Sherlock Holmes. London: Collector's Library, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Substitution ciphers"

1

Rubinstein-Salzedo, Simon. "Substitution Ciphers." In Springer Undergraduate Mathematics Series, 9–23. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-94818-8_3.

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

Salomon, David. "Monoalphabetic Substitution Ciphers." In Data Privacy and Security, 21–37. New York, NY: 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
3

Salomon, David. "Polyalphabetic Substitution Ciphers." In Data Privacy and Security, 59–92. New York, NY: Springer New York, 2003. http://dx.doi.org/10.1007/978-0-387-21707-9_4.

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

Neuenschwander, Daniel. "1 Classical Polyalphabetic Substitution Ciphers." In Probabilistic and Statistical Methods in Cryptology, 9–15. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-25942-8_2.

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

Garici, Mohamed Amine, and Habiba Drias. "Cryptanalysis of Substitution Ciphers Using Scatter Search." In Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, 31–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11499305_4.

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

Karri, Ramesh, Grigori Kuznetsov, and Michael Goessel. "Parity-Based Concurrent Error Detection of Substitution-Permutation Network Block Ciphers." In Lecture Notes in Computer Science, 113–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-540-45238-6_10.

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

Cogliati, Benoît, Yevgeniy Dodis, Jonathan Katz, Jooyoung Lee, John Steinberger, Aishwarya Thiruvengadam, and Zhe Zhang. "Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks." In Lecture Notes in Computer Science, 722–53. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-96884-1_24.

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

Jithendra, K. B., and T. K. Shahana. "Elastic Serial Substitution Box for Block Ciphers with Integrated Hash Function Generation." In Proceedings of SAI Intelligent Systems Conference (IntelliSys) 2016, 658–71. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56991-8_48.

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

Lucks, Michael. "A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers." In Advances in Cryptology — CRYPTO’ 88, 132–44. New York, NY: Springer New York, 1990. http://dx.doi.org/10.1007/0-387-34799-2_11.

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

Jain, Ashish, and Narendra S. Chaudhari. "A New Heuristic Based on the Cuckoo Search for Cryptanalysis of Substitution Ciphers." In Neural Information Processing, 206–15. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-26535-3_24.

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

Conference papers on the topic "Substitution ciphers"

1

Aldarrab, Nada, and Jonathan May. "Segmenting Numerical Substitution Ciphers." In Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2022. http://dx.doi.org/10.18653/v1/2022.emnlp-main.44.

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

Kotov, Yu A. "Software simulation of substitution ciphers." In 2016 13th International Scientific-Technical Conference on Actual Problems of Electronics Instrument Engineering (APEIE). IEEE, 2016. http://dx.doi.org/10.1109/apeie.2016.7802272.

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

Carlson, Albert, Sai Ranganath Mikkilineni, Michael W. Totaro, Richard B. Wells, and Robert E. Hiromoto. "Equivalence of Product Ciphers to Substitution Ciphers and their Security Implications." In 2022 International Symposium on Networks, Computers and Communications (ISNCC). IEEE, 2022. http://dx.doi.org/10.1109/isncc55209.2022.9851719.

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

Borodzhieva, Adriana. "MATLAB-BASED SOFTWARE TOOL FOR IMPLEMENTATION OF TRIFID CIPHERS USING 64-SYMBOL ALPHABET." In eLSE 2017. Carol I National Defence University Publishing House, 2017. http://dx.doi.org/10.12753/2066-026x-17-050.

Full text
Abstract:
The development of information and communication technologies is the dominant factor for the sustainable development of society. Problems of information security are of fundamental importance for the society. To achieve the required levels of security of the information a highly qualified personnel is needed. In this regard increased attention is paid to the training of specialists in this field, based on the continuous improvement of the educational process. The paper presents one of the classical ciphers in cryptography, the trifid cipher, a type of cipher that was used historically but now has fallen into disuse. Most classical ciphers can be practically computed and solved by hand. They are also usually very simple to break with modern technologies. In classical cryptography, the trifid cipher extends the concept of the bifid cipher to a third dimension, allowing each symbol to be fractionated into three elements instead of two. The trifid cipher turns them into coordinates on a 3×3×3 cube. As with the bifid cipher, this is then combined with transposition to achieve a higher degree of diffusion because each output symbol depends on three input symbols instead of two. Thus the trifid cipher was the first practical trigraphic substitution. The paper describes a modified algorithm for implementing the trifid cipher where 64-symbol alphabet (Latin letters, decimal digits and punctuation signs) is used and each symbol is fractionated into three elements turned into coordinates on a 4×4×4 cube. The paper presents MATLAB-based software tool implementing encryption and decryption of English texts using the trifid cipher and 64-symbol alphabet. The tool will be used in the course “Telecommunication Security” by students of the specialty “Telecommunication Systems” for the Bachelor degree at the University of Ruse.
APA, Harvard, Vancouver, ISO, and other styles
5

Aldarrab, Nada, and Jonathan May. "Can Sequence-to-Sequence Models Crack Substitution Ciphers?" In Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers). Stroudsburg, PA, USA: Association for Computational Linguistics, 2021. http://dx.doi.org/10.18653/v1/2021.acl-long.561.

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

Kambhatla, Nishant, Anahita Mansouri Bigvand, and Anoop Sarkar. "Decipherment of Substitution Ciphers with Neural Language Models." In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing. Stroudsburg, PA, USA: Association for Computational Linguistics, 2018. http://dx.doi.org/10.18653/v1/d18-1102.

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

Stachowiak, Sylwia, Miroslaw Kurkowski, and Artur Sobon. "SAT vs. Substitution Boxes of DES like Ciphers." In 2021 IEEE 30th International Conference on Enabling Technologies: Infrastructure for Collaborative Enterprises (WETICE). IEEE, 2021. http://dx.doi.org/10.1109/wetice53228.2021.00032.

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

Ahmad, Musheer, Hammad Haleem, and Parvez Mahmood Khan. "A new chaotic substitution box design for block ciphers." In 2014 International Conference on Signal Processing and Integrated Networks (SPIN). IEEE, 2014. http://dx.doi.org/10.1109/spin.2014.6776958.

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

Mishra, Ruby, Sayantani Dutta, Manish Okade, and Kamalakanta Mahapatra. "Substitution Permutation Network based Lightweight Ciphers with Improved Substitution Layers for Secure IoT Applications." In 2021 2nd International Conference on Range Technology (ICORT). IEEE, 2021. http://dx.doi.org/10.1109/icort52730.2021.9581374.

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

Uddin, Mohammad, and Amr Youssef. "An Artificial Life Technique for the Cryptanalysis of Simple Substitution Ciphers." In 2006 Canadian Conference on Electrical and Computer Engineering. IEEE, 2006. http://dx.doi.org/10.1109/ccece.2006.277769.

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

Reports on the topic "Substitution ciphers"

1

Foxon, Floe. Finding Probable Frequency Sums to Reduce the Key Space of Homophonic Substitution Ciphers. Journal of Young Investigators, July 2020. http://dx.doi.org/10.22186/jyi.38.1.1-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Substitution ciphers' for particular source types:
Journal articles Books
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