0
High efficiency
not complex
high secure
Wiki User
∙ 11y ago
Add your answer:
Earn +20 pts
Which encryption algorithm is better and why?
If you're talking about symmetric key encryption (the kind where you just use one key for encryption and decryption), then arguably, the best encryption algorithm you can use is the Rijndael algorithm, better known now as AES (advanced encryption standard). It is the encryption standard used by the U.S. government for classified information. It is fast, requires little memory, and the only potential attacks against it are highly theoretical. Rijndael beat out Twofish and Serpent in the AES standard contest, but those other two algorithms will provide more than enough security as well. In the end, it doesn't really matter, since most successful attacks are made simply by finding out your key through brute force, espionage or extortion, rather than pure data analysis. Humans are almost always the weakest point when it comes to security, and it doesn't matter what algorithm you use if someone can guess your password.
Advantage of bzip2 compression algorithm over other algorithms?
Archives are smaller than with gzip. Compression requires more resources though.
What is the difference between programming and algorithm?
A program is a detailed set of instructions for a computer to carry out, whle an algorithm is a detailed sequence of steps for carrying out a process.
What is algorithm and what are its characteristics?
An "algorithm" is simply a method to solve a certain problem. For example, when you use the standard method you learned in school to write down two numbers, one beneath the other, then add them, you are using an algorithm - a method that is known to give correct results in this particular case.
What is sub-algorithm?
It is an algorithm used by another algorithm as part of the second algorithm's operation.As an example, an algorithm for finding the median value in a list of numbers might include sorting the numbers as a sub-algorithm: There are plenty of algorithms for sorting, and the specifics of the sorting does not matter to the "median value" algorithm, only that the numbers are sorted when the sub-algorithm is done.For what an algorithm is, see related link.
Which encryption algorithm is better and why?
If you're talking about symmetric key encryption (the kind where you just use one key for encryption and decryption), then arguably, the best encryption algorithm you can use is the Rijndael algorithm, better known now as AES (advanced encryption standard). It is the encryption standard used by the U.S. government for classified information. It is fast, requires little memory, and the only potential attacks against it are highly theoretical. Rijndael beat out Twofish and Serpent in the AES standard contest, but those other two algorithms will provide more than enough security as well. In the end, it doesn't really matter, since most successful attacks are made simply by finding out your key through brute force, espionage or extortion, rather than pure data analysis. Humans are almost always the weakest point when it comes to security, and it doesn't matter what algorithm you use if someone can guess your password.
Improving security in real time wireless networks through packet scheduling?
In the present network we have not a security of your data so you can do develop a some algorithm,that is useful to protect the packets in dynamically,but now used algorithms can't protect the packets,so we can develop spss algorithm,this algorithm is more protect the packets compare to other algorithms.......
My friend made a bet with me that I couldn't break his custom encryption or something. I really have no idea what Im doing with this. Any help?
Whether one particular encryption algorithm can be broken with ease or only with a huge effort depends on the strength of the cipher. A simple encryption algorithm such as ROT-x or XOR-n are not very hard to break, however, present-day industry-standard encryption algorithms such as many forms of AES are very hard to break. Those simple algorithms are broken by application of logic and observation; one example are common picture puzzles where shapes are used to represent different digits, and combinations of shapes represent different mathematical equations. No encryption algorithm has been proven to be unbreakable, but some have been proven to be virtually impossible to break by brute force. Brute force attacks are done by trying out huge numbers of keys, for example. The impossibility to break a cipher in this manner is deducted from statistic probabilities about the number of attempts one would need to make in order to find the correct key. However, some particular algorithms have known weaknesses which can be exploited. For example, a weak algorithm might produce the same output from the same input every time, or produce different output with predictable differences. Many encryption schemes are also exploited by taking advantage of human weakness, such as trying out a list of well-known passwords, etc. Other methods of breaking an encryption scheme involve a known plaintext content: knowing the data, or part of the data, which ought to be within the encrypted data, can allow for conclusions about the encryption algorithm. In WWII, the German Enigma encryption engine was famously broken based on such knowledge. Therefore, an important step about an encryption code is to collect as much information about the code, its application, and its inventor, as possible. These will often give clues about the nature of the algorithm, or about particular limitations, which would then lead to planning the next steps.
Advantage of bzip2 compression algorithm over other algorithms?
Archives are smaller than with gzip. Compression requires more resources though.
Suppose acomputer memory were infinitely fast and computer memory were free would you have any reasion to study algorithm yeas or no why?
If there was some magical infinitely fast infinite memory computer then a brute force algorithm would have the same running time as an elegant algorithm, so in that case it wouldn't make any difference. However, there is no such thing as an infinitely fast computer or free memory, in the real world you have to make trade-offs and know how those affect your memory-usage and running-time. Also, unless you know algorithms you are going to have a VERY hard time trying to code any sort of advanced functionality, especially things like encryption which depend on strong randomness, and where a small mistake anywhere in your algorithm can mean that your encryption can be easily compromised by someone who knows what they are doing.
Algorithms are presented visually by using flow charts?
Yes. At least, that is one way of presenting an algorithm. Other ways include a verbal description, and pseudocode.
What is the difference between programming and algorithm?
A program is a detailed set of instructions for a computer to carry out, whle an algorithm is a detailed sequence of steps for carrying out a process.
How does laptop encryption work?
A laptop works almost exactly like a bike lock. You have to wrap the laptop lock wire around a heavy object and then you insert a metal piece into the actual laptop. It's not destructible and can be broken off, since the laptop is still plastic, but in reality it does stop many from actually committing the crime of taking your laptop. http://laptopfanz.com
What is algorithm and define its complexity?
In mathematics and computer science, an algorithm is an effective method expressed as a finite list of well-defined instructions for calculating a function Algorithms are used for calculation, data processing, and automated reasoning.By complexityAlgorithms can be classified by the amount of time they need to complete compared to their input size. There is a wide variety: some algorithms complete in linear time relative to input size, some do so in an exponential amount of time or even worse, and some never halt. Additionally, some problems may have multiple algorithms of differing complexity, while other problems might have no algorithms or no known efficient algorithms. There are also mappings from some problems to other problems. Owing to this, it was found to be more suitable to classify the problems themselves instead of the algorithms into equivalence classes based on the complexity of the best possible algorithms for them. Burgin (2005, p. 24) uses a generalized definition of algorithms that relaxes the common requirement that the output of the algorithm that computes a function must be determined after a finite number of steps. He defines a super-recursive class of algorithms as "a class of algorithms in which it is possible to compute functions not computable by any Turing machine" (Burgin 2005, p. 107). This is closely related to the study of methods of hypercomputation.veer thakurchandigarh
What is algorithm and what are its characteristics?
An "algorithm" is simply a method to solve a certain problem. For example, when you use the standard method you learned in school to write down two numbers, one beneath the other, then add them, you are using an algorithm - a method that is known to give correct results in this particular case.
How are prime numbers useful in life?
In computers "The RSA algorithm involves three steps: key generation, encryption and decryption" Used to keep data secret from other people. I'm not an expert but I think your bank login use it ect.
What is sub-algorithm?
It is an algorithm used by another algorithm as part of the second algorithm's operation.As an example, an algorithm for finding the median value in a list of numbers might include sorting the numbers as a sub-algorithm: There are plenty of algorithms for sorting, and the specifics of the sorting does not matter to the "median value" algorithm, only that the numbers are sorted when the sub-algorithm is done.For what an algorithm is, see related link.
