scholarly journals HASH Algorithm of Weighted Probability Model

Author(s):  
Jielin Wang

<p>In this paper, a brand-new hash algorithm is provided. The length of the hash value can be customized. It is theoretically proved that the hash collision limit can be reached. The algorithm can be applied flexibly, and it can be applied to digital signatures, document verification and other fields in the future.</p>

2021 ◽  
Author(s):  
Jielin Wang

<p>In this paper, a brand-new hash algorithm is provided. The length of the hash value can be customized. It is theoretically proved that the hash collision limit can be reached. The algorithm can be applied flexibly, and it can be applied to digital signatures, document verification and other fields in the future.</p>


1978 ◽  
Vol 6 (1) ◽  
pp. 141-146
Author(s):  
John F. Flaherty ◽  
Sidney J. Arenson

Males and females participated in a coalition formation procedure by interacting with a computer program that simulated a pachisi game situation. All players occupied position A in the triad, where A > B > C and A < (B + C). The female partner preference data supported a weighted probability model of coalition formation over a bargaining theory. The male partner preference data did not support either theory. Females tended to prefer player B and present a lower initial bargaining demand than males. Three of the six factors of the Shure and Meeker personality and attitude schedule which were related to players' initial bargaining demands were authoritarian nationalism, suspiciousness, and risk avoidance. Males and females differed significantly on these same three Shure and Meeker factors.


Author(s):  
Muhammad Asghar Nazal ◽  
Reza Pulungan ◽  
Mardhani Riasetiawan

Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect. One of the developments made by the G-Connect project is about data security; most of the problems verification of the data sent. In previous studies, Keccak and RSA algorithms have implemented for data verification needs. But after a literature study of other algorithms that can make digital signatures, we found what is meant by an algorithm that is better than RSA in rectangular speeds, namely Digital Signature Algorithm (DSA).DSA is one of the key algorithms used for digital signatures, but because DSA still uses Secure Hash Algorithm (SHA-1) as an algorithm for hashes, DSA rarely used for data security purposes, so Keccak is used instead of the hash algorithm on DSA. Now, Keccak become the standard for the new SHA-3 hash function algorithm. Because of the above problems, the focus of this research is about data verification using Keccak and DSA. The results of the research are proven that Keccak can run on DSA work system, obtained a comparison of execution time process between DSA and RSA where both use Keccak.


Author(s):  
Taufan Abdurrachman ◽  
Bernard Renaldy Suteja

Currently, Indonesian government is changing the government system into an Sistem Pemerintahan Berbasis Elektronik (SPBE) or often heard as e-government. With this change in the government system, it has an impact on various sector of life. One of many sectors is construction service sector. LPJK as a non-structural institution under Ministry of Public Works and Public Housing issued a letter to the construction services association regarding the development of integrated application with SIKI LPJK. LPJK and OSS institutions has implemented digital signatures on business entity licensing document. Construction service associations has responded to develop of these regulations by creating an association information system application that implements digital signatures. This research was conducted to apply an digital signatures to the validation of the Membership Card using the secure hash algorithm (SHA) and advanced encryption standard (AES) methods generated through the association information system. This application generates an digital signatures which is implemented with QR Code. The existence of this application is expected to be a form of support for the government which is making changes to the government system.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 137 ◽  
Author(s):  
Sahib Khan ◽  
Khalil Khan ◽  
Farman Ali ◽  
Kyung-Sup Kwak

In this paper, we present a new technique of image forgery detection. The proposed technique uses digital signatures embedded in the least significant bits of the selected pixels of each row and column. The process maintains a symmetry in the use of pixels for computing and hiding the digital signatures. Each row and column of the image symmetrically contributes to both processes, with the number of pixels per row or column used for computing the signature, and the pixels used for embedding are not equal and are asymmetric. The pixels in each row and column of an image are divided into two groups. One group contains pixels of a row or column used in the calculation of digital signatures, and the second group of pixels is used for embedding the digital signatures of the respective row or column. The digital signatures are computed using the hash algorithm, e.g., message digest five (MD5). The least significant bits substitution technique is used for embedding the computed digital signature in the least significant bits of the selected pixels of the corresponding row or column. The proposed technique can successfully detect the modification made in an image. The technique detects pixel level modification in a single or multiple pixels.


2021 ◽  
Author(s):  
Jielin Wang

<p>In this paper a brand new channel error detection and correction method is provided. Artificially adding symbols to the source binary sequence makes the binary sequence present a regularity. The receiver can use this rule to implement error detection and correction. Since many redundant symbols are added, a weighted probability model lossless coding method is proposed in this paper to remove redundant information, and the reasons why Markov chains and conditional probabilities are not feasible are given. It is proven that the method in this paper can reach the channel capacity when the code length approaches infinity. It is shown experimentally that when the code rate is 1/2 in the BIAWGN channel, the method in this paper is superior to the polar code and LDPC code.</p>


2021 ◽  
Author(s):  
Jielin Wang

<p>In this paper a brand new channel error detection and correction method is provided. Artificially adding symbols to the source binary sequence makes the binary sequence present a regularity. The receiver can use this rule to implement error detection and correction. Since many redundant symbols are added, a weighted probability model lossless coding method is proposed in this paper to remove redundant information, and the reasons why Markov chains and conditional probabilities are not feasible are given. It is proven that the method in this paper can reach the channel capacity when the code length approaches infinity. It is shown experimentally that when the code rate is 1/2 in the BIAWGN channel, the method in this paper is superior to the polar code and LDPC code.</p>


Sign in / Sign up

Export Citation Format

Share Document