answersLogoWhite
Computer Terminology
Computer Programming
C Programming
Computer Security

Which is better encryption algorithm among DES Blowfish and MD5?

434445

Top Answer
User Avatar
Wiki User
2011-06-29 12:11:39
2011-06-29 12:11:39

MD5 isn't a encryption algorithm, it's a hashing algorithm.

Encryption will 'hide' the meaning of the encrypted text, while MD5 will 'add up' all the text to come up with a number. This number can be compared to another time this file was 'added up', to provide a simple kind of check to see if the text has been changed or if it is the same.

1

Related Questions

User Avatar

It's an algorithm you want, or a C program? Here is the algorithm: min3 (a, b, c) := min2 (a, min2 (b, c)) min2 (x, y) := y if x>y; x otherwise

User Avatar

DES is a widely-used method of data encryption using a private key that was judged so difficult to break by the U.S. government that it was restricted for exportation to other countries. There are 72,000,000,000,000,000 (72 quadrillion) possible encryption keys that can be used. For each given message, the key is chosen at random from among this enormous number of keys.

User Avatar

The survival rate among children is definitely better than among older people.

User Avatar

Among the newest are Bl ekko which has a dimensional type of algorithm allowing you to interact with it much more that the more traditional ones out.

User Avatar

There are so many disadvantage of a personal computer. Some of them include limited storage, lack of encryption from serves, vulnerable to virus and malware attacks among others.

User Avatar

seraching of algorithm is finding an item with specified properties among a collection of items. The items may be stored individually as records in a database; or may be elements of a search space defined by a mathematical formula or procedure, such as the roots of an equation with integer variables; or a combination of the two, such as the Hamiltonian circuits of a graph

User Avatar

No, Dijkstra's algorithm can not be used when there are negative arc lengths. In Dijkstra's, the vertex that can be reached from the current set of labeled vertices and that of having the minimum weight among the alternatives is permanently labeled in that iteration. Since a negative arc weight would result in changing the label of a pre-permanently-labeled vertex, the algo collapses. Bellman's algorithm is used with negative arc lengths.

User Avatar

The question is a bit too vague for a meaningful answer, it depends on what you are searching and what you are looking for.For search in an unsorted list, there is no better alternative than the naive algorithm of looking at every single element.For search in a sorted list (like a phone book sorted on name) binary search is much more efficient.For string search, like used in biology to find DNA matches, there are dedicated algorithms that deal exclusively with string matching.For graph search, A* ("A star") is among the better.For more general search problems there are a whole host of search methods that work better than others in particular domains. But so far, there is no ultimate winner that is best for everything. The best ones are generally custom made for one particular problem, like the best known algorithm for the Travelling Salesman Problem.See also related link.

User Avatar

An algorithm that can find an approximate result quickly when an exact result would be too expensive to calculate.As an example, if you wanted to find the largest number among millions of numbers (and these numbers where somehow very expensive to find or operate on), you could sample a thousand of them, have a look at the statistical distribution of those thousand numbers, and say that the maximum among all the numbers is within such-and-such a range with such-and-such probability.You could say that a public poll uses an approximation algorithm - instead of asking everyone in the country, you ask a small sample and extrapolate from the result using statistical methods.See related link.

User Avatar

Between the two of us we have enough money to choose among the better restaurants to have dinner.

User Avatar

Max = 0For K = 1 to NIf Number(K) > Max then Max = Number(K)Next KPrint Max

User Avatar

Bit patna>>> bit deoghar

User Avatar

They have better technology than the previous version.

User Avatar

Differences among employees are better for new ideas. If all employees think alike there will be seldom ideas.

User Avatar

So that we can know the habitat of each organism better and able to create a better balanced environment.

User Avatar

Taxonomy is an important tool for better understanding the unity among living organisms because it helps to classify all living things. It tells the structural differences of organisms.

User Avatar

According to Wikipedia, Lionfish is a type of venomous marine fish, found mostly in the Indo-Pacific. It is characterized by, among other things, venomous spiky fins. However, like the more famous venomous blowfish, it appears you can eat it, if correctly prepared as the linked article shows.

User Avatar

Algorithm Step1: Read A, B, C Step2: If A > B is True, then check whether A > C, if yes then A is greatest otherwise C is greatest Step3: If A > B is False, then check whether B > C, if yes then B is greatest otherwise C is greatest Give the Flowchart Answer

User Avatar

Ecumenicity or ecumenism is the practice of promoting cooperation or better understanding among different religions.

User Avatar

Northeast or better said among the Mid Atlantic states.

User Avatar

Differences among organisms is how evolution occurs. This is because those with differences are sometimes better equipped to survive, so they pass on their differences.

User Avatar

Filipinos are the best English speakers among the Asian race. ... Ummm I don't think so... Indians speak it better.

User Avatar

You must continuing playing in Superstar Mode to upgrade your status among agents. Such as winning Super Bowls, and your the MVP will get you a better agent

User Avatar

Backtracking algorithmn finds minimal path among the all.The main advantage of back tracking algorithmn as compare with greedy is to find minimal distance.In greedy ,it does.t know the optimal solution.It is used in Google earth.

User Avatar

Googles has a their own algorith for ranking websites,it changes their algorithm based on more than 200 facts among them,back link,page content,load time,traffics are mostly considered by search engine.


Copyright © 2020 Multiply Media, LLC. All Rights Reserved. The material on this site can not be reproduced, distributed, transmitted, cached or otherwise used, except with prior written permission of Multiply.