To begin with, cryptology is the mathematics, algorithms, and the applications of formulas that underpins cryptography and cryptanalysis. The world of cryptology goes from basic foundations in cryptography (code-making) to modern algebraic
cryptanalysis (code-breaking). So, cryptology is clearly divided into two major
parts: cryptography and cryptanalysis; with strong connections to each
other, which include
cryptographic applications, types of cryptography and their algorithms, code-breaking techniques, information theory, number theory and mathematical
applications to encrypt data and also break ciphers.
Showing posts with label Theoretical Computer Science. Show all posts
Showing posts with label Theoretical Computer Science. Show all posts
Sunday, 6 June 2021
Cryptology vs. Cryptography vs. Cryptanalysis. What's the Difference?
Although the words cryptology, cryptography and cryptanalysis are used interchangeably — strictly speaking — they mean different things. Nowadays, we only use the word cryptography for everything; it's indeed a catch-all for a broad range of intertwined topics. Today’s post not only aims to point out the differences among them but also to show their connections to each other.
Categories:
Cryptography,
Theoretical Computer Science
Monday, 26 April 2021
Curious About Cryptographic Boolean Functions?
In order to have a good understanding of cryptographic Boolean functions, let's get started from scratch, that's, having a look at the very basic concepts. To begin with, all modern computers are composed of very basic logic circuits using very basic gates, called operators which only apply to binary numbers, in other words, 0 and 1. Each type of gate implements a Boolean operation. The finite field ${\mathbb F}_{2}=\{0,1\}$ is also called binary field, and it is of special interest because it is particularly efficient for implementation in hardware or on a binary computer. Using these gates, the rules of Boolean algebra may be applied to design circuits that perform a variety of tasks. For example, integrated circuits. Then, these circuits are all put together to build into more powerful modern computers.
Categories:
Boolean Functions,
Cryptography,
Theoretical Computer Science
Friday, 5 March 2021
Do You Want to Be a Cryptographer?
![]() |
Alan Turing |
Categories:
Cryptography,
Maths,
Security,
Theoretical Computer Science
Most Popular posts
- Checking SQL Server stale statistics
- Memory + CPU support for all Windows Server versions and editions
- How to create new Logins and Users for an AlwaysOn Availability Group
- The 'SkipErrors' parameter for the Replication Distribution Agent
- AlwaysOn AG Listener: The attempt to create the network name and IP address for the listener failed
- Using ‘sp_browsereplcmds’ to diagnose SQL Server Replication issues
- How to test Read-Only Intent Connection from SQL Management Studio
- Creating alerts for monitoring proactively SQL Server AlwaysOn Availability Groups
- Error: “The local node is not able to communicate with the WSFC cluster” – AlwaysOn Availabiliy Group
- Did you get this "AuthorizationManager check failed" error working with SQL Jobs and PowerShell?
HELLO, I'M PERCY REYES! — a book lover, healthy lifestyle lover... I've been working as a senior SQL Server Database Administrator (DBA) for over 20 years; I'm a three-time awarded Microsoft Data Platform MVP. I'm currently doing a PhD in Computer Science (cryptography) at Loughborough University, England — working on cryptographic Boolean functions, algorithmic cryptanalysis, number theory, and other algebraic aspects of cryptography. READ MORE