Figure from:A Secured Cryptographic Messaging System
![3. The Proposed System Table 2: Hash algorithms comparison Our proposed system (SSMS) uses symmetric-key encryption where messages are encrypted, and decrypted using a single secret key. We have selected AES (Rijndeal) algorithm to be employed in SSMS. 128-bits length is suitable for our purpose for practical message length and processing time resulting in a reasonable cost this is incurred by a service provider. A fundamental primitive in modem cryptography is the cryptographic hash function. To be of cryptographic use, a hash function h is typically chosen such that it is computationally infeasible to find two distinct inputs which hash to a common value (i.e., two colliding inputs x and y such that h(x) = h(y)), and that given a specific hash-value y, it is computationally infeasible to find an input (pre-image) x such that h(x) =y [1]. Several hash functions techniques are available. This includes CRC, SHA, SHA-1, SHA-256, SHA- 384, SHA-512, MD2, MD4,MD5, RIPEMD-128, RIPEMD-160, RIPEMD-256, RIPEMD-320, HMAC, HAVAL, UHASH [9]. Table 2 presents a comparison among such techniques.](https://figures.academia-assets.com/6979317/table_001.jpg)
Table 2 3. The Proposed System Table 2: Hash algorithms comparison Our proposed system (SSMS) uses symmetric-key encryption where messages are encrypted, and decrypted using a single secret key. We have selected AES (Rijndeal) algorithm to be employed in SSMS. 128-bits length is suitable for our purpose for practical message length and processing time resulting in a reasonable cost this is incurred by a service provider. A fundamental primitive in modem cryptography is the cryptographic hash function. To be of cryptographic use, a hash function h is typically chosen such that it is computationally infeasible to find two distinct inputs which hash to a common value (i.e., two colliding inputs x and y such that h(x) = h(y)), and that given a specific hash-value y, it is computationally infeasible to find an input (pre-image) x such that h(x) =y [1]. Several hash functions techniques are available. This includes CRC, SHA, SHA-1, SHA-256, SHA- 384, SHA-512, MD2, MD4,MD5, RIPEMD-128, RIPEMD-160, RIPEMD-256, RIPEMD-320, HMAC, HAVAL, UHASH [9]. Table 2 presents a comparison among such techniques.
Related Figures (2)
