Jerim-320: A New 320-Bit Hash Function Compared To Hash Functions With Parallel Branches

This paper describes JERIM-320, a new 320-bit hash function used for ensuring message integrity and details a comparison with popular hash functions of similar design. JERIM-320 and FORK -256 operate on four parallel lines of message processing while RIPEMD-320 operates on two parallel lines. Popular hash functions like MD5 and SHA-1 use serial successive iteration for designing compression functions and hence are less secure. The parallel branches help JERIM-320 to achieve higher level of security using multiple iterations and processing on the message blocks. The focus of this work is to prove the ability of JERIM 320 in ensuring the integrity of messages to a higher degree to suit the fast growing internet applications

Chipless RFID Tag Using Multiple Microstrip Open Stub Resonators

A novel compact RFID tag employing open stubs in a microstrip transmission line is proposed. The prototype of the tag is fabricated on a substrate of dielectric constant 4.4 and loss tangent 0.0018. The tag consists of microstrip open stub resonators and cross polarized transmitting and receiving disc monopole antennas. A prototype of 8 bit data encoded tag is demonstrated in this communication. Method for enhancing the performance of the RFID tag is also proposed. Magnitude or group delay response can be used to decode the tag informations