With an onset of electronic commerce and portable devices for communication, cryptology has become an exceedingly important science in the present day. The diversity of applications in which crypto-algorithms have to operate have increased and hence the requirement for the efficient algorithms have grown. Confidential information of a government or private agency or department is secured through the use of Cryptography.
Musical properties, for example, notes of which the music is made are not consistent and shift from one arrangement to another. Same tune played by various composers shows a variety in the succession of notes utilized along with different qualities of a musical organization, for example, term of each note and the recurrence at which each note is played. Such a variety can be utilized to encode the message. In this work, we have joined the utilization of Hindustani (North Indian) melodic notes to encode messages and used this method on three ragas to test the robustness of the algorithm with different input size. We have utilized a semi-natural composition procedure to produce note successions of Indian music which would then be able to be utilized as a device for message stowing away. This from the outset place guarantees that the message is avoided the interloper and second it gives another irregular arrangement of notes each time same message is sent. So the very motivation behind a Cryptographic calculation is served. The scrambled message as melodic notes is at that point sent to the planned beneficiary as a melodic structure which helps in opposing the gatecrasher of detecting any classified data that is being sent over the correspondence channel.
Table of Contents
1. INTRODUCTION
1.1 CRYPTOGRAPHY
1.2 TYPES OF CRYPTOGRAPHY
1.2.1 SYMMETRIC KEY
1.2.2 ASYMMETRIC KEY
1.2.3 HASH FUNCTIONS
1.3 MUSICAL CRYPTOGRAPHY
1.4 HINDUSTANI MUSIC
2. LITERATURE SURVEY
3. RAGAS
3.1 AAROH & AVROH
3.2 VADI & SAMVADI
3.3 DEERGHA & ALPA NOTES
3.4 NOTES
3.5 WESTERN MUSIC NOTES
3.6 RAAG BHEEMPALASI
3.7 RAGA BAGESHREE
3.8 RAGA MALKAUNS
3.9 RAGA YAMAN
4. METHODOLOGY
4.1 SEMI-NATURAL COMPOSITION
4.2 MARKOV CHAIN
4.3 TRANSITION PROBABILITY MATRIX (TPM)
4.4 SEMI-NATURAL COMPOSITION ALGORITHM (SNCA)
4.5 BAGESHREE RAGA
4.6 ENCRYPTION
4.7 BHEEMPALASI RAGA
5. ANALYSIS OF RAGA
5.1 EMPIRICAL ANALYSIS
5.1.1 BAGESHREE RAGA
5.1.2 BHEEMPALASI RAGA
5.1.3 MALKAUNS RAGA
6. IMPLEMENTATION AND RESULTS
6.1 THEORETICAL ANALYSIS
6.2 EMPIRICAL ANALYSIS
6.3 EXPERIMENTAL RESULTS
7. CONCLUSION
Research Objective & Core Topics
The primary objective of this work is to develop and evaluate a robust cryptographic method using Hindustani classical music scales (ragas). By employing a semi-natural composition algorithm based on Markov chains, the research aims to transform plaintext messages into unique, irregular sequences of musical notes, thereby ensuring secure data transmission that resists interception through steganography.
- Musical Cryptography and its application in modern communication.
- Theoretical and empirical analysis of Hindustani classical ragas (Bageshree, Bheempalasi, Malkauns).
- Implementation of the Semi-Natural Composition Algorithm (SNCA) for encryption.
- Evaluation of system performance, time complexity, and cryptographic robustness.
Excerpt from the Book
4.2 MARKOV CHAIN
A Markov chain is a stochastic model describing a sequence of possible events within which the probability of every event depends only on the state attained within the previous event. In continuous-time, it's called a stochastic process. It is named after the Russian mathematician Andrey Markov.
Consider a simple coin toss experiment which is repeated number of times. The possible outcomes for this experiment for every trial would be a head or a tail. Say probability of a head is p and a probability of tail is q, p+q=1 which is the total probability. Let us denote the probability of head by 1 and tail by 0 and the random variables designating the result of nth toss by Xn, for n= 1,2, 3,.,.,., Pr {Xn=1}= p , Pr { Xn=0}= q
So, the sequence of random variables X1, X2,X3, … .The trials are independent and the result of the trial does not depend on the previous trials in any circumstances. The random variables are independent [16]. The states of the outcomes are called the states of the Markov Chain [16].
Summary of Chapters
1. INTRODUCTION: Provides an overview of cryptography, its objectives in modern data security, and introduces the concept of musical cryptography using Hindustani classical music.
2. LITERATURE SURVEY: Reviews historical and contemporary methods of using musical documentation and algorithms for cryptographic and steganographic purposes.
3. RAGAS: Explains the structural elements of Hindustani classical music, including the raga system, notes, scales, and specific characteristics of the ragas used in this study.
4. METHODOLOGY: Details the Semi-Natural Composition Algorithm (SNCA) and the Markov Chain model utilized to generate randomized musical sequences for secure encryption.
5. ANALYSIS OF RAGA: Presents the empirical performance data, transition probability matrices, and encryption/decryption execution times for Bageshree, Bheempalasi, and Malkauns ragas.
6. IMPLEMENTATION AND RESULTS: Discusses the experimental setup, performance analysis of the proposed cryptographic tool, and theoretical vs. empirical complexity results.
7. CONCLUSION: Summarizes the effectiveness of the SNC algorithm in providing double-layered security and discusses future improvements for robustness.
Keywords
Musical Cryptography, Raga, Semi-natural composition, Markov chain, Information security, Encryption, Decryption, Hindustani classical music, Data protection, Stochastic process, Bit/Byte encryption, Transition probability matrix.
Frequently Asked Questions
What is the primary focus of this research?
The research focuses on the intersection of cryptography and Indian classical music, aiming to secure messages by encoding them into musical note sequences based on raga structures.
Which ragas are analyzed in this study?
The study specifically analyzes Bageshree, Bheempalasi, and Malkauns ragas to test the robustness of the encryption algorithm.
What is the core cryptographic method used?
The core method is the Semi-Natural Composition Algorithm (SNCA), which utilizes first-order Markov chains to generate random, raga-based musical sequences for encryption.
How is the algorithm's performance measured?
Performance is measured empirically by analyzing the encryption and decryption execution times across various input bit sizes and evaluating the time complexity of the algorithm.
What are the key advantages of this approach?
The approach is memory-efficient, utilizes a recursive program structure, and provides double-secured, irregular message patterns that are highly resistant to intrusion.
What are the fundamental objectives of the proposed system?
The system aims to achieve message confidentiality, authentication, and integrity by making classified data appear as standard musical content during transmission.
How does the Markov Chain influence the encryption process?
The Markov Chain determines the probability of the next musical note based on the current one, ensuring that each encryption run produces a different, unique output for the same message.
Is there a difference between the ragas regarding execution time?
Yes, the study observes that heptatonic ragas (7 notes) typically require more execution time compared to pentatonic ragas (5 notes) due to the complexity of the state space.
- Quote paper
- Shailly Ranjan (Author), Dr. Soubhik Chakraborty (Author), Sandip Dutta (Author), 2020, Musical Cryptography. Empirical Analysis of Algorithms, Munich, GRIN Verlag, https://www.grin.com/document/939103
