nur shamma | Damascus Universty (original) (raw)
Papers by nur shamma
Journal of natural sciences, life and applied sciences, 2020
Throughout this research, we present generating the correct points on the Pythagorean circle disc... more Throughout this research, we present generating the correct points on the Pythagorean circle discussing the different cases of the radius that is defined by the following equation: Where: are different prime Pythagorean numbers. This research is going to create the fundamental points which generate the correct points in the circle. Besides, I am going to calculate the number of the correct points on the circumference of a circle in every different form of the equation (1) via the following: - Depending on the laws and theorems resulted from this research. - Depending on the computer program (C #) to yield fast and effective results. We conclude by saying: We should take into account that the aim of this study is to pinpoint the nature and the number of the correct points on the circumference of a Pythagorean circle. As a result, we can exploit these points to decipher the data when they are transferred between users via unsecured nets. The current applied mechanism is to use ellip...
Journal of Cyber Security and Mobility
Network security and related issues have been discussed thoroughly in this paper, especially at t... more Network security and related issues have been discussed thoroughly in this paper, especially at transport layer security network protocol, which concern with confidentiality, integrity, availability, authentication, and accountability. To mitigate and defeat Man-in-the-middle-attacks, we have proposed a new model which consists of sender and receiver systems and utilizes a combination of blowfish (BF) and Advanced Encryption Standard (AES) algorithms, symmetric key agreement to distribute public keys, Elliptic Curve Cryptography (ECC) to create secret key, and then Diffe Hellman (DH) for key exchange. Both SHA-256 hashing and Elliptic Curve Digital Signature Algorithm (ECDSA) have been applied for integrity, and authentication, respectively.
Journal of Natural Sciences and …, 2009
The paper deals with a simplest method to determine a relatively prime number n and itssymmetric ... more The paper deals with a simplest method to determine a relatively prime number n and itssymmetric product in the finite ring (Zn,+,.). This method is comparatively different from the wellknown one given by Euler's function. We may present a knew algorithm to find out ...
Journal of Cyber Security and Mobility
Network security and related issues have been discussed thoroughly in this paper, especially at t... more Network security and related issues have been discussed thoroughly in this paper, especially at transport layer security network protocol, which concern with confidentiality, integrity, availability, authentication, and accountability. To mitigate and defeat Man-in-the-middle-attacks, we have proposed a new model which consists of sender and receiver systems and utilizes a combination of blowfish (BF) and Advanced Encryption Standard (AES) algorithms, symmetric key agreement to distribute public keys, Elliptic Curve Cryptography (ECC) to create secret key, and then Diffe Hellman (DH) for key exchange. Both SHA-256 hashing and Elliptic Curve Digital Signature Algorithm (ECDSA) have been applied for integrity, and authentication, respectively.
Journal of Natural Sciences and …, 2009
The paper deals with a simplest method to determine a relatively prime number n and itssymmetric ... more The paper deals with a simplest method to determine a relatively prime number n and itssymmetric product in the finite ring (Zn,+,.). This method is comparatively different from the wellknown one given by Euler's function. We may present a knew algorithm to find out ...
This paper presents the use of finite matrixes to encrypt messages encoded ASCII system , depende... more This paper presents the use of finite matrixes to encrypt messages encoded
ASCII system , dependent on the method you (Hill cipher) 1929 through :
1 . Using finite matrixes to divide the text to partial matrixes .
2 . Depending on encoding ASCII (ASCII Coding) .
3 . Using the matrices A, X,B have special conditions to make Hill
function ( f (X) (A.X B)mod(n) ) able to encrypt the text P that it was in
the matrix. This matrix contains partial matrixes to get encryption
messages with different keys to make it difficult to break , and save the
security of information in the texts .
4 . Method can be applied on the computer to give quick results and great.
Key words:
Hill ciphers, ASCII Coding , Finite Matrixes Method (FMM) , Plaintext ,
Cipher text , Encryption Key.
التشفير العربي المطوَّر " التعمية المطوَّرة "
Abstract This paper deals with new Results that benefit the transformation and process and the co... more Abstract
This paper deals with new Results that benefit the transformation and process and the conversion from a numerical system to another without using the previously well-known rules like progressive division on the system basis or through the number expansion according to the new system basis [6]. In our work we depend on a new pattern in the transformation process According to well-known numbers [2] and [4] used in computing systems in the forms ,and linear transformation and Algebraic Complement
Abstract In this paper we define the partition of graph and introduce some of Eulerian graph prop... more Abstract
In this paper we define the partition of graph and introduce some of Eulerian graph properties through Adjacency and Degree matrices. We prove that each Eulerian graph such as G = (n, m) can be divided into s = (n - 1)/2 isomorphic Eulerian subgraphs and we conclude that the sufficient condition for a graph to be non-Eulerian is that the determinant of its adjacency matrix is an odd integer. We also put an effective algorithm to find all edge-disjoint cycles in any Eulerian graph.
Abstract: This paper advances theorems and results that benefit the transformation and process an... more Abstract:
This paper advances theorems and results that benefit the transformation and process and the conversion from a numerical system to another without using the previously well-known rules like progressive division on the system basis or through the number expansion according to the new system basis [1]. In our work we depend on a new pattern in the transformation process depending on well-known numbers [3] and [6] used in computing systems in the forms
After that, we transform it to the binary system depending on and then it will be easily transformed to the octal and hexadecimal systems.
Keywords:
Numerical systems, decimal systems, binary system, octal systems and hexadecimal system
Abstract: In this paper, we try to introduce a modern method about the cryptology(Hill ciphers).... more Abstract: In this paper, we try to introduce a modern method about the cryptology(Hill ciphers).
Our method is based on :
- Coded ASCII used in current computers.
- Using of a linear function ( ) such that and are a specified matrixes .
- Its application by using computers to provide effective results[4].
Keywords: Cryptology Hill, ASCII system , Plaintext , Ciphertext
The paper deals with a simplest method to determine a relatively prime number n and its symmetric... more The paper deals with a simplest method to determine a relatively prime number n and its symmetric product in the finite ring (Zn ,+, .). This method is comparatively different from the well known one given by Euler's function. We may present a knew algorithm to find out the prime number with its symmetric product and its number.
Journal of natural sciences, life and applied sciences, 2020
Throughout this research, we present generating the correct points on the Pythagorean circle disc... more Throughout this research, we present generating the correct points on the Pythagorean circle discussing the different cases of the radius that is defined by the following equation: Where: are different prime Pythagorean numbers. This research is going to create the fundamental points which generate the correct points in the circle. Besides, I am going to calculate the number of the correct points on the circumference of a circle in every different form of the equation (1) via the following: - Depending on the laws and theorems resulted from this research. - Depending on the computer program (C #) to yield fast and effective results. We conclude by saying: We should take into account that the aim of this study is to pinpoint the nature and the number of the correct points on the circumference of a Pythagorean circle. As a result, we can exploit these points to decipher the data when they are transferred between users via unsecured nets. The current applied mechanism is to use ellip...
Journal of Cyber Security and Mobility
Network security and related issues have been discussed thoroughly in this paper, especially at t... more Network security and related issues have been discussed thoroughly in this paper, especially at transport layer security network protocol, which concern with confidentiality, integrity, availability, authentication, and accountability. To mitigate and defeat Man-in-the-middle-attacks, we have proposed a new model which consists of sender and receiver systems and utilizes a combination of blowfish (BF) and Advanced Encryption Standard (AES) algorithms, symmetric key agreement to distribute public keys, Elliptic Curve Cryptography (ECC) to create secret key, and then Diffe Hellman (DH) for key exchange. Both SHA-256 hashing and Elliptic Curve Digital Signature Algorithm (ECDSA) have been applied for integrity, and authentication, respectively.
Journal of Natural Sciences and …, 2009
The paper deals with a simplest method to determine a relatively prime number n and itssymmetric ... more The paper deals with a simplest method to determine a relatively prime number n and itssymmetric product in the finite ring (Zn,+,.). This method is comparatively different from the wellknown one given by Euler's function. We may present a knew algorithm to find out ...
Journal of Cyber Security and Mobility
Network security and related issues have been discussed thoroughly in this paper, especially at t... more Network security and related issues have been discussed thoroughly in this paper, especially at transport layer security network protocol, which concern with confidentiality, integrity, availability, authentication, and accountability. To mitigate and defeat Man-in-the-middle-attacks, we have proposed a new model which consists of sender and receiver systems and utilizes a combination of blowfish (BF) and Advanced Encryption Standard (AES) algorithms, symmetric key agreement to distribute public keys, Elliptic Curve Cryptography (ECC) to create secret key, and then Diffe Hellman (DH) for key exchange. Both SHA-256 hashing and Elliptic Curve Digital Signature Algorithm (ECDSA) have been applied for integrity, and authentication, respectively.
Journal of Natural Sciences and …, 2009
The paper deals with a simplest method to determine a relatively prime number n and itssymmetric ... more The paper deals with a simplest method to determine a relatively prime number n and itssymmetric product in the finite ring (Zn,+,.). This method is comparatively different from the wellknown one given by Euler's function. We may present a knew algorithm to find out ...
This paper presents the use of finite matrixes to encrypt messages encoded ASCII system , depende... more This paper presents the use of finite matrixes to encrypt messages encoded
ASCII system , dependent on the method you (Hill cipher) 1929 through :
1 . Using finite matrixes to divide the text to partial matrixes .
2 . Depending on encoding ASCII (ASCII Coding) .
3 . Using the matrices A, X,B have special conditions to make Hill
function ( f (X) (A.X B)mod(n) ) able to encrypt the text P that it was in
the matrix. This matrix contains partial matrixes to get encryption
messages with different keys to make it difficult to break , and save the
security of information in the texts .
4 . Method can be applied on the computer to give quick results and great.
Key words:
Hill ciphers, ASCII Coding , Finite Matrixes Method (FMM) , Plaintext ,
Cipher text , Encryption Key.
التشفير العربي المطوَّر " التعمية المطوَّرة "
Abstract This paper deals with new Results that benefit the transformation and process and the co... more Abstract
This paper deals with new Results that benefit the transformation and process and the conversion from a numerical system to another without using the previously well-known rules like progressive division on the system basis or through the number expansion according to the new system basis [6]. In our work we depend on a new pattern in the transformation process According to well-known numbers [2] and [4] used in computing systems in the forms ,and linear transformation and Algebraic Complement
Abstract In this paper we define the partition of graph and introduce some of Eulerian graph prop... more Abstract
In this paper we define the partition of graph and introduce some of Eulerian graph properties through Adjacency and Degree matrices. We prove that each Eulerian graph such as G = (n, m) can be divided into s = (n - 1)/2 isomorphic Eulerian subgraphs and we conclude that the sufficient condition for a graph to be non-Eulerian is that the determinant of its adjacency matrix is an odd integer. We also put an effective algorithm to find all edge-disjoint cycles in any Eulerian graph.
Abstract: This paper advances theorems and results that benefit the transformation and process an... more Abstract:
This paper advances theorems and results that benefit the transformation and process and the conversion from a numerical system to another without using the previously well-known rules like progressive division on the system basis or through the number expansion according to the new system basis [1]. In our work we depend on a new pattern in the transformation process depending on well-known numbers [3] and [6] used in computing systems in the forms
After that, we transform it to the binary system depending on and then it will be easily transformed to the octal and hexadecimal systems.
Keywords:
Numerical systems, decimal systems, binary system, octal systems and hexadecimal system
Abstract: In this paper, we try to introduce a modern method about the cryptology(Hill ciphers).... more Abstract: In this paper, we try to introduce a modern method about the cryptology(Hill ciphers).
Our method is based on :
- Coded ASCII used in current computers.
- Using of a linear function ( ) such that and are a specified matrixes .
- Its application by using computers to provide effective results[4].
Keywords: Cryptology Hill, ASCII system , Plaintext , Ciphertext
The paper deals with a simplest method to determine a relatively prime number n and its symmetric... more The paper deals with a simplest method to determine a relatively prime number n and its symmetric product in the finite ring (Zn ,+, .). This method is comparatively different from the well known one given by Euler's function. We may present a knew algorithm to find out the prime number with its symmetric product and its number.