JP Journal of Algebra, Number Theory and Applications
Volume 36, Issue 2, Pages 177 - 188
(April 2015) http://dx.doi.org/10.17654/JPANTAApr2015_177_188 |
|
CONSTRUCTION OF FAMILY OF HASH FUNCTIONS BASED ON IDEAL LATTICE
Sugi Guritman, Nur Aliatiningtyas, Teduh Wulandari and Muhammad Ilyas
|
Abstract: Cryptographic hash function is a function with which has the security properties: one-way not feasible to calculate from known so that and collision resistant (not feasible determining so that Family of hash functions based on ideal lattice is formulated as matrix multiplication with computation involving ring arithmetic The main problem is to construct an efficient algorithm from the formulation with the objective: the security properties are met and the key size is reduced. Related to this issue and following the results of previous studies, in this article, general algorithms for the family of hash function based on ideal lattice are constructed. In this case, family is defined as the arithmetic ring determined by the family of irreducible trinomial with Then, as the key: one randomly chosen and randomly selected t trinomial then the compression function of hash function ideal lattice is defined as a recursive process that processes the message block x to the value The study also covers issues related to processing speed and security aspects of the hash function construction results. |
Keywords and phrases: ring polynomial arithmetic algorithms, hash function, ideal lattice. |
|
Number of Downloads: 473 | Number of Views: 1861 |
|