The document describes a genetic algorithm approach to musical cryptography. Musical notes and attributes from Karnatic music are used to encrypt plaintext messages. A transition probability matrix is generated from a raga (musical form) to determine the likelihood of transitions between notes. Candidate notes are selected from the matrix to encode each character. A genetic algorithm with selection, crossover and mutation operates on an initial population of encrypted musical sequences to determine the sequence with the highest fitness as the encrypted ciphertext. At the receiver, the musical notes are decrypted by searching the transition matrix to map each note back to the original character. The genetic algorithm helps select the optimal encrypted musical sequence to obscure the message content and reduce detection of being encrypted.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Novel Algorithm For Encryption:Hybrid of Transposition and Substitution MethodIDES Editor
This paper presents an algorithm which is hybrib of
Transposition and Substitution method.The main advantage
of this approach is ,it doesn’t use any key from outside because
key is present within the original message.Due to this the
main problem of exchanging keys securely is solved.Both Transposition
and Substitution method have their own limitations.So
we use both these method so that the resultant cipher is more
secure and strong.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
An Enhanced Message Digest Hash Algorithm for Information Securitypaperpublications3
Abstract: Information is an important commodity in the world of Electronic communication. To achieve a secure communication between communicating parties, the protection of authenticity and integrity of information is necessary. Cryptographic hash functions play a central role in cryptology. A cryptographic hash function takes an input of arbitrary large size and returns a small fixed size hash value. It satisfies three major cryptographic properties: preimage resistance, second preimage resistance and collision resistance. Due to its cryptographic properties hash function has become an important cryptographic tool which is used to protect information authenticity and integrity. This thesis presents a review of cryptographic hash functions. The thesis includes various applications of hash functions. It gives special emphasis on dedicated hash functions MD5.
Recent breakthroughs in cryptanalysis of standard hash functions like SHA-1 and MD5 raise the need for alternatives. In the past few years, there have been significant research advances in the analysis of hash functions and it was shown that none of the hash algorithm is secure enough for critical purposes whether it is MD5 or SHA-1. Nowadays scientists have found weaknesses in a number of hash functions, including MD5, SHA and RIPEMD. So the purpose of this thesis is combination of some function to reinforce these functions and also increasing hash code of message digest of length up to 160 that makes stronger algorithm against collision and brute force attacks.
Modern-day computer security relies heavily on cryptography as a means to protect the data that we have
become increasingly reliant on. The main research in computer security domain is how to enhance the
speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the
CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo
value that can process large power of numbers which otherwise are not supported by built-in data types.
First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using
CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime
number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or
small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical
soundness can be alleviated by this algorithm.
Novel Algorithm For Encryption:Hybrid of Transposition and Substitution MethodIDES Editor
This paper presents an algorithm which is hybrib of
Transposition and Substitution method.The main advantage
of this approach is ,it doesn’t use any key from outside because
key is present within the original message.Due to this the
main problem of exchanging keys securely is solved.Both Transposition
and Substitution method have their own limitations.So
we use both these method so that the resultant cipher is more
secure and strong.
Elgamal signature for content distribution with network codingijwmn
Network coding is a slightly new forwarding technique which receives various applications in traditional
computer networks, wireless sensor networks and peer-to-peer systems. However, network coding is
inherently vulnerable to pollution attacks by malicious nodes in the network. If any fake node in the
network spreads polluted packets, the pollution of packets will spread quickly since the output of (even an)
honest node is corrupted if at least one of the incoming packets is corrupted. There have been adapted a
few ordinary signature schemes to network coding that allows nodes to check the validity of a packet
without decoding. In this paper, we propose a scheme uses ElGamal signature in network coding. Our
scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the
integrity of the packets received easily.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
DATA HIDING IN AUDIO SIGNALS USING WAVELET TRANSFORM WITH ENHANCED SECURITYcsandit
Rapid increase in data transmission over internet results in emphasis on information security.
Audio steganography is used for secure transmission of secret data with audio signal as the
carrier. In the proposed method, cover audio file is transformed from space domain to wavelet
domain using lifting scheme, leading to secure data hiding. Text message is encrypted using
dynamic encryption algorithm. Cipher text is then hidden in wavelet coefficients of cover audio
signal. Signal to Noise Ratio (SNR) and Squared Pearson Correlation Coefficient (SPCC)
values are computed to judge the quality of the stego audio signal. Results show that stego
audio signal is perceptually indistinguishable from the cover audio signal. Stego audio signal is
robust even in presence of external noise. Proposed method provides secure and least error
data extraction.
An Approach on Data Security with the Combination of Symmetric and Asymmetric...AnirbanBhowmik8
Data security is an important issue in modern era. In this paper, we use both symmetric and asymmetric key for encryption and decryption for data security. In our technique, two phases are used. In the 1st phase symmetric key encryption is used and in 2nd phase asymmetric key encryption like RSA is used.
Abstractive text summarization is nowadays one of the most important research topics in NLP. However, getting a deep understanding of what it is and also how it works requires a series of base pieces of knowledge that build on top of each other. This is the reason why this presentation will give audiences an overview of sequence-to-sequence with the acceleration of various versions of attention over the past few years. In addition, natural language generation (NLG) with the focusing on decoder techniques and its relevant problems will be reviewed, as a supportive factor to the light of the success of automatic summarization. Finally, the abstractive text summarization will be represented with potential approaches to tackle some hot issues in some latest research papers.
UNIT II COMMUNICATION IN DISTRIBUTED SYSTEM 10
System Model – Inter process Communication – the API for internet protocols – External data representation and Multicast communication. Network virtualization: Overlay networks. Case study: MPI Remote Method Invocation And Objects: Remote Invocation – Introduction – Request-reply protocols – Remote procedure call – Remote method invocation. Case study: Java RMI – Group communication – Publish-subscribe systems – Message queues – Shared memory approaches – Distributed objects – Case study: Enterprise Java Beans -from objects to components.
Different types of Authentications described in different scenarios. Basically a survey paper on Different kinds of authentications in different scenarios.
In this paper, a computational science guided soft computing based cryptographic technique using Ant
Colony Intelligence (ACICT) has been proposed. In this proposed approach at first a metamorphosed
based strategy is used to produce intermediate cipher text. Finally, ACI generated keystream is used to
further encrypt the intermediate cipher text to produce the final cipher text. In this approach an ant agent
having a pheromone deposition consisting of a group of alphanumeric characters is called a key stream
and each character in the key stream is known as key. The key stream length always be less than or equal
to the plaintext to be encrypt. The keystream generation is based on distribution of characters in the
plaintext. Instead of transmitting the plain keystream to the receiver, further encryption is done on
keystream and encrypted keystream get transmitted to the receiver. Parametric tests are done and results
are compared with some existing classical techniques, which show comparable results for the proposed
system.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital
signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large
integers which is a compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and to decrease the power
consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique
which can be used to enhance the performance of RSA is parallel programming. In this paper we are
presenting the survey of various parallel implementations of RSA algorithm involving variety of hardware
and software implementations.
DATA HIDING IN AUDIO SIGNALS USING WAVELET TRANSFORM WITH ENHANCED SECURITYcsandit
Rapid increase in data transmission over internet results in emphasis on information security.
Audio steganography is used for secure transmission of secret data with audio signal as the
carrier. In the proposed method, cover audio file is transformed from space domain to wavelet
domain using lifting scheme, leading to secure data hiding. Text message is encrypted using
dynamic encryption algorithm. Cipher text is then hidden in wavelet coefficients of cover audio
signal. Signal to Noise Ratio (SNR) and Squared Pearson Correlation Coefficient (SPCC)
values are computed to judge the quality of the stego audio signal. Results show that stego
audio signal is perceptually indistinguishable from the cover audio signal. Stego audio signal is
robust even in presence of external noise. Proposed method provides secure and least error
data extraction.
An Approach on Data Security with the Combination of Symmetric and Asymmetric...AnirbanBhowmik8
Data security is an important issue in modern era. In this paper, we use both symmetric and asymmetric key for encryption and decryption for data security. In our technique, two phases are used. In the 1st phase symmetric key encryption is used and in 2nd phase asymmetric key encryption like RSA is used.
Abstractive text summarization is nowadays one of the most important research topics in NLP. However, getting a deep understanding of what it is and also how it works requires a series of base pieces of knowledge that build on top of each other. This is the reason why this presentation will give audiences an overview of sequence-to-sequence with the acceleration of various versions of attention over the past few years. In addition, natural language generation (NLG) with the focusing on decoder techniques and its relevant problems will be reviewed, as a supportive factor to the light of the success of automatic summarization. Finally, the abstractive text summarization will be represented with potential approaches to tackle some hot issues in some latest research papers.
UNIT II COMMUNICATION IN DISTRIBUTED SYSTEM 10
System Model – Inter process Communication – the API for internet protocols – External data representation and Multicast communication. Network virtualization: Overlay networks. Case study: MPI Remote Method Invocation And Objects: Remote Invocation – Introduction – Request-reply protocols – Remote procedure call – Remote method invocation. Case study: Java RMI – Group communication – Publish-subscribe systems – Message queues – Shared memory approaches – Distributed objects – Case study: Enterprise Java Beans -from objects to components.
Different types of Authentications described in different scenarios. Basically a survey paper on Different kinds of authentications in different scenarios.
In this paper, a computational science guided soft computing based cryptographic technique using Ant
Colony Intelligence (ACICT) has been proposed. In this proposed approach at first a metamorphosed
based strategy is used to produce intermediate cipher text. Finally, ACI generated keystream is used to
further encrypt the intermediate cipher text to produce the final cipher text. In this approach an ant agent
having a pheromone deposition consisting of a group of alphanumeric characters is called a key stream
and each character in the key stream is known as key. The key stream length always be less than or equal
to the plaintext to be encrypt. The keystream generation is based on distribution of characters in the
plaintext. Instead of transmitting the plain keystream to the receiver, further encryption is done on
keystream and encrypted keystream get transmitted to the receiver. Parametric tests are done and results
are compared with some existing classical techniques, which show comparable results for the proposed
system.
International Journal of Computational Engineering Research(IJCER) ijceronline
nternational Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Quantum cryptography for secured communication networksIJECEIAES
Quantum cryptography is a method for accessing data with the cryptosystem more efficiently. The network security and the cryptography are the two major properties in securing the data in the communication network. The quantum cryptography uses the single photon passing through the polarization of a photon. In Quantum Cryptography, it's impossible for the eavesdropper to copy or modify the encrypted messages in the quantum states in which we are sending through the optical fiber channels. Cryptography performed by using the protocols BB84 and B92 protocols. The two basic algorithms of quantum cryptography are Shor’s algorithm and the Grover’s’s algorithm. For finding the number of integer factorization of each photon, Shor’s algorithm is used. Grover’s’s algorithm used for searching the unsorted data. Shor’s algorithm overcomes RSA algorithm by high security. By the implementation of quantum cryptography, we are securing the information from the eavesdropper and thereby preventing data in the communication channel.
RSA is one of the most popular Public Key Cryptography based algorithm mainly used for digital
signatures, encryption/decryption etc. It is based on the mathematical scheme of factorization of very large
integers which is a compute-intensive process and takes very long time as well as power to perform.
Several scientists are working throughout the world to increase the speedup and to decrease the power
consumption of RSA algorithm while keeping the security of the algorithm intact. One popular technique
which can be used to enhance the performance of RSA is parallel programming. In this paper we are
presenting the survey of various parallel implementations of RSA algorithm involving variety of hardware
and software implementations.
Due to the increased use of the internet in recent decades and the large number of transactions and data exchanged over the network . There is an urgent need to provide security for those data, especially those related to military, commercial, or financial exchanges. Many cryptographic methods have recently been widely investigated and developed because there is a demand for a stronger encryption and decryption which is very hard to crack. Most modern encrypting methods include many substitution and iteration processes that encountered some problems such as lack of robustness and significant amount of time.
In this research, a proposed method based on the idea of coding was introduced to achieve security instead of encryption. This search uses ASCII to build a coding table in a different way to provide security and saves effort, time and cost.
https://sites.google.com/site/ijcsis/vol-16-no-1-jan-2018
Color Cryptography using Substitution Methodijtsrd
In world of computer network, fears come in many different forms. Some of the most common fears today are software attacks. If we want to secure any type of data then we can use encryption method. All traditional encryption methods use substitution and switch. Substitution methods map plain text into ciphertext in which characters, numbers and special symbols are substituted with other characters, numbers and special symbols. In this paper, we are using a creative cryptographic replacement method is to generate a stronger cipher than the existing replacement algorithms. This method focuses on the replacement of characters, numbers and special symbols with color blocks. This algorithm of substitution is based on Play Color Cipher. Yashvanth. L | Dr. N. Shanmugapriya "Color Cryptography using Substitution Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29360.pdfPaper URL: https://www.ijtsrd.com/engineering/computer-engineering/29360/color-cryptography-using-substitution-method/yashvanth-l
Performance Analysis of DRA Based OFDM Data Transmission With Respect to Nove...IJERA Editor
In this paper, we have analyzed the performance characteristics of OFDM data transmission with regard to a new high speed RS decoding algorithm. The various characteristics identified are mainly speed and accuracy of the transmission irrespective of channel behaviour. We consider two cases viz. data transmission without error control and data transmission with error control. Each of these cases are duly analyzed and it is proven that high speed RS decoding algorithms can actually benefit OFDM data transmission for advanced communication systems only if implemented at the hardware (VLSI) level because of significant processing overhead involved in software based implementation even though the algorithm may have lower computational complexity.
ASCII Value Based Encryption System (AVB)IJERA Editor
Encryption and decryption are considered to be the guard for data in this technological world. To provide some
kind of security, this paper proposes a new algorithm called AVB algorithm which is used to enhance the
security of the data. This algorithm mainly focuses on ASCII value of data. ASCII value of the character is
encrypted using normal mathematical calculation for number of time on a particular character and converted to
numerical value. Then the cipher text is decrypted to get the original plain text. This algorithm is efficient in two
ways it difficult for the intruders to predict the data as each character follows different form of encryption based
on the key. And also it is simple, fast, and cost efficient while compared to ASCII value based text encryption
system by Udepal Singh and Upasna Garg
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
ENHANCED SECURE ALGORITHM FOR MESSAGE COMMUNICATIONIJNSA Journal
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. The encryption standards such as DES (Data Encryption Standard), AES (Advanced Encryption Standard) and EES (Escrowed Encryption Standard) are widely used to solve the problem of communication over an insecure channel. With advanced technologies in computer hardware and software, these standards seem not to be as secure and fast as one would like. In
this paper we propose a encryption technique which provides security to both the message and the secret key achieving confidentiality and authentication. The Symmetric algorithm used has two advantages over traditional schemes. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the security level is higher due to the inherent poly-alphabetic nature of the substitution mapping method used here, together with the translation and transposition operations performed in the algorithm. Asymmetric algorithm RSA is worldwide known for its high security. In this paper a detailed report of the process is presented and analysis is done comparing our proposed technique with familiar techniques
With increasing technology development in field of communication and Electronic devices, there is a need for better security service for information transfer in Medical Sectors, Banking, Financial and in other IoT applications etc. Fight against security attacks is of prime importance. Through Cryptographic techniques we can provide Authenticity as well as Confidentiality for the user data. In this paper, hardware implementation has been described for a real-time application of speech data encryption and decryption using AES algorithm along with the speech recognition using cross correlation technique. Verilog programming environment is used for AES cryptography whereas MATLAB is used for Speech recognition. ASIC design on AES core is implemented using Cadence tools. Number of gates, area and power used by AES core design has been drastically reduced by specifying wide range of constraints during front end designing. In Backend designing, layout of AES design, which is the physical geometric representation is also developed.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
We have compiled the most important slides from each speaker's presentation. This year’s compilation, available for free, captures the key insights and contributions shared during the DfMAy 2024 conference.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
CW RADAR, FMCW RADAR, FMCW ALTIMETER, AND THEIR PARAMETERSveerababupersonal22
It consists of cw radar and fmcw radar ,range measurement,if amplifier and fmcw altimeterThe CW radar operates using continuous wave transmission, while the FMCW radar employs frequency-modulated continuous wave technology. Range measurement is a crucial aspect of radar systems, providing information about the distance to a target. The IF amplifier plays a key role in signal processing, amplifying intermediate frequency signals for further analysis. The FMCW altimeter utilizes frequency-modulated continuous wave technology to accurately measure altitude above a reference point.
Forklift Classes Overview by Intella PartsIntella Parts
Discover the different forklift classes and their specific applications. Learn how to choose the right forklift for your needs to ensure safety, efficiency, and compliance in your operations.
For more technical information, visit our website https://intellaparts.com
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
HEAP SORT ILLUSTRATED WITH HEAPIFY, BUILD HEAP FOR DYNAMIC ARRAYS.
Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to the selection sort where we first find the minimum element and place the minimum element at the beginning. Repeat the same process for the remaining elements.