Survey and analysis of security issues on RSA algorithm for digital video data

International data encryption algorithm (IDEA) is a secret key or symmetric key block cipher. The purpose of IDEA was to replace data encryption standard (DES) cipher, which became practically insecure due to its small key size of 56 bits and increase in computational power of systems. IDEA cipher mainly to provide data confidentiality in variety of applications such as commercial and financial application e.g. pretty good privacy (PGP) protocol. Till 2015, no successful linear or algebraic weaknesses IDEA of have been reported. In this paper, author explained IDEA cipher, its application in PGP and did a systematic survey of various attacks attempted on IDEA cipher. The best cryptanalysis result which applied to all keys could break IDEA up to 6 rounds out of 8.5 rounds of the full IDEA cipher1. But the attack requires 264 known plaintexts and 2126.8 operations for reduced round version. This attack is practically not feasible due to above mention mammoth data and time requirements. So IDEA cipher is still completely secure for practical usage. PGP v2.0 uses IDEA cipher in place of BassOmatic which was found to be insecure for providing data confidentiality.

Confidentiality and authentication are two main security goals in secure electronic mail (e-mail). Pretty good privacy (PGP) and secure/multipurpose internet mail extensions (S/MIME) are two famous secure e-mail solutions. Both PGP and S/MIME use digital envelope to provide message confidentiality and digital signature to provide message authentication. However, these methods have the following two weaknesses: 1) digital signature provides non-repudiation evidence of sender that is not desired in some e-mail applications and 2) efficiency is low, since these methods use two kinds of public key cryptographic primitives: public key encryption and digital signature. To overcome the above two weaknesses, we introduce a new concept called deniably authenticated encryption that can achieve confidentiality, integrity, and deniable authentication in a logical single step. We first propose a deniably authenticated encryption scheme and prove its security in the random oracle model. Then, we design a secure e-mail protocol using the proposed deniably authenticated encryption scheme. The deniable authentication property protects senders’ privacy.

Basic Security Concepts - Why is Computer and Network Security Important. Background and History. The Security Trinity. Information Security. Risk Assessment. Security Models. Basic Terminology. More Basic Terminology. Threats, Vulnerabilities and Attacks - Protocols. The OSI Reference Model. TCP/IP Protocol Suite. Useful Web Sites. Search Engines. Mailing Lists. Encryption, Digital Signatures and Certification - Cryptography. Stream Ciphers. Breaking Ciphers. Block Ciphers. Encryption. Public Key Cryptosystems. Message Integrity. Authentication. Digital Signatures. Competing Standards. Digital Certificates. Limitations of Digital Certificates. Certificate Authorities. Public Key Infrastructure. The Future. The Limitations of Encryption. Kerberos - How Kerberos Works. Kerberos- Limitations. Encryption on the WWW - The World Wide Web. Secure Sockets Layer (HTTPS). Secure HTTP (SHTTP). Microsoft's Internet Explorer. Viewing Digital Certificates with Internet Explorer. Viewing the Encryption Strength of IE5. Viewing Certification Authorities with IE5. Netscape Navigator. Viewing Digital Certificates with Navigator. Authenticode Certificates. E-Mail - E-Mail Issues. E-Mail Issues. Secure E-Mail Protocols. Web-Based E-Mail Services. Security of Stored Messages. Identity: Spoofing and Hiding. E-Mail as a weapon. E-Mail Policies. E-Mail Privacy. Auto-Responses. Operating System Security -- Passwords. Password Attacks. Onetime Passwords. Access Control. Data Redundancy. General Recommendations. Modems. Useful Tools. LAN Security - LAN Guidelines. Controlling End-User Access. Concurrent Logins. Available Disk Space. Restrictions to Location or Workstation. Time/Day Restrictions. Access to Directories and Trustee Rights. File Attributes. Other Privileges. Single Sign-On. Policy-Based Network Management. Honeypot Systems. Network Segmentation. Static IP Addresses vs. DHCP. Media and Protocols - Network Media. Plenum Cabling and Risers. WANs. Redundancy and Alternative Connections. Routers and SNMP - Router Issues. SNMP. Virtual Private Networks - Encryption on the Network. Node-to-Node Encryption. End-to-End Encryption. Where to Encrypt. Virtual Private Networks. PPTP. L2TP. IPSec. SOCKS. Firewalls - Firewalls Pros and Cons. Types of Firewalls. Packet Filters vs. Proxies. Firewall Configurations. Restricting Users' Access to the Internet. Firewall Products. Personal Firewalls. Biometrics - Identification and Authentication. Biometric Identification and Authentication. Biometric Identification Reliability. Backup Authentication. Environmental Conditions. User Acceptance. Security of the Biometric System. Interoperability. Costs vs. Savings. Policies and Procedures - Policies vs. Procedures. Information Security Policy Objectives. Developing Security Policies. Policy and Procedure Manuals. Policy Awareness & Education. Policy Enforcement. Policy Format. Security Policy Suggestions. Information Protection Team. Crisis Management Planning. Sources for Information Policies. Auditing and Intrusion Detection - What is an Audit. Operational Security Audits. System Security Auditing. Activity and Usage Auditing. Audit Mistakes. Deficiencies of Traditional Audit Techniques. Intrusion Detection. Intrusion Detection Systems. Host-Based Intrusion Detection Systems. Network-Based Intrusion Detection Systems. Knowledge-Based Intrusion Detection Systems. Statistical-Based Intrusion Detection Systems. Defense In-Depth Approach . Future Directions. Crisis Management Planning - Crisis Management. Disaster Recovery Planning. Computer Security Incident Response Plan. Browser Security - Cookie Files. Cache Files. Autocomplete.

Encryption and decryption are the two most important complex methods for achieving security in any type of smart devices and systems/machines through transport layer security protocol (TLS). The symmetric key algorithms are the significant method for encrypting and decrypting the data/information using block cipher or stream cipher which is used for TLS protocol. The primary symmetric key block cipher algorithm used in TLS is Advanced Encryption standard (AES) and it provides security based on the key bits used in AES operation. The TLS protocol provides confidentiality(C), integrity (I) and Authenticity (A) in a single pass communication that is Authentication Encryption and Authentication Data (AEAD) between web browser and web server. It uses well known TLS cipher suite AES-GCM (Galois Counter mode) which is commonly used in TLS1.2. Suppose AES-NI hardware acceleration is not available in smart devices like tablets it causes performance issues in smart devices using TLS 1.2 protocol. If the smart device does not possess AES-NI, it can use software for running AES-GCM but it takes a lot of time for encryption/decryption of information, ergo causing the battery performance in smart devices. The newer symmetric Stream cipher CHACHA20-POLY1305 provides AEAD for securing the communication in smart devices thus reducing the battery cycles which is used for TLS 1.3. The paper discusses the pros and cons of AES-GCM authentication encryption used in TLS 1.2.

Transport Layer Security (TLS) protocol aims to provide confidentiality and integrity of data across untrusted networks. TLS supports several encryption options, including the RC4 stream cipher. Recent years, there is a growing interest for the crypto researchers do cryptanalysis on RC4 algorithm, they provide a comprehensive view on the RC4 cryptanalysis. This paper presents a new method based on big data processing technique to analyze the security of RC4. We drive the powerful cluster to execute the analyzing program, which invokes the RC4 algorithm for producing the stream cipher derived from the inputted random key generated by locality-insensitive hash function with actually predictable number. With the manufactured stream cipher, the program inspects the statistical feature about the byte value distribution at each position and such feature among byte pairs. During the implementation, we parallelized our program such that it exploits the computational resources of the distributed computing system by using our own modified Mapreduce structure, then we can get the distribution derived from a huge amount of key.

Communication is the important part in any type of network for making it possible to transfer data from one node to another. Communication needs quality and security for better performance and for acceptance of users and client companies. Data integrity is quite an issue in security and to maintain that integrity we tend to improve as to provide the better encryption processes for security. In our proposed work, an innovative and practical authentication system using Diffie-Hellman and AMA (Anonymous Micro payments Authentication) are designed for micropayments in mobile data network. Through AMA the customer and the merchant can authenticate each other indirectly, at the same time the merchant doesn't know the customer's real identity. A customer can get fast micropayments not only from his local domain but also from a remote domain without increasing any burden on his mobile phone/smartcard. Diffie-Hellman Encryption Algorithm adds more security to the proposed work. Keywords: AMA, Authentication, Diffie-Helman, Provate key, Public key I. INTRODUCTION The entire field of network security is vast and in an evolutionary stage. The range of study encompasses a brief history dating back to internet's beginnings and the current development in network security. In order to understand the research being performed today, background knowledge of the internet, its vulnerabilities, attack methods through the internet, and security technology is important and therefore they are reviewed. Micropayments refer to low value financial transaction ranging from several pennies to a few dollars. At present, a large portion of electronic commerce occurring in the mobile data network belong to the category of micropayments, such as ringing tone download, news subscription, etc. Although the amount of each single transaction in micropayments is small, the number of users and transactions is large. A small percentage loss due to insecure transaction on fraud will be enlarged to a big sum. Thus, an important issue of micropayments is security. Many achievements on micropayment and its security are gained by researchers and cryptographers (3). All these can be classified into script-based, hashchain-based and macropayment-based categories. Millicent (4)(5), a scriptbased micropayment, introduces a kind of currency- scrip, which is digital money that is issued by a single vendor. It uses no public-key cryptography and is optimized for repeated micropayments to the same vendor. Its distributed approach allows a micropayment to be validated and double spending prevented without the overhead of contacting the broker online during purchase. Diffie-Hellman in SSL: Secure Sockets Layer (SSL) is a cryptographic protocol developed by Netscape in 1995. SSL V3.0 has since become the predominant method and defacto standard for securing information flow between web users and web servers. Diffie-Hellman in SSH: Secure Shell (SSH) is a protocol and program used to encrypt traffic between two computers. This is most commonly done as a secure replacement for tools like telnet, ftp and the Berkeley r commands (rlogin, rsh, etc,)

A key derivation function is a function that generate one or more arbitrary length of cryptographic keys from a private string together with some public information. The generated cryptographic key(s) from this key derivation function proposals are generally indistinguishable from random binary strings of the same length based on formal mathematically proof. To date, there are designed of key derivation function proposals using cryptographic primitives such as hash functions, block ciphers and stream ciphers. However, there are limited security analysis of side channel attacks for the key derivation function proposals. This paper is to investigate the timing side channel attacks towards these three types of cryptographic primitives based key derivation function. Key derivation functions based on stream ciphers and block ciphers are input-dependent execution, the experiment results have shown that both key derivation functions proposals are vulnerable against timing side channel.

The wide spread of using handheld devices offers an opportunity for mobile devices to be used as a universal payment method. However, some issues impede the widespread acceptance of mobile payment; for example: privacy protection, limited capability of mobile devices, and limited bandwidth of wireless networks. In ecommerce payment, Secure Socket Layer (SSL) protocol has been used to establish a secure channel between customers and merchants to secure the payment and the order information. SSL has some disadvantages regarding customer privacy that the customer payment information is revealed to the merchant. Secure Electronic Transaction (SET) has resolved SSL protocol disadvantages by dividing order message into: 1) order information which is revealed to merchant M, 2) payment information which is revealed to Payment Gateway (PG). Both SSL and SET assume the existence of Public Key Infrastructure (PKI) where extensive computations are carried out. In mobile payment, the same protocols of ecommerce payment are used but their application is limited due to heavy computations over wireless and GSM networks. A Modified Secure Electronic Transaction (MSET) protocol is proposed to minimize the extensive computations of SET protocol through replacing time consuming public key encryption and decryption algorithms by symmetric key cryptography.

Chosen plaintext attacks (CPA) pose a significant security risk to encryption algorithms. However, it can be difficult to perform such an attack without direct access to the encryption process. This paper introduces a new cryptoanalysis method that uses hidden CPA to analyze image encryption schemes based on substitution boxes (S-boxes) Unlike traditional CPA methods, the proposed algorithm does not require that they can directly into the encryption process. Instead, a hidden attack vector is embedded in the natural host image to reduce the risk of attack detection. By asking the owner of the encryption algorithm to encrypt this encryption image and provide a cipher image, the input vector can be compared with its encrypted counterpart This can have an effective S-box and break encryption the algorithm, which does not interact directly with the encryption process. Experimental results demonstrate that the proposed method can completely recover cipher images in cascading S-box encryption schemes, regardless of the number of S-boxes used. Additionally, it conceals the CPA vector within the host image imperceptibly, achieving a high PSNR of 49.47 dB, indicating minimal visual distortion. Furthermore, our CPA significantly outperforms existing techniques in speed, recovering a grayscale image in just 1.2 seconds. This method provides a simple yet effective cryptanalysis tool to evaluate the security of such image encryption schemes against CPAs.

The largely used of cyberspace has brought the attention of business interposes across the globe in modern era which resulted in numerous security issues. Business enterprises find it difficult to protect and manage resource sharing and data infrastructure effectively. The business enterprises consider Virtual private network (VPN) as a novel development to protect data and information, and to create a VPN connection, it is significant to consider the type of security protocols to use to make VPN more efficient and more powerful. The significant issue in this research is to study the performance of Secure Socket Layer (SSL) in VPN with intrusion detection systems (IDS) on Linux operating system in terms of Quality of Service (QoS) parameters (throughput, latency and packet loss). We also used two different encryption algorithms, Triple Data Encryption Standard (TDES/3DES) and Advance Encryption Standard (AES). Encryption algorithms are used to encrypt data, so it cannot be read or modify by a third-party while in transit between two end points of a network. This research found that when considering throughput, packet loss and latency in network infrastructures, SSL/3DES offers fair and reasonable performance than SSL/AES. VPN protocols with higher throughput have the best performance and VPN protocol the low packet loss has the best performance. The research indicated deploying SSL/3DES is more effective in business enterprises also indicated that IDS could be able to function effectively on both protected traffic packets (VPN packets) and server log files.

As a network security researcher, the author finds it very disappointing that most users can't, or simply don't, secure their Internet communications. For good reason, usability in security has received a fair deal of attention in the past few years. To push the issue further, the author decided to initiate his own informal case study on the usability and practical relevance of standard security mechanisms for email communication. The author focused my attention on available public-key cryptography techniques for digitally signing and encrypting email. His first step was to establish a public-private key pair to use with email. The author chose to use Secure/Multipurpose Internet Mail Extensions (S/MIME), a standard for signing and encrypting email, because it's already supported by popular email clients such as Apple Mail, Outlook Express, and Mozillas Thunderbird. Unlike S/MIME, the author found that pretty good privacy (PGP) and the GNU Privacy Guard (GPG) were unusable with nontechnical correspondents because it required them to install additional software. S/MIME, it seemed, was the better solution for these everyday users, for whom the concepts of public-key infrastructure (PKI), PGP, certificates, keys, and so on remain elusive. Additionally, I decided to get my public key certified by Thawte (www.thawte.com), an online certificate authority (CA)

In this article, we present a compact implementation of the Salsa20 stream cipher that is targeted towards lightweight cryptographic devices such as radio-frequency identification (RFID) tags. The Salsa20 stream cipher, ann addition-rotation-XOR (ARX) cipher, is used for high-security cryptography in NEON instruction sets embedded in ARM Cortex A8 CPU core-based tablets and smartphones. The existing literature shows that although classical cryptanalysis has been effective on reduced rounds of Salsa20, the stream cipher is immune to software side-channel attacks such as branch timing and cache timing attacks. To the best of our knowledge, this work is the first to perform hardware power analysis attacks, where we evaluate the resistance of all eight keywords in the proposed compact implementation of Salsa20. Our technique targets the three subrounds of the first round of the implemented Salsa20. The correlation power analysis (CPA) attack has an attack complexity of 2 19 . Based on extensive experiments on a compact implementation of Salsa20, we demonstrate that all these keywords can be recovered within 20,000 queries on Salsa20. The attacks show a varying resilience of the key words against CPA that has not yet been observed in any stream or block cipher in the present literature. This makes the architecture of this stream cipher interesting from the side-channel analysis perspective. Also, we propose a lightweight countermeasure that mitigates the leakage in the power traces as shown in the results of Welch’s t -test statistics. The hardware area overhead of the proposed countermeasure is only 14% and is designed with compact implementation in mind.

Boolean functions play a central role in the security of stream and block ciphers (in symmetric cryptography). They are functions mapping binary vectors of some length to either bits (in which case we have Boolean functions strictly speaking) or to binary vectors (of the same length or of another length, we are then speaking of vectorial Boolean functions). In the first case, they play roles in stream ciphers and in the second case, they are mainly used as substitution boxes in block ciphers. Being in each case the only nonlinear components of the ciphers, they are essential to their security. They are also the main components of the ciphers whose choice induces the speed. A tradeoff must then be found between the security and the speed of the cipher. The AES winner (used nowadays as a NIST standard for civil encryption, in particular between all banks) has been chosen because it allowed the best tradeoff. We shall describe what are the main results on them and what are the main open problems they pose currently.

This paper is concerned with the security level expected by the canonical form of the self-synchronizing stream cipher (SSSC). A SSSC can be viewed as the combination of a shift register together with a filtering function. The maximum security of such a cipher is reached when the filtering function is random. However, in practice, pseudo random functions are used as filtering functions. In this case, we show that the security against chosen ciphertext attacks (IND-CCA security) cannot be reached but it is however secure against chosen plaintext attacks (IND-CPA secure). To relax the condition of pseudo randomness, a new family of functions with a weaker property is introduced. A connection with the left-or-right indistinguishability is made. This property provides a necessary and sufficient condition to characterize the indistinguishablity of SSSC.

The security protocols used in ZigBee rely on an advanced encryption standard-counter mode (AES-CTR) algorithm to encrypt data before transmission. This algorithm is very robust, but it is time consuming. For some industrial and medical applications, it does not meet the real-time requirement. When the AES is used in counter mode CTR, it becomes like a stream cipher that aims to generate pseudorandom bits. Also, to encrypt data, the latter are combined with the plaintext using the XOR operation. New fast stream ciphers were proposed for the eStream project, but these ciphers have shown some weakness. On the other hand, ciphers based on chaotic functions seem to be more promising. Detailed analyses have shown that chaotic functions have very good cryptographic properties and can be used to construct high speed and strong stream ciphers. In this paper, a new robust and fast chaotic encryption algorithm RFCA is presented. This consists of a chaotic cipher composed of two perturbed maps piecewise linear chaotic map. This algorithm is, in particular, adequate for data encryption in ZigBee networks where robustness and real time are both essential. A comparison between our algorithm (RFCA) and the AES-CTR, the simplified AES, and the eStream finalist candidates, is presented with regard to speed and robustness. This is done using correlation coefficients, unified average changing intensity, number of pixels change rate, and test of randomness for the generated bit sequences using the National Institute of Standards and Technology statistical test suite.