Encryption Algorithms

In a recent era, Network security is playing the important role in communication system. Almost all organization either private or government can transfer the data over internet. So the security of electronic data is very important issue. Cryptography is technique to secure the data by using Encryption and Decryption Process. Cryptography is science of “secret information “it is the art of hiding the information by Encryption and Decryption. Encryption is the process to convert the Plaintext into unreadable format known ciphertext and Decryption is the process to convert cipher text into plaintext. Numbers of algorithm used for encryption and Decryption like DES, 2DES, 3DES, RSA, RC2, RC4, RSA, IDEA, Blowfish, AES but AES algorithm is more efficient and Effective AES algorithm is 128 bit block oriented symmetric key encryption algorithm. In this paper I describe the brief introduction of AES algorithm .My paper is divide into following Section. In I Section I Present the brief intro...

Objective: To develop a multi-layered encryption framework
(Phablet) that ensures robust security and efficient
performance.

Contributions: Introduction of a multi-key architecture using 7
public keys and 2 private keys and integration of ECC for
resource-efficient key generation.
Design of custom block ciphers and multi-step encryption
transformations, coupled with a comparative evaluation against
conventional algorithms (AES-256, RSA, etc.)

A new technique proposed with the combination of cryptography and steganography enhanced with new secure feature for generating a new security system. Cryptography and Steganography are two popular ways for secure data transmission in which the former distorts a message so it cannot be understood and another hides a message so it cannot be seen. In cryptography, this system is used advanced encryption standard (AES) algorithm to encrypt secret message and then these are separated keys; one of which is used to hide in cover image. In steganography, a part of encrypted message as a key is used to hide in discrete cosine transform (DCT) of an image which is highly secured. This kind of system is to be introduced in applications such as transferring secret data that can be authentication of various fields.

This study highlights the interesting potential of a new multilayer cryptography scheme for reliable data protection in the field of cybersecurity. To do so, an intensive examination of a multi-layer encryption mechanism is proposed to reinforce the defenses in opposition to online threats to touchy data. The strategy is multilevel, with a superior digital dictionary serving as the foundation for the primary layer. The laborious procedures that went into making this dictionary, including rotation differences, ASCII conversion, and chaotic matrix era, upload to its encoding trouble. A modified model of the advanced encryption standard (AES) algorithm with a brand-new key generation technique, which is based on the chaos idea is furnished through layer 2. A parameter is encrypted using the Rivest-Shamir-Adleman (RSA) method, and further precautions are taken to assure the security of the encryption key. When it comes to encryption time, the first layer significantly outperforms the AES method. In addition to exhibiting instantaneous efficiency in data protection, the first layer outperformed the AES algorithm in terms of encryption time which took more than 3 seconds, and the first layer took less than 0.01 seconds, while both approaches functioned identically in terms of information decryption. In-depth talks are given to customize the suggested method's performance. The results demonstrate the effectiveness of the suggested multi-stage encryption and decryption system and demonstrate its efficacy in protecting text documents.

In the bounded storage model introduced by
Maurer, the adversary is computationally unbounded and has
a bounded storage capacity. In this model, information-theoretic
secrecy is guaranteed by using a publicly available random string
whose length is larger than the adversary storage capacity. The
protocol proposed by Maurer is simple, from the perspective of
implementation, and efficient, from the perspective of the initial
secret key size and random string length. However, he provided
the proof of the security for the case where the adversary can
access a constant fraction of the random string and store only
original bits of the random string. In this paper, we provide a new
proof of the security of the protocol proposed by Maurer for the
general bounded storage model, i.e., the adversary can access all
bits of the random string, and store the output of any Boolean
function on the string. We reaffirm that the protocol is absolutely
semantically secure in the general bounded storage model.

In this study, we reviewed biometric template protection schemes in subsisting literature and established that there is no reliable, efficacious and foolproof technique that assures diversity, revocability, security and optimal performance as is required of an ideal biometric template security scheme. This status of affairs motivated us to contrivance an approach that derives biometric encryption keys from biometric fingerprint templates. The technique we proposed involves a two-step enrollment and authentication of fingerprints while encrypting fingerprint templates with encryption keys derived from other biometric fingerprint templates before archiving them to a database. The system was implemented using Java, developed on Netbeans 8.0 IDE, MySQL RDBMS was used for back-end database and utilized Source AFIS java library framework for fingerprint verification and identification. Test results were carried out to determine the system's efficacy.

The Cipher Block Chaining (CBC) and the Merkle-Hellman algorithm are two different cryptosystems for encrypting messages. But using these cryptosystems separately has many drawbacks. However there are several ways of getting rid of these drawbacks. This paper demonstrates how to use the combination of both the cryptographic algorithms along with randomized vectors, keys and super-increasing sequence to encrypt messages. The encrypted message is stored in secret buffers and these positions are encrypted by use of discrete logarithmics and sent. This not only strengthens the encrypted message but also makes the transmission more secure, so that only the intended recipient of the message is able to decipher the message. This paper focuses on enhancing the confidentiality of the message transfer.

Attribute-based encryption (ABE) with outsourced decoding not as it were empowering fine-grained sharing of
scrambled information, but too overcomes the proficiency downside (in terms of cipher content estimate and
decoding fetched) of the standard ABE plans. In specific, an ABE plot with outsourced decoding permits a third
party (e.g., a cloud server) to change an ABE cipher content into a (brief) El Gamal-type cipher content utilizing
a open change key given by a client so that the last mentioned can be unscrambled much more productively than
the previous by the client. In any case, a inadequacy of the unique outsourced ABE conspire is that the rightness
of the cloud server’s change cannot be confirmed by the client. That is, a conclusion client seems be cheated into
tolerating a off-base or perniciously changed yield. In this paper, we to begin with formalize a security show of
ABE with unquestionable outsourced decoding by presenting a confirmation key in the yield of the encryption
calculation. At that point, we show an approach to change over any ABE conspire with outsourced decoding into
an ABE conspire with irrefutable outsourced unscrambling. The unused approach is basic, common, and nearly
ideal. Compared with the unique outsourced ABE, our unquestionable outsourced ABE not one or the other
increments the user’s and the cloud server’s computation costs but a few nondominant operations (e.g., hash
computations), nor grows the cipher content estimate but including a hash esteem (which is <20 byte for 80-bit
security level). We appear a concrete development based on Green et al.’s cipher text-policy ABE conspire with
outsourced decoding, and give a point-by-point execution assessment to illustrate the points of interest of our
approach.

Data security is a top priority in today's digital world, and encryption is the best method to keep secret information safe. Cyber threats evolve, and traditional encryption techniques become less reliable, unable to protect data, and more difficult to manage. As artificial intelligence (AI) has been embedded, it is now a game changer that can provide innovative solutions to fortify encryption and solve these problems. Using AI to secure software development is not only about how encryption affects the potential of AI; it is about how AI enables a new way of forecasting, detecting, or mitigating security threats in real-time. This paper asserts the increasing effectiveness of AI in encryption for modern secure software development through effective optimization of cryptographic processes, strong key management systems, and dynamic adaptive solutions for ever-evolving cyber threats. Put another way, machine learning, neural networks, and other AI technologies can be used to make encryption more resilient, efficient, and scalable. However, as software systems grow more complex and interconnected, AI will be essential for encrypting data to maintain sound security frameworks. In the following sections, this paper will explore the evolution of encryption, the integration of AI technologies in cryptographic systems, and the advantages and disadvantages of this integration.

Let yC be an almost surely compact, almost everywhere super-embedded system. The goal of the present article is to examine maximal isometries. We show that every injective subring is contravariant. It was Kovalevskaya who first asked whether countable homomorphisms can be extended. A useful survey of the subject can be found in [6].

The advent of quantum computing presents a transformative challenge to contemporary cryptographic systems, threatening the security of widely used encryption algorithms such as RSA, ECC, and Diffie-Hellman. Leveraging principles like superposition and entanglement, quantum computers can efficiently solve complex mathematical problems that underpin classical cryptographic methods. This paper explores the profound implications of quantum computing on cybersecurity, highlighting quantum algorithms such as Shor's and Grover's, which demonstrate the vulnerabilities of current encryption systems. It reviews advancements in post-quantum cryptography, including lattice-based, code-based, and multivariate approaches, and discusses methodologies for integrating quantum-resistant algorithms into existing infrastructures. Case studies on quantum-safe blockchain solutions and quantumsecure communication networks illustrate practical applications and emerging technologies. By examining the challenges and proposing a framework for transitioning to quantum-safe systems, this study underscores the urgency of adopting proactive strategies to secure digital communications in the quantum era.

The advent of quantum computing poses a formidable challenge to the security landscape, particularly in the realm of encryption. Current encryption algorithms, which have safeguarded sensitive data for decades, face unprecedented threats from quantum computers capable of solving complex mathematical problems exponentially faster than classical computers. This essay explores the challenges that quantum computing presents to existing encryption methods, focusing on the vulnerabilities of widely-used schemes like RSA and AES. In response to this quantum threat, the concept of post-quantum cryptography is introduced, encompassing innovative encryption techniques resilient to quantum attacks. Additionally, the notion of quantum-safe encryption is examined, highlighting efforts to develop encryption methods that can withstand quantum adversaries. The essay also underscores the gradual nature of the transition to quantum-resistant encryption and emphasizes the importance of proactive measures for organizations and governments. As we stand on the cusp of the quantum computing age, the future of current encryption algorithms remains uncertain, but it also promises a new era of cryptographic innovation and resilience.

Cryptography is taught with the basic rule that there is no such thing as an unbreakable encryption because "If someone tries enough keys he is bound to get the right one," which gives rise to the basis of the brute force attack. Brute force attack, or exhaustive key search, is a strategy that can, in theory, be used against any encrypted data. It involves systematically checking all possible keys until the correct key is found. One of the measures of the strength of an encryption system is how long it would theoretically take an attacker to mount a successful brute-force attack against it. The so-called Landauer limit implied by the laws of physics sets a lower limit on the energy required to perform a computation of kT and the processing speed and memory requirements also set physical barriers. But with the exponential growth of computing industry supercomputers having computing capacities of 20 Peta-FLOPS and beyond have been made and a number of systems that were originally thought to be impossible to crack by brute force have nevertheless been cracked. A truly unbreakable code must not have an obtainable key. A theory for this is for the code breaker to not realize that he has broken the code even if he has the key. For example, the key and cleartext may change according to a random time variable so that even when the code has been broken the encrypted text could still represent any other meaning. This is however very impractical and has never been able to be put into effect. This paper discusses unbreakability of encryptions and proposes an encryption that can be called truly unbreakable. This paper also discusses a way of implementing an encryption that is contextually breakable and hence can only be used by random common users not criminals and terrorists because for them the code can be broken.

The main objective of this paper is to provide stronger security for communication network over the Internet by enhancing the overall strength of the AES algorithm. Rijndael&#39;s algorithm was been selected as the Advanced Encryption Standard. The AES algorithm provides much more security without any limitations. But, recently some breaking methods on the AES have been found by cryptanalyst. For overcome this problem number of rounds in AES algorithm need to be increased. In AES algorithm, encryption and decryption involving the number of rounds depends on the length of the key and the number of block columns. So, to improve the strength of the AES the number of rounds is increased. By increasing the key length to 512 bit the strength of the AES algorithm is enhanced and in order to provide a stronger encryption method for secure communication the number of rounds is increased. In order to improve the speed of encryption and decryption code optimization is also done using the 512 b...

In the field of medicine, the preservation of medical confidentiality stands as paramount, for it directly influences the secure treatment and dissemination of medical data. Safeguarding against falsification or unauthorized access to patients' medical data, including medical images, is crucial. Conventional methods of image encryption, alongside chaos-based encryption techniques, prove insufficient in addressing the wide ranging demands for security and expediency. Consequently in this paper, we propose a pioneering hyper-chaotic logistic map characterized by a high Lyapunov dimension DL = 2.1886 and its rapid synchronization, which are used in biomedical image encryption, for the first time. This novel encryption method satisfies the most stringent security criteria, demonstrating remarkable resilience against various types of attacks, well in particular resilience against Statistical, Differential, Cipher-text, Noise, and Brute force attacks, as validated by compelling numerical values, we note a correlation coefficient spanning −1.8319 × 10−4 to 6.6977 × 10−4 and a vast key space of more than 2298. This well-established encryption duration ensures the shortest feasible encryption time, approximately 0.3 seconds for images of size 512x512. Finlay, in a comprehensive assessment, we showcase that our proposal satisfies strict security standards and surpasses the encryption techniques suggested by other researchers in terms of security and velocity.

Blockchain technology, first introduced with Bitcoin, has evolved into a powerful system for secure data exchange across numerous industries. Its foundation relies on cryptographic methods like hash algorithms, public key cryptography, and digital signatures to maintain data integrity
and transparency without the need for a central authority. This paper traces the development of blockchain technology, exploring its uses beyond cryptocurrencies, including applications in healthcare, supply chain management, and secure voting systems. The paper also delves into the underlying cryptographic principles, examining the cybersecurity challenges and vulnerabilities associated with blockchain, particularly in the context of quantum computing threats. Through case studies, the paper highlights how blockchain can improve privacy, transparency, and
resilience in practical settings. Finally, the paper discusses future research avenues aimed at enhancing blockchain's efficiency and security in the face of emerging technological advancements.

Internet of things is comprised of smart machines interacting with other machines, objects environments, and infrastructure. As a result, the huge volume of data is being generated; so the necessity to protect such data have become greater by using cryptography technique. Cryptography is a method of transforming information into such form that it is not readable and understandable and then re-transforming that information back to its original form.
The two most accepted and used cryptography techniques are symmetric and asymmetric. In this paper, extensive research on the various cryptographic algorithms will be examined and compared to determine the best combination with Rijndael algorithm in other to improve the security of the Internet of Things.

KEYWORDS Cryptograph, Encryption, Symmetric, Asymmetric, DES, 3DES, RSA, Rijndael, Blowfish & IoT

Because of the high complexities issues in the Internet of Things and its applications, there is a need to propose an appropriate security model that would help in managing and controlling it. This paper critically examined Rijndael’s encryption algorithm in terms of design choices, method of implementation, performance, strength, weaknesses and to determine its applicability in the Internet of things devices and applications.

In this paper, Round transformation will be studied extensively so as to and know and determine the number of rounds that would be
added to st rengthen the encryption method. With the sole purpose of being able to make a recommendation on its use in the context of
IoT with their requirement requirement.

In this paper we study the possibilities and advantages of replacing basic operators such as XOR into more complex table functions inside encryption algorithm. We define the E# and RTGE# operators instead of XOR in simplified form and test these functions as a replacement inside of symmetric model based on Feistel network. The DES algorithm has been chosen for the test. The results show the increase in the complexity while retaining all of security properties for encrypted messages.

In this paper, a new method for digital data cryptography is proposed to increase the speed of data cryptography, simplify the processes of data encryption - decryption, and to strengthen the degree of data protection. The proposed data shuffling and data blocks shuffling (DS_DBS) method is able to process messages, gray images, color images and digital speech file using the same encryption and decryption functions; changing the digital data type will not require any changes in the aforesaid functions. The proposed DS_DBS method allows data blocking (block size will be variable), and it is determined by the private key. Data encryption is applied by simple data shuffling and data blocks shuffling, while data decryption is applied by shuffling back the data blocks and shuffling back the data. These shuffling operations replace the complex logical and arithmetic operations used in other existing methods of data cryptography. The shuffling and shuffling back operations are implemented based on two secret indices keys, obtained by running two chaotic logistic map models. The proposed method utilizes a long private key with a variable length that depends on the selected number of crypto phases. It can be implemented in one or more phases; each phase is a function call to execute the encryption-decryption functions with the associated inputs. Using more than a phase, increases the security level by using longer private key, and each phase will be independent. The encrypted-decrypted result of each phase can be taken as a final result. Implementing the proposed DS_DBS method - using various data types – and examining its speed reveal not only the enhanced speed of data cryptography, but also the better quality and sensitivity of the proposed method compared to those of existing state of the art cryptography methods.

The rise of Internet of Things (IoT) networks has highlighted vulnerabilities related to devices' limited resources. As a result, it has become essential to delegate encryption services to cloud and fog platforms. Encryption as a Service (EaaS) offers a comprehensive range of cryptographic services to end-users, helping them manage their constrained resources and processing capabilities.

This paper reviews the current research on EaaS platforms and categorizes them based on the types of encryption algorithms they employ. Additionally, we present different EaaS architectures depending on the locations of their key components. To our knowledge, no existing surveys in this field have addressed these specific features.

This paper address the cryptographic keys management problem: how to generate the cryptographic keys and apply them to secure encryption. The purpose of this research was to study on utilizing graph labeling for generating stream-keys and implementing the keys for strengthening Vigenere encryption. To achieve this objective, the research was carried out in four stages: developing an algorithm for generating stream-keys, testing the randomness of the constructed keys, implementing the eligible keys in a modified Vigenere encryption and, finally, analyzing the security of the encryption. As the result, most of stream-keys produced by the algorithm are random, and the implementation of the stream keys to the modified Vigenere cipher achieve good security. The contributions of this research are utilizing graph labeling to generate stream-keys and providing different encryption keys for different blocks in a block based cipher with low storage capacity. The novel technical results yielde...

This study investigates the broadcast/multicast authentication problems in wireless sensor networks (WSNs), particularly sensor nodes broadcast authentication and outside user authentication, and proposes efficient and secure solutions for them. The low cost and immunity from cabling have become motivations for many applications of WSNs, for instance, the forest fire alarm, the intelligent traffic system etc. However, the sensitive nature of communication in these applications makes authentication a compulsory security requirement for them. The conventional security solutions are unfeasible for WSNs due to the unique features of sensor networks. Designing a new security mechanism for WSNs, on the other hand, is a challenging task due to the nature of WSNs. This research proposes a solution to the above mentioned authentication problems in the form of an authentication framework for wireless sensor networks.

This study investigates the broadcast/multicast authentication problems in wireless sensor networks (WSNs), particularly sensor nodes broadcast authentication and outside user authentication, and proposes efficient and secure solutions for them. The low cost and immunity from cabling have become motivations for many applications of WSNs, for instance, the forest fire alarm, the intelligent traffic system etc. However, the sensitive nature of communication in these applications makes authentication a compulsory security ...

Finding the Right Processing Architecture for AES Encryption Even before September 11, 2001, security processing has been a mainstay concern for today's communication design engineers. With rogue attacks growing, broadband deployments on the rise, e-commerce activities increasing, and distributed storage becoming a necessity, designers must build systems that provide strong security features.

This document represents the considered judgement and personal views of the participating individuals listed on the following page with expertise in the subject field. It shall not be considered the official position of IEEE or any of its committees, and shall not be relied upon as a formal position of IEEE. It is produced by the IEEE Internet Initiative to enhance knowledge and promote discussion of the issues addressed.

In an era where communication plays the most important role it is very crucial to secure the data end to end. Cryptography helps with data authentication at the execution levels. Not just communication, cryptography also helps to transfer money securely by computing a very huge mathematical problem and encrypting the code which is then decrypted to retrieve the information securely.
Cryptography is used to secure the end-to-end data encryption for communication and transmission over networks. The selected algorithms must check certain criteria such as security preservation. Memory optimization, parallelism. This paper covers the study of cryptographic algorithms like symmetric key algorithm (DES, AES and Blowfish), asymmetric key algorithm (RSA, Diffie Hellman and ECC) and hash function (SHA-256, MD-5) Digital Signature Algorithms and Cryptographic Protocols. The objective of this paper is to investigate research work done in the area of cryptographic algorithms and optimization algorithms.

The need for a reliable and fast encryption algorithm to encrypt medical data for patients is an extremely important topic to be considered especially during pandemic times such as the pandemic COVID-19. This pandemic forced governments and healthcare institutions to monitor COVID-19 patients. All the patient&#39;s data or records are also shared among healthcare researchers to be used to help them find vaccines or cures for this pandemic. Therefore, protecting such data (images, text) or records face an everincreasing number of risks. In this paper, a novel multi-round encryption algorithm based on deoxyribonucleic acid (DNA) is proposed. The significance of the proposed algorithm comes from using a different random key to perform simple and fast encryption operations on multiple rounds to achieve a high level of confusion and diffusion effects in encrypted data. Experiments were conducted using a set of datasets of various types such as Excel sheets, images, and database tables. T...

In this paper we present an approach for designing fast public key encryption cryptosystems using random primitives and error permutation. An encryption speed of such systems allows to use them for "on-the-fly" public key encryption and makes them useful for real-time communications. A small error size allows to use this approach for designing digital signature schemes

In containerized environments, securing interservice communication is paramount, and Mutual TLS (mTLS) offers a robust solution. However, traditional mTLS implementations face challenges in scaling and scalable environments. This paper introduces a novel approach to mTLS using Scaling Policy Assignment (SPA), which leverages Kubernetes' native capabilities to automate and optimize policy application based on service requirements. SPA enables flexible and efficient mTLS enforcement, scaling seamlessly with the environment's complexity. This approach enhances security, reduces manual configuration, and ensures consistent policy application across services.

Chaotic Encryption Method seems to be much better than traditional encryption methods used today. Chaotic encryption is the new direction of cryptography. It makes use of chaotic system properties such as sensitive to initial condition and loss of information. Many chaos-based ...

Huge amount of information is exchanged electronically in most enterprises and organisations. In particular, in all financial and e-business set ups the amount of data stored or exchanged is growing enormously over public network among variety of computing devices. Securing this gargantuan sized input is challenging. This paper provides a framework for securing information exchange using parametric approaches with AVK approach and investigating strength of this cryptosystem using mining algorithms on symmetric key-based cryptosystem. This work demonstrates association rule application as one of the component of cryptic mining system used to process the encrypted data for extracting use full patterns and association. The degree of identified patterns may be use full to rank the degree of safety and class of cryptic algorithm, during auditing of security algorithms.

The motivations and interests of students qualifying for the Students’ Industrial Work Experience Scheme (SIWES) have been found to vary, often based on their perceptions of the program's benefits and drawbacks. The importance of an electronic logbook for SIWES cannot be overstated, as it addresses the challenges and risks associated with traditional paper logbooks. This study proposes an electronic logbook system leveraging internet technologies, offering a significant improvement over the current method. This system facilitates the digital recording of daily activities and achievements during Industrial Training (IT) placements. It allows for easy storage and retrieval of IT reports via server queries. The system's is implemented using C#, Net Core as the frontend and SQL Server as the database.

This paper explores the implementation of the Advanced Encryption Standard (AES) with Derived Unique Key Per Transaction
(DUKPT) in Software Point of Sale (SoftPOS) systems. The rapid advancement of digital payment technologies necessitates robust and
efficient encryption methods to ensure secure transactions. By integrating AES DUKPT, SoftPOS systems can achieve enhanced security,
scalability, and compliance with industry standards. This paper delves into the architecture, key management, encryption processes, and
performance evaluation of AES DUKPT within SoftPOS environments.

Keywords: Covert channels in IP networks are investigated. The possibilities adversary needs to construct covert channels are given. Current methods of covert channels elimination, detection and capacity limitation are examined. Detection methods are compared using such criteria: alpha and beta errors, an ability of implementation.

Hill Cipher Encryption technique has a square matrix in its calculation. The ciphertext resulted is obtained from the matrix multiplication between plaintext and key. The reality is the sender must send or tell the receiver the key used to encrypt the data before the receiver can decode the ciphertext into the legible message. The listener is able to read the key that flows to the receiver. By knowing the key, the listener will absolutely break the ciphertext and turn into plaintext. Three-Pass Protocol is a way to limit the key being distributed. The sender and receiver have their own keys in hand. They do not need to share each other. This method will improve the security.

Encryption is essential in preventing unauthorized access to sensitive data in light of the growing concerns about data security in cloud computing. Homomorphic encryption promises to enable secure calculations on encrypted data without the need for decryption, particularly for cloud-based operations. To evaluate the effectiveness and applicability of several homomorphic encryption algorithms for safe cloud computing, we compare and contrast them in this research paper. Partially homomorphic encryption (PHE), somewhat homomorphic encryption (SHE), and fully homomorphic encryption (FHE) are the three basic homomorphic encryption subtypes that we examine. The implications of this study can aid cloud service providers and organizations in selecting the most appropriate homomorphic encryption scheme based on their specific security requirements and performance considerations. The research contributes to the ongoing efforts to enhance data privacy in cloud computing environments, opening new possibilities for secure data processing in an increasingly connected digital world. The exploration of homomorphic encryption schemes in this study opens new avenues for research and development in the field of cryptographic techniques. As technology continues to evolve, so too must our approaches to safeguarding data. This research serves as a catalyst for further innovations in homomorphic encryption algorithms, enabling even more efficient and robust methods for secure data processing in cloud environments and beyond. The insights derived from this research paper not only empower cloud service providers and organizations to make informed decisions about selecting the most appropriate homomorphic encryption scheme but also contribute to the broader mission of fortifying data privacy and security in cloud computing.

Some arguments more are presented to illustrate a need for careful security evaluation of the encryption algorithms for possible use in the wireless networks. Particularly, the security evaluation of a recently proposed fast encryption for multimedia FEA-M is presented. It is shown that the effective secret key size is much smaller than its nominal one, which is a very undesirable and potentially dangerous characteristic.

Big Data Analytics are said to help in transforming huge amounts of raw data towards valuable information that can be used, but there are formidable challenges in feature selection and classification due to the complexity and high dimensionality of the data. Traditional methods are usually too weak to handle the built-in uncertainty, imprecision, and inconsistency within big data and they often fail to perform well. This paper aims to induce the new methodology on these problems using the sets of neutrosophic in dealing with more flexible and nuanced data analysis. The key contributions to the current approach proposed are threefold. First, generalization of the classical set through extension of the notions of truth, indeterminacy, and falsity by allowing representations of uncertainty in data. The second combines a powerful process for selecting features based upon neutrosophic set theory that is optimal by genetic algorithms and advances a step further by applying these features in training and validating the classification models across a set of different domains. Therefore, the major aim from this study is to increase accuracy and reliability in feature selection and classification in big data analytics. This methodology has been implemented and tested over datasets of the following types: healthcare, finance, social media, and more. Results have proved great improvement against conventional performance metrics, for example, the classification accuracy with an SVM classifier over the Cleveland Heart Disease dataset increases from 83.5% to 87.2%, and of a Random Forest classifier over a financial dataset from 76.4% to 81.9%. For instance, the accuracy of social media sentiment analysis changed to 82.7% from 78.3%. All these findings establish that the neutrosophic set-based method holds good advantages in addressing the limitations of classical alternatives. The proposed approach of neutrosophism, through an explicit model, enhances performances in classifications and, at the same time, augments overall robustness and reliability in big data analytic. The importance of this study lies in establishing the groundwork for further research and practical applications, thus indicating possible further development in this field.

Traditional encryption allows encrypted data to be decrypted before any computation could be performed on such data. This approach could compromise the security of the data when an untrusted party is involved in the computation. To be able to work on data in its encrypted form, a homomorphic encryption approach is recommended. Homomorphic encryption allows computation to be done on data that has been encrypted and yields the same results that would have been obtained if the computation had been performed on the unencrypted form of the data. Most of the Homomorphic encryption (HE) algorithms are deterministic. These deterministic algorithms produce the same ciphertext for a given data on different occasions. This could allow an adversary to easily predict a plaintext from a ciphertext. Probabilistic algorithms, however, resolve the aforementioned challenge of deterministic algorithms. A probabilistic encryption algorithm ensures different ciphertexts for the same plaintext on different occasions. Another challenge of most homomorphic encryption schemes is the way data is encrypted. Most algorithms encrypt data bit-by-bit (i.e. circuitbased). Circuit-based encryption makes the encryption and decryption complex, thereby increasing the running time. To reduce the running time, Non-Circuit based encryption and decryption are preferred. Here, numeric data need not be converted to binary before any encryption is done. To ensure a very secure, efficient but simpler HE scheme, the authors have offered a fully homomorphic encryption (FHE) scheme that is Probabilistic, Non-Circuit based, and uses symmetric keys. Results from the experiment conducted show that the proposed scheme is faster than Fully Homomorphic Encryption over the Integer (DGHV), A simple Fully Homomorphic Encryption Scheme Available in Cloud Computing (SDC), and Fully Homomorphic Encryption by Prime Modular Operation (SAM) schemes. The proposed scheme has a time complexity of O(log(n 2)) and consumes less memory space. Even though HE schemes are naturally slow, the less memory space consumed by the proposed scheme and the time complexity of O (log(n 2)), makes the proposed scheme suitable for real-life implementation such as auction, electronic voting, and in other applications that make use of private data.

Progression in computing powers and parallelism technology are creating obstruction for credible security especially in electronic information swapping under cryptosystems. An enormous set of cryptographic schemes persist in which each has its own affirmative and feeble characteristics. Some schemes carry the use of long bits key and some support the use of small key. Practical cryptosystems are either symmetric or asymmetric in nature. In this painstaking gaze, the accurate selection of right encryption scheme matters for desired information swap to meet enhanced security objectives. This survey compares trendy encryption techniques for convinced selection of both key and cryptographic scheme. In addition, this study introduces two new encryption selection constrains (section 4.1) which are neglected in previous studies. Finally this comprehensive survey thrash outs the latest trends and research issues upon cryptographic elements to conclude forthcoming necessities related to cryptographic key, algorithm structure and enhanced privacy especially in transferring the multimedia information.

Приготовьтесь к очередному эпизоду "Кибербезопасности", в котором будут показаны наши любимые кибер-злодеи, и их громкие облачные выходки! На этот раз АНБ и ФБР объединились, чтобы рассказать захватывающую историю о том, что атакующим уже не интересны локальные сети и сервера, когда есть бескрайние просторы облачных сервисов.

Этот документ больше похож на практическое руководство для начинающих киберпреступников, чем на предупреждение. В нем подробно описывается хитроумная смена тактики, когда наглым образом воруются токенов от учётных записей, особенно неиспользуемых, но всё ещё активных, чтобы обойти разом все облачные механизмы защиты.

Если вы думали, что ваши данные в облаке будут в большей безопасности, подумайте ещё раз. А потом, обновите свои пароли, защитите свои учётные записи и, возможно, купите кибер-страховку, этот рынок кибер-продуктов популярнее ИБ-продуктов.

-------

В документе представлен всесторонний анализ публикации, в которой подробно описаны известные тактики, методы и процедуры (TTP), используемые кибер-профессионалами для получения первоначального доступа к облачным системам. Анализ охватывает различные аспекты, включая выявление и использование уязвимостей, различные методы использования облачных технологий, развёртывание специального вредоносного ПО.

Представлены ключевые моменты и полезная информация, которую могут использовать ИБ и ИТ специалисты и специалисты в различных отраслях для улучшения своих защитных стратегий, против спонсируемых государством киберугроз. Понимая адаптированную тактику субъекта для первоначального доступа к облаку, заинтересованные стороны могут лучше предвидеть и снижать потенциальные риски для своей облачной инфраструктуры, тем самым укрепляя свою общую безопасность.

HTTP merupakan protokol jaringan pada lapisan aplikasi TCP/IP yang digunakan untuk komunikasi atau pertukaran data antara server dengan client. Terdapat kelemahan pada protokol HTTP dimana pada pengiriman data atau informasi tidak terdapat proses pengamanan atau enkripsi yang dimana dapat membahayakan informasi atau data yang dikirim pada suatu jaringan. Pada tahun 2001 National Institute of Standard and Technology (NIST) mempublikasikan standar algoritme kriptografi terbaru yang digunakan untuk menggantikan algoritme DES yang sudah tidak efisien penggunaannya yaitu algoritme AES. Penelitian ini mengusulkan ide untuk memanfaatkan algoritme AES sebagai pengamanan pengiriman data sensor DHT11 menggunakan protokol HTTP. Pada penelitian ini menggunakan Arduino Uno sebagai mikrokontroler yang digunakan untuk mengolah data sensor DHT11 dan NI Labview untuk menampilkan keluaran dari sistem. HTTP server dan proses enkripsi diimplementasikan di Arduino IDE dan HTTP client dan proses deskrips...

Nowadays, due to the rapid development of the internet, it is prominent to guard mystery data from cyberpunks through communicating. The steganography technique utilizes for trading mystery data in an approach to stay away from doubt. This paper accomplishes a manner for encryption each channel of RGB color image separately without the necessity to exchange an encryption key utilizing the principle of modifying vernam scheme then camouflage it into a grayscale cover image .On the other hand, encrypts a grayscale image without the necessity to exchange an encryption key utilizing the principle of modifying vernam scheme then camouflage it into a cover image of RGB color type. The simulation results revealed an offering of extremely security for the image transmission.

The Internet is the essential wellspring of data in the present life where it offers the trade of data to the clients.The exchange of such data prompts an incredible security danger. Cryptography and steganography are two issues in security systems.Cryptography jumbles the message to be incomprehensible While Steganography shroud the message To be invisible. Therefore, Encryption any private data before concealing in the cover object will provide twofold security. This paper presents a technique for disguise message with four levels of security where the message first encrypt using modifying vernam cipher, in which the initial key originate automatically from random pixel of camouflage cover and alter continuously along message length then embedded cipher message in grayscale cover image, after that encrypt this cover using modifying vernam cipher also then embedded it in RGB color cover image. The simulation consequence illustrates that the scheme provides better protection.

Preserving confidentiality, integrity and authenticity of images is becoming very important. There are so many different encryption techniques to protect images from unauthorized access. Matrix multiplication can be successfully used to encrypt-decrypt digital images. In this paper we made a comparison study between two image encryption techniques based on matrix multiplication namely, segmentation and parallel methods.