History of Cryptography and Cryptanalysis

  title={History of Cryptography and Cryptanalysis},
  author={John F. Dooley},
  booktitle={History of Computing},
  • J. Dooley
  • Published in History of Computing 23 August 2018
  • Computer Science, Mathematics
Cryptography is an interdisciplinary subject, drawing from several fields. Older forms of cryptography were chiefly concerned with patterns in language. More recently, the emphasis has shifted, and cryptography makes extensive use of mathematics, particularly discrete mathematics, including topics from number theory, information theory, computational complexity, statistics and combinatorics. Cryptography is also considered a branch of engineering, but it is considered to be an unusual one as it… 
Files cryptography based on one-time pad algorithm
The Vernam and advance encryption standard AES algorithms are used to encrypt the data as well as to hide the encryption key, and a password is placed on the file because of the use of the AES algorithm; thus, the protection record becomes very high.
Quantum Computing and the Financial System: Spooky Action at a Distance?, WP/21/71, March 2021
Financial institutions should take steps now to prepare for the cryptographic transition, by assessing future and retroactive risks from quantum computers, taking an inventory of their cryptographic algorithms (especially public keys), and building cryptographic agility to improve the overall cybersecurity resilience.
The Beale ciphers in fiction
  • J. Dooley
  • Art, Computer Science
  • 2019
Abstract The Beale ciphers are an interesting unsolved cryptographic puzzle, if for no other reason than their solution may uncover the location of a multimillion-dollar treasure. That is, if they
Using Hadamard transform for cryptanalysis of pseudo-random generators in stream ciphers
The probability to decipher different pseudo-random number generators used as components of stream ciphers is determined and a relationship between entropy and Hadamard’s values is found.
Transcription of Historical Encrypted Manuscripts
This thesis examines a semi-automated Interactive Transcription Tool based on unsupervised learning without any labelled training data that has been developed for transcription of encrypted sources and compares it to manual transcription.
Development of Cryptography since Shannon
The development of cryptography since Shannon’s seminal paper “Communication Theory of Secrecy Systems” in 1949 is presented.
An Improved Image Steganography through Least Significant Bit Embedding Technique with Data Encryption and Compression Using Polybius Cipher and Huffman Coding Algorithm
  • Jan Carlo T. Arroyo
  • Computer Science
    International Journal of Advanced Trends in Computer Science and Engineering
  • 2020
Simulation results show that the proposed methodology produced stego images with better performance as to file size, Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and error metrics as against the Stego image generated using the lone LSB steganography.
2. LSB Image Steganography with Data Compression Technique Using Goldbach G0 Code
A compression technique in securing text data using the Goldbach code algorithm is used in image steganography, paving the way to more secure storage and data transmission, as evident in file size, Peak Signal to Noise Ratio (PSNR), and MSE parameters.
LSB Image Steganography with Data Compression Technique Using Goldbach G0 Code Algorithm
Simulation results revealed that the combination of the two methods had paved the way to more secure storage and data transmission, as evident in file size, Peak Signal to Noise Ratio (PSNR), and MSE parameters used.
Active Learning to Find the Key to Unlock Your Laptop
Higher education students are usually not familiar with active learning, especially students from degrees not related to education. This is not the case of primary and secondary education students,


[서평]「Applied Cryptography」
The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical
Differential cryptanalysis of DES-like cryptosystems
A new type of cryptanalytic attack is developed which can break the reduced variant of DES with eight rounds in a few minutes on a personal computer and can break any reduced variantof DES (with up to 15 rounds) using less than 256 operations and chosen plaintexts.
New directions in cryptography
This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)
This paper starts to bridge the gap between two distinct, rigorous views of cryptography by providing a computational justification for a formal treatment of encryption.
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of
A method for obtaining digital signatures and public-key cryptosystems
An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key, soriers or other secure means are not needed to transmit keys.
Foundations of Cryptography: Volume 1, Basic Tools
It's coming again, the new collection that this site has, and the favorite foundations of cryptography volume 1 basic tools vol 1 book is offered as the choice today.
Safeguarding cryptographic keys
  • G. Blakley
  • Computer Science, Mathematics
    1979 International Workshop on Managing Requirements Knowledge (MARK)
  • 1979
Certain cryptographic keys, such as a number which makes it possible to compute the secret decoding exponent in an RSA public key cryptosystem, 1 , 5 or the system master key and certain other keys
A note on non-secret encryption
A possible implementation is suggested of J H Ellis's proposed method of encryption involving no sharing of secret information (key lists, machine setups , pluggings etc) between sender and receiver.
On the security of public key protocols
  • D. Dolev, A. Yao
  • Computer Science
    22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
Several models are formulated in which the security of protocols can be discussed precisely, and algorithms and characterizations that can be used to determine protocol security in these models are given.