The Experts below are selected from a list of 135 Experts worldwide ranked by ideXlab platform

Sukant Kumar Bishi - One of the best experts on this subject based on the ideXlab platform.

  • A secured Cryptographic Hashing Algorithm
    arXiv: Cryptography and Security, 2010
    Co-Authors: Rakesh Mohanty, N. Sarangi, Sukant Kumar Bishi
    Abstract:

    Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented t using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a Bitwise Operator. This process is terated for the whole message and finally a fixed length message digest is obtained.

Bishi, Sukant Kumar - One of the best experts on this subject based on the ideXlab platform.

  • A secured Cryptographic Hashing Algorithm
    2010
    Co-Authors: Mohanty Rakesh, Sarangi Niharjyoti, Bishi, Sukant Kumar
    Abstract:

    Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented t using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a Bitwise Operator. This process is terated for the whole message and finally a fixed length message digest is obtained.Comment: 4 pages,2 figures, 1 tabular data se

Mayank Dubey - One of the best experts on this subject based on the ideXlab platform.

  • UDP LITE: Efficient model for video transmission by UDP lite protocol
    2016 International Conference on Advanced Communication Control and Computing Technologies (ICACCCT), 2016
    Co-Authors: Awadhesh Kumar Shukla, Gagandeep Singh Kahlon, Mayank Dubey
    Abstract:

    This research work addresses issues of video trans-smission and presented a model that is used for transmission of video with the help of UDP Lite protocol. Before transmission of video, we are compressing the video by Bitwise Operator. This model is work for MJPEG format. The basic idea of this proposed model is that firstly we select the file which is in the form of video. Generally, in the computer network all the data is in the form of packets or 0s or1s. These packets are then compressed using Bitwise Operator. After compressing the packets, we will use the transport protocol that is UDP Lite Protocol. In the UDP Lite protocol checksum is used for reducing the packet loss and in this model we use a program which is called an Error Trace Program by which we can know if there is any loss of packet. Generally, we can increase the number of packets in an individual block by doing compression but only disadvantage is that some of the packets are lost. Nowadays a number of audios, videos, images files are increasing continuously on internet. During transmission of these files, sometimes bits are losses by many reasons and quality of data is reduced [1], [2]. So, this work improves the quality of data and increase the performance during transmission of data by managing the packets.

Rakesh Mohanty - One of the best experts on this subject based on the ideXlab platform.

  • A secured Cryptographic Hashing Algorithm
    arXiv: Cryptography and Security, 2010
    Co-Authors: Rakesh Mohanty, N. Sarangi, Sukant Kumar Bishi
    Abstract:

    Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented t using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a Bitwise Operator. This process is terated for the whole message and finally a fixed length message digest is obtained.

Mohanty Rakesh - One of the best experts on this subject based on the ideXlab platform.

  • A secured Cryptographic Hashing Algorithm
    2010
    Co-Authors: Mohanty Rakesh, Sarangi Niharjyoti, Bishi, Sukant Kumar
    Abstract:

    Cryptographic hash functions for calculating the message digest of a message has been in practical use as an effective measure to maintain message integrity since a few decades. This message digest is unique, irreversible and avoids all types of collisions for any given input string. The message digest calculated from this algorithm is propagated in the communication medium along with the original message from the sender side and on the receiver side integrity of the message can be verified by recalculating the message digest of the received message and comparing the two digest values. In this paper we have designed and developed a new algorithm for calculating the message digest of any message and implemented t using a high level programming language. An experimental analysis and comparison with the existing MD5 hashing algorithm, which is predominantly being used as a cryptographic hashing tool, shows this algorithm to provide more randomness and greater strength from intrusion attacks. In this algorithm the plaintext message string is converted into binary string and fragmented into blocks of 128 bits after being padded with user defined padding bits. Then using a pseudo random number generator a key is generated for each block and operated with the respective block by a Bitwise Operator. This process is terated for the whole message and finally a fixed length message digest is obtained.Comment: 4 pages,2 figures, 1 tabular data se