ijcisjournal

DYNAMIC VALIDITY PERIOD CALCULATION OF DIGITAL CERTIFICATES BASED ON AGGREGATED SECURITY ASSESSMENT  Alexander Beck, Jens Graupmann, Frank Ortmeier Computer Systems in Engineering, Otto-von-Guericke-University, Magdeburg, Germany  ABSTRACT  The paper proposes a method based on different security-related factors to dynamically calculate the validity period of digital certificates. Currently validity periods are most often defined statically without scientific justification. This approach is not sufficient to objectively consider the actual need for security. Therefore the approach proposed in this paper considers relevant security criteria in order to calculate a meaningful validity period for digital certificates. This kind of security assessment can be executed periodically in order to dynamically respond to changing conditions. Especially in the context of complex systems and infrastructures that have an increased need for security, privacy and availab...

NEW DIGITAL SIGNATURE PROTOCOL BASED ON ELLIPTIC CURVES  Ounasser Abid , Jaouad Ettanfouhi and Omar Khadir Laboratory of Mathematics, Cryptography and Mechanics, Department of Mathematics, Fstm , University of Hassan II Mohammedia-Casablanca, Morocco ABSTRACT  In this work, a new digital signature based on elliptic curves is presented. We established its efficiency and security. The method, derived from a variant of ElGamal signature scheme, can be seen as a secure alternative protocol if known systems are completely broken.  KEYWORDS  Public key cryptography, Digital signature, ElGamal signature scheme, Elliptic curves, Discrete logarithm problem. SOURCE URL https://wireilla.com/papers/ijcis/V2N4/2412ijcis02.pdf VOLUME LINK https://wireilla.com/ijcis/vol2.html

ON THE CRYPTOGRAPHIC MEASURES AND CHAOTIC DYNAMICAL COMPLEXITY MEASURES 1 Hanping Hu, 2 LingFeng Liu 1, 2 Institute of Pattern Recognition & Artificial Intelligence, Huazhong University of Science &Technology, Wuhan, PRC ABSTRACT The relationship between cryptographic measures and chaotic dynamical complexity measures is studied in this paper, including linear complexity and measure entropy, nonlinear complexity and source entropy. Moreover, a method is presented to guarantee the complexity of chaos-based pseudorandom sequence due to this relationship. This is important to the development of chaos-based cryptography. KEYWORDS Chaos-based cryptogr aphy, Cryptographic measures, Linear complexity, Nonlinear complexity, Chaotic dynamical complexity measures, Measure entropy, Source entropy SOURCE URL https://wireilla.com/papers/ijcis/V2N4/2412ijcis03.pdf VOLUME LINK https://wireilla.com/ijcis/vol2.html

RECTIFIED DIFFERENTIAL CRYPTANALYSIS OF 16 ROUND PRESENT Manoj Kumar , Pratibha Yadav, Meena Kumari  SAG, DRDO, Metcalfe House, Delhi-110054, India  ABSTRACT  In this paper, we have suggested rectifications in differential cryptanalysis of ultra-lightweight block cipher PRESENT reduced to 16 rounds. We have shown that proposed differential attack by Wang [3] on 16 round PRESENT can recover at the most 30 subkey bits, although the author has claimed to recover 32 bits of subkey for last two rounds. We have also computed data complexity and success probability for recovering 30 subkey bits accordingly by the differential attack on 16 round PRESENT.  KEYWORDS  Lightweight block cipher, differential cryptanalysis, PRESENT SOURCE URL https://wireilla.com/papers/ijcis/V2N4/2412ijcis04.pdf VOLUME LINK https://wireilla.com/ijcis/vol2.html

COMPACT CODING USING MULTI-PHOTON TOLERANT QUANTUM PROTOCOLS FOR QUANTUM COMMUNICATION  Rasha El Hajj, Pramode Verma and Kam Wai Clifford Chan  Telecommunications Engineering Program, School of Electrical and Computer Engineering, University of Oklahoma-Tulsa, USA  ABSTRACT This paper presents a new encryption scheme called Compact Coding that encodes information in time, phase, and intensity domains, simultaneously. While these approaches have previously been used one at a time, the proposed scheme brings to bear for the first time their strengths simultaneously leading to an increase in the secure information transfer rate. The proposed scheme is applicable to both optical fibers and free space optics, and can be considered as an alternative to polarization coding. This paper applies the proposed compact coding scheme to multi-photon tolerant quantum protocols in order to produce quantum-level security during information transfer. We present the struct...

HIGH CAPACITY IMAGE STEGANOGRAPHY USING ADJUNCTIVE NUMERICAL REPRESENTATIONS WITH MULTIPLE BIT-PLANE DECOMPOSITION METHOD James Collins and Sos Agaian  Department of Electrical and Computer Engineering The University of Texas at San Antonio, San Antonio, Texas, USA ABSTRACT LSB steganography is a one of the most widely used methods for implementing covert data channels in image file exchanges [1][2]. The low computational complexity and implementation simplicity of the algorithm are significant factors for its popularity with the primary reason being low image distortion. Many attempts have been made to increase the embedding capacity of LSB algorithms by expanding into the second or third binary layers of the image while maintaining a low probability of detection with minimal distortive effects [2][3][4]. In this paper, we introduce an advanced technique for covertly embedding data within images using redundant number system decomposition over non-standard digita...