The Experts below are selected from a list of 19632 Experts worldwide ranked by ideXlab platform
Ma Xiu-feng - One of the best experts on this subject based on the ideXlab platform.
-
Research of Differential Timing Attack on RSA Public-key Cryptographic Algorithm
Computer Engineering, 2011Co-Authors: Ma Xiu-fengAbstract:The time of modular exponentiation is not constant when RSA Cryptographic Algorithm is executed,so carefully measuring the information about different time to decrypt can deduce the secret key.This paper researches the implementation of RSA public-key Cryptographic Algorithm and the principle of the timing attack,analyzes the process of RSA decryption,discovers the vulnerabilities of RSA on timing attack,presents the Algorithm of differential timing attack on RSA using from left to right "square-multiply" modular exponentiation,and discusses how to defense timing attack on RSA.
Shu Hui - One of the best experts on this subject based on the ideXlab platform.
-
Cryptographic Algorithm Recognition Based on Dynamic Binary Analysis
Computer Engineering, 2012Co-Authors: Shu HuiAbstract:For the Cryptographic Algorithm recognition problem in the current network security,this paper puts forward a method of cryptogram Algorithm recognition based on dynamic binary analysis.It uses DynamoRIO platform to record data flow information during the execution of the program dynamically,and uses some technologies comprehensively to recognize Cryptographic Algorithm,such as filtering and classification based on statistical features,signature matching based on constant characteristics of Cryptographic Algorithms and parameter identification based on data flow analysis technology.Test result shows that it can identify and locate the Cryptographic Algorithm in application quickly and accurately.
Nijad Alnajdawi - One of the best experts on this subject based on the ideXlab platform.
-
image Cryptographic Algorithm based on the haar wavelet transform
Information Sciences, 2014Co-Authors: Sara Tedmori, Nijad AlnajdawiAbstract:Lossless encryption methods are more applicable than lossy encryption methods when marginal distortion is not tolerable. In this research, the authors propose a novel lossless symmetric key encryption/decryption technique. In the proposed Algorithm, the image is transformed into the frequency domain using the Haar wavelet transform, then the image sub-bands are encrypted in a such way that guarantees a secure, reliable, and an unbreakable form. The encryption involves scattering the distinguishable frequency data in the image using a reversible weighting factor amongst the rest of the frequencies. The Algorithm is designed to shuffle and reverse the sign of each frequency in the transformed image before the image frequencies are transformed back to the pixel domain. The results show a total deviation in pixel values between the original and encrypted image. The decryption Algorithm reverses the encryption process and restores the image to its original form. The proposed Algorithm is evaluated using standard security and statistical methods; results show that the proposed work is resistant to most known attacks and more secure than other Algorithms in the cryptography domain.
Sara Tedmori - One of the best experts on this subject based on the ideXlab platform.
-
image Cryptographic Algorithm based on the haar wavelet transform
Information Sciences, 2014Co-Authors: Sara Tedmori, Nijad AlnajdawiAbstract:Lossless encryption methods are more applicable than lossy encryption methods when marginal distortion is not tolerable. In this research, the authors propose a novel lossless symmetric key encryption/decryption technique. In the proposed Algorithm, the image is transformed into the frequency domain using the Haar wavelet transform, then the image sub-bands are encrypted in a such way that guarantees a secure, reliable, and an unbreakable form. The encryption involves scattering the distinguishable frequency data in the image using a reversible weighting factor amongst the rest of the frequencies. The Algorithm is designed to shuffle and reverse the sign of each frequency in the transformed image before the image frequencies are transformed back to the pixel domain. The results show a total deviation in pixel values between the original and encrypted image. The decryption Algorithm reverses the encryption process and restores the image to its original form. The proposed Algorithm is evaluated using standard security and statistical methods; results show that the proposed work is resistant to most known attacks and more secure than other Algorithms in the cryptography domain.
Raghu N Kacker - One of the best experts on this subject based on the ideXlab platform.
-
knowledge extraction for Cryptographic Algorithm validation test vectors by means of combinatorial coverage measurement
International Cross-Domain Conference for Machine Learning and Knowledge Extraction (CD-MAKE); August 26-29 2019; Canterbury UK, 2019Co-Authors: Dimitris E Simos, Bernhard Garn, Ludwig Kampel, Richard D Kuhn, Raghu N KackerAbstract:We present a combinatorial coverage measurement analysis for test vectors provided by the NIST Cryptographic Algorithm Validation Program (CAVP), and in particular for test vectors targeting the AES block ciphers for different key sizes and Cryptographic modes of operation. These test vectors are measured and analyzed using a combinatorial approach, which was made feasible via developing the necessary input models. The extracted model from the test data in combination with combinatorial coverage measurements allows to extract information about the structure of the test vectors. Our analysis shows that some test sets do not achieve full combinatorial coverage. It is further discussed, how this retrieved knowledge could be used as a means of test quality analysis, by incorporating residual risk estimation techniques based on combinatorial methods, in order to assist the overall validation testing procedure.
-
CD-MAKE - Knowledge Extraction for Cryptographic Algorithm Validation Test Vectors by Means of Combinatorial Coverage Measurement
Lecture Notes in Computer Science, 2019Co-Authors: Dimitris E Simos, Bernhard Garn, Ludwig Kampel, D. Richard Kuhn, Raghu N KackerAbstract:We present a combinatorial coverage measurement analysis for test vectors provided by the NIST Cryptographic Algorithm Validation Program (CAVP), and in particular for test vectors targeting the AES block ciphers for different key sizes and Cryptographic modes of operation. These test vectors are measured and analyzed using a combinatorial approach, which was made feasible via developing the necessary input models. The extracted model from the test data in combination with combinatorial coverage measurements allows to extract information about the structure of the test vectors. Our analysis shows that some test sets do not achieve full combinatorial coverage. It is further discussed, how this retrieved knowledge could be used as a means of test quality analysis, by incorporating residual risk estimation techniques based on combinatorial methods, in order to assist the overall validation testing procedure.