Filters








25,004 Hits in 4.4 sec

Design of Hash Algorithm Using Latin Square

Rajib Ghosh, Suyash Verma, Rahul Kumar, Sanoj Kumar, Siya Ram
2015 Procedia Computer Science  
In this paper, we have proposed a new and an efficient cryptographic hash function based on random Latin squares generated through padding, shift operations and non-linear transformations.  ...  Use of repeated lookups on Latin squares, non-linear transformations and complex shift operations further increase the strength of our cryptographic hash function at a low computational overhead and ensures  ...  Call this as determiner(det) (c) Calculate key = (key + det) % n, n = number of different characters stored in Hash Map with their values (d) Pad the character corresponding to key from the Hash Map  ... 
doi:10.1016/j.procs.2015.02.144 fatcat:gwduhujayba7zpyxq2qjybrleu

CLOUD STORAGE DE-DUPLICATION AND ENCRYPTION

Joshi Vinay Kumarmr .
2015 International Journal of Research in Engineering and Technology  
methods of implementing de-duplication, HASH BASED DE-duplication,Erasure Code, Threshold Proxy Re-encryption technique.  ...  frequently use de-duplication in backup and calamity recovery applications as well to avoid duplicate of similar data for savage of space in cloud.In this paper we attempt Data de-duplicationcombined with  ...  This attack is possible when X is known to be a member of a small set. The set of possible X's can then be exhaustively tried at the small cost of three hashing and one encryption operation per try.  ... 
doi:10.15623/ijret.2015.0418011 fatcat:zg2izavji5fqri2nfqh4n5ou54

Hash Functions Based on Large Quasigroups [chapter]

Václav Snášel, Ajith Abraham, Jiří Dvorský, Pavel Krömer, Jan Platoš
2009 Lecture Notes in Computer Science  
In this article we discuss a simple hash function based upon properties of a well-known combinatorial design called quasigroups.  ...  The quasigroups are equivalent to the more familiar Latin squares and one of their most important properties is that all possible element of certain quasigroup occurs with equal probability.  ...  Works that are already known use quasigroups of small order only, or only a small parts of certain quasigroup are there used mainly as a key for Message Authentication Code [3] .  ... 
doi:10.1007/978-3-642-01970-8_51 fatcat:6vwcpa4xibco7pe6rnnqe5tm2q

A Class of Non Invertible Matrices in GF(2) for Practical One Way Hash Algorithm

Artan Berisha, Behar Baxhaku, Artan Alidema
2012 International Journal of Computer Applications  
The matrices proposed are permutation matrices with exactly one entry 1 in each row and each column and 0 elsewhere. Such matrices represent a permutation of m elements.  ...  Since the invention, Hill cipher algorithm was used for symmetric encryption, where the multiplication matrix is the key.  ...  The non invertible matrices are generated only by giving a size of square matrix. For a small amount of data this proposed model meets all six requirements for oneway hash function.  ... 
doi:10.5120/8667-2574 fatcat:k5cl5mjqnzhqhhlp3bxael64mq

EFFICIENT DESIGN OF STORAGE AND RETRIEVAL METHODS

Abid Thyab Al-Ajeeli
2016 INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY  
The paper demonstrates the viability of a number of storage techniques such as hashing using multilingual texts.  ...  numerous sets of data items and length sizes.  ...  It can be used with hash tables with a size that is a power of two. The data item's key is multiplied by a constant, k and then bit-shifted to compute the hash function return value.  ... 
doi:10.24297/ijct.v15i9.198 fatcat:e3nypoy7wbd5foe4ih6n7klhdm

Robust image hashing using image normalization and SVD decomposition

Ricardo Antoio Parrao Hernandez, Mariko Nakano Miyatake, Brian M. Kurkoski
2011 2011 IEEE 54th International Midwest Symposium on Circuits and Systems (MWSCAS)  
This paper introduces the use of image normalization and SVD decomposition hash functions to generate a hash value for a digital image.  ...  Using image normalization as a preprocessing step we can increase the robustness of the hash by 50% against rotation and scaling compared to without this algorithm.  ...  For each coordinate pair generate a square of size -by-, and each square is the output that we call sub-image .  ... 
doi:10.1109/mwscas.2011.6026372 fatcat:w6gc34c7rrazxkkdhxo5tj7cfu

Maintaining the Integrity of Encrypted Data by Using the Improving Hash Function Based on GF 28

Sahab Dheyaa Mohammed, Abdul Monem S. Rahma, Taha Mohammed Hasan
2020 TEM Journal  
The proposed system based on the polynomial numbers of GF (𝟐𝟖) is achieved by improving the encryption approach using the idea of the magic square and the linear equation system also uses improving the  ...  In this paper, a proposed system is designed to protect the confidentiality and integrity of data from penetration, disclosure, and destruction.  ...  Hash algorithms consist of a procedure that converts big data into small data or from data of variable size to data of a fixed size as shown in Figure 1 .  ... 
doi:10.18421/tem93-57 fatcat:aj4itygsbbadxoz2a6gdnkj55a

Security Proof for Partial-Domain Hash Signature Schemes [chapter]

Jean-Sébastien Coron
2002 Lecture Notes in Computer Science  
We study the security of partial-domain hash signature schemes, in which the output size of the hash function is only a fraction of the modulus size.  ...  This provides a security proof for a variant of the signature standards ISO 9796-2 and PKCS#1 v1.5, in which a larger digest size is used.  ...  The proof is based on a modification of Vallée's generator of small random squares [16] .  ... 
doi:10.1007/3-540-45708-9_39 fatcat:25glh5dy5jaqfm5thcd3qo7kfu

Searching for quasigroups for hash functions with genetic algorithms

Vaclav Snasel, Ajith Abraham, Jiri Dvorsky, Eliska Ochodkova, Jan Platos, Pavel Kromer
2009 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC)  
One of their most important properties is that all possible elements of certain quasigroup occur with equal probability. The quasigroups are evolved within a framework of a simple hash function.  ...  Quasigroups are a well-known combinatorial design equivalent to more familiar Latin squares.  ...  Works that are already known use mostly quasigroups of small order only [10] , or only a small parts of certain quasigroup are utilized mainly as a key for Message Authentication Code.  ... 
doi:10.1109/nabic.2009.5393520 dblp:conf/nabic/SnaselADOPK09 fatcat:7kkljetjhncmzpin4coq26dofu

Enhancing Secured Data Hiding Using Dynamic Digital Signature for Authentication Purpose

Erfaneh Noroozi, Salwani Mohd Daud, Ali Sabouhi
2014 Jurnal Teknologi  
In messages with the sizes smaller than 1600 bytes, the hashed file reduces the original file up to 8.51%.  ...  The benefits of this encryption algorithm are computational efficiency, digital signature with the size as small as 8 bytes and minimize bandwidth in comparison with other digital signature methods.  ...  Considering a 16 bytes private key and xor as the first byte of hashing file with first private key, the result will be put in the first key byte.  ... 
doi:10.11113/jt.v68.2907 fatcat:xnsjf6rfb5e6hgpdbeesd4waku

How Risky Is the Random-Oracle Model? [chapter]

Gaëtan Leurent, Phong Q. Nguyen
2009 Lecture Notes in Computer Science  
RSA-FDH and many other schemes secure in the Random-Oracle Model (ROM) require a hash function with output size larger than standard sizes.  ...  As an extreme case, we note that any hash collision would suffice to disclose the master key in the ID-based cryptosystem by Boneh et al. from FOCS '07, and the secret key in the Rabin-Williams signature  ...  -RSA-PSS also requires two random oracles G and H, but while G still has small input size, H has a small output size but possibly large inputs.  ... 
doi:10.1007/978-3-642-03356-8_26 fatcat:vbjvlxawfzfztgra55nuebyw34

Lexicographical framework for image hashing with implementation based on DCT and NMF

Zhenjun Tang, Shuozhong Wang, Xinpeng Zhang, Weimin Wei, Yan Zhao
2010 Multimedia tools and applications  
This paper proposes a lexicographical-structured framework to generate image hashes. The system consists of two parts: dictionary construction and maintenance, and hash generation.  ...  Image hash is a content-based compact representation of an image for applications such as image copy detection, digital watermarking, and image authentication.  ...  A flat block with little information has a large ratio, while a busy block has a small ratio.  ... 
doi:10.1007/s11042-009-0437-y fatcat:nm5jpl4i3jgevgttyzy5m7bjai

Practical oblivious storage

Michael T. Goodrich, Michael Mitzenmacher, Olga Ohrimenko, Roberto Tamassia
2012 Proceedings of the second ACM conference on Data and Application Security and Privacy - CODASKY '12  
We assume that Alice and Bob exchange small messages, of size O(N 1/c ), for some constant c ≥ 2, in a single round, where N is the size of the data set that Alice is storing with Bob.  ...  We also assume that Alice has a private memory of size 2N 1/c .  ...  We give a preliminary missintolerant square-root solution in Section 4. Section 5 derives a miss-tolerant solution from our square-root solution using a cuckoo hashing scheme.  ... 
doi:10.1145/2133601.2133604 dblp:conf/codaspy/GoodrichMOT12 fatcat:bnea7i42a5c45i73griovgejlm

A Scatter Storage Scheme for Dictionary Lookups

D. M. Murray
1970 Information Technology and Libraries  
Finally, experiments with an actual text lookup process </span><span>are </span><span>described, and a possible library application is discussed.</span></p>  ...  The theoretical aspects of computing hash addresses are developed, and several algorithms </span><span>are </span><span>evaluated.  ...  The frequency counts are compared with the expected counts given by equation 5. The comparison is in terms of a chi-square goodness-of-fit test with a 10% level of significance.  ... 
doi:10.6017/ital.v3i3.5255 fatcat:64ooeovkonai5nputunwydtqqu

Secure and efficient constructions of hash, MAC and PRF for mobile devices

Yan Zhu, Shanbiao Wang, Di Ma, Hongxin Hu, Gail-Joon Ahn
2012 2012 IEEE Global Communications Conference (GLOBECOM)  
We also show that the proposed schemes achieve better performance with a complexity reduction from O(n2) to O(knjw) for n·bit message, k·bit output and w·bit word size.  ...  In this paper, we present such a family of square functions, including SqHash, SqMAC and SqPRF, based on a specially truncated function (MSB or LSB).  ...  Since we use SQH function with at less 1024-bits modulus size for secure integer factorization problem, the hash output size is at less 1024 bits.  ... 
doi:10.1109/glocom.2012.6503235 dblp:conf/globecom/ZhuWMHA12 fatcat:k7m4s23o3ja2bei3csockjdvuq
« Previous Showing results 1 — 15 out of 25,004 results