Describe MD-S algorithm in detail. Compare its performance with SHA-1.
|Subject||Computer and Network Security|
|NU Year||Set: 5.(b) Marks: 4+3=7 Year: 2017|
Two types of solutions for MDS are discussed. If the proximities are Euclidean distances, classical MDS yields an easy algebraic solution. In most MDS applications, iterative methods are needed, because they admit many types of data and distances. They use a two-phase optimization algorithm, moving the points in MDS space in small steps while holding the data or their transforms fixed, and vice versa, until convergence is reached.
|MD5 Algorithm||SHA-1 Algorithm|
|It is first published in the year 1992.||It is first published in the year 1995.|
|MD5 is uses to create a message digest for digital signatures.It creates a fixed 128-bit output that,when summed, total 32 characters long||SHA-1 is used to create digital signatures.It produces a 160-bit message digest that is considered to be more secure than MD5.|
|MD5 is less stronger hash algorithm as it outputs a 128-bit message digest.||SHA -1 is considered a stronger hash algorithm as it outputs a 160-bit message digest.|
|MD5 requires less processing power as compared with SHA-1||SHA-1 requires more processing power as compared with MD5.|
|It is less secure||It is more secure|
|It's output performance is 335 MiB/s||It's output performance is 192 MiB/s|
Login to post your comment.