0
Arithmetically equal
Wiki User
∙ 14y ago
Add your answer:
Earn +20 pts
What requirements must a public key cryptosystems fulfill to be a secure algorithm?
1. It is computationally easy for a party B to generate a pair(Public key KUb, Private key KRb) 2. It is computationally easy for a sender A, knowing the public key and the message to be encrypted , M, to generate the corresponding ciphertext: C=EKUb(M) 3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private key to recover the original message : M=DKRb(C)=DKRb[EKUb(M)] 4. It is computationally infeasible for an opponent , knowing the public key,KUb,to determine the private key,KRb. 5. It is computationally infeasible for an opponent , knowing the public key,KUb, and a ciphertext, C, to recover the original message,M. 6. The encryption and decryption functions can be applied in either order: M=EKUb[DKRb(M)]=DKUb [EKRb(M)]
What requirement must a public key cryptosystems fulfill to be a secure algorithm?
1. It is computationally easy for a party B to generate a pair(Public key KUb, Private key KRb) 2. It is computationally easy for a sender A, knowing the public key and the message to be encrypted , M, to generate the corresponding ciphertext: C=EKUb(M) 3. It is computationally easy for the receiver B to decrypt the resulting ciphertext using the private key to recover the original message : M=DKRb(C)=DKRb[EKUb(M)] 4. It is computationally infeasible for an opponent , knowing the public key,KUb,to determine the private key,KRb. 5. It is computationally infeasible for an opponent , knowing the public key,KUb, and a ciphertext, C, to recover the original message,M. 6. The encryption and decryption functions can be applied in either order: M=EKUb[DKRb(M)]=DKUb [EKRb(M)]
What the computer was made for?
Solving computationally intensive problems that were beyond the capability of human computers to solve.
How are fractals apart of math?
Fractals are generated from recursive mathematical equations, this is why you can zoom-in on them infinitely and they will continue to repeat themselves (this is also why they are so computationally intensive)
What characteristic are needed to secure hash function?
1. H can be applied to a block of data of any size. 2. H produces a fixed-length output. 3. H(x) is relatively easy to compute for any given x, making both hardware and software implementations practical. 4. For any given value h, it is computationally infeasible to find x such that H(x) = h. This is sometimes referred to in the literature as the one-way property. 5. For any given block x, it is computationally infeasible to find y ≠ x with H(y) = H(x). 6. It is computationally infeasible to find any pair (x, y) such that H(x) = H(y).
What is the difference between an unconditionally secure cipher and a computationally secure cipher?
unconditional security no matter how much computer power or time is available, the cipher cannot be broken since the ciphertext provides insufficient information to uniquely determine the corresponding plaintext computational security given limited computing resources (eg time needed for calculations is greater than age of universe), the cipher cannot be broken
The efficiency of using recursive function rather than using ordinary function?
For some algorithms recursive functions are faster, and there are some problems that can only be solved through recursive means as iterative approaches are computationally infeasible.
What is soft computer?
Soft computing is a term applied to a field within computer science which is characterized by the use of inexact solutions to computationally hard tasks. Soft computing covers similar topics of computational intelligence, natural computing, and organic computing.
What is soft computing methodology?
Soft computing is a term applied to a field within computer science which is characterized by the use of inexact solutions to computationally hard tasks. Soft computing covers similar topics of computational intelligence, natural computing, and organic computing.
Disadivantages of relational database system?
The main disadvantage of a relational database is that it is slow and computationally intensive. Other disadvantages are:Extracting a meaningful information from the data takes a lot of time as the data is stored in multiple tables.The data complexity grows with the increase in the number of relations.
What properties must a hash function have to be useful for message authentication?
To be useful for a message authentication, the hash functions must have the following properties – • H can be applied to a block of data of any size • H produces a fixed-length output • H(x) is easy to compute for any given x, making both hardware and software implementations practical. • For any given code h, it is computationally infeasible to find x such that H(x) = h. A hash function with this property is referred to as one-way or pre-image resistant. • For any given block x, it is computationally infeasible to find y ≠ x with H(y) = H(x). A hash function with this property is referred to as second pre-image resistant. This is sometimes referred to as weak collision resistant. • It is computationally infeasible to find any pair (x, y) such that H(x) = H(y). A hash function with this property is referred to as collision resistant. This is sometimes referred to as strong collision resistant.
What is the advantage and dis advantage of mid-point method?
The advantage of the mid-point method in mathematics is that it provides a more accurate approximation of the area under a curve compared to the trapezoidal rule, especially when the function has rapid changes. The disadvantage is that it can be more computationally intensive since it requires evaluating the function at more points.
