Science topic

# Cryptology - Science topic

Explore the latest questions and answers in Cryptology, and find Cryptology experts.

Questions related to Cryptology

If we have a cryptography algorithm x .. how can we practically evaluate its strength ?

HVC : Halftone Visual Cryptography

In HVC we generate halftone image then its complementary after that we embed the secret image into them. by stacking the two shares we recover the secret. my Q is when we calculate some metrics such as Recall F-measure between which images ? is between halftone image before embed the secret and after embed the secret

I am using steganography using DWT + Quantitative embedding processing and this embedding look weak because it doesn't support any attack. kindly suggest me what can be done to improve the above stegano process and I have used PSNR ,KL distance BER and PRD for performance evaluation . if there is any other metrics that can used to performance evaluation and suggest some attacks that can be done on stegno image

Algorithm in attached file.

algorithm in Leveraging the Multiprocessing Capabilities of Modern Network Processors for Cryptographic Acceleration paper.

Currently i am working on authentication as well as transmission part, can anyone suggest me where i can implement my work in real time application?

Since from their inception, all most all the attacks on McEliece cryptosystem and its variant Niederreiter cryptosystem have been unsuccessful. They are believed to resist even quantum attacks. These two are code-based Public-key cryptosystem whose private key consists of a generator matrix of a Goppa code. All other modified versions of these cryptosystems which were proposed by replacing Goppa codes with other codes have been proven to be insecure. In view of this, what is the structural advantage that Goppa codes enjoy over other families of codes that makes them so strong for cryptographic applications?

In my view, the formal solution ``P vs NP'' is found in the narrow sense.

I am new in Steganalysis side. Can anyone guide me implementation of RS analysis (Fridrich 2001), paper implementation, or have any reference code?

when hide some bits of secret message in DCT coefficients ,we note some lossy in extracting message(sorry for bad English)

I think we prefer Public-key Cryptography, because of its computationally hardness, over Private-key Cryptography. Is this the only reason or?

Suppose we are considering only confidentiality and for now just ignoring the active attacks. So we encrypt the email with the secret key generated by online trusted third party and then send both the ticket and encrypted email to the receiver. By ignoring the problems and drawbacks of the online trusted third party. So what are the problems with this mechanism? Also for each email/session we are using a new key.

tools which help to measure the complexity (level of security) to encryption design,

to other type of time complexity.

The correlation attack is one of the most important attacks that attacks stream cipher. Can someone share an illustrative example of a simple application process for this attack.