analysing cryptographic algorithms, potentially uncovering weaknesses in them (e.g. "breaking" them or casting doubts on their actual security)

learn more… | top users | synonyms

0
votes
1answer
981 views

AES encryption for images [closed]

Why AES based encryption is not recommended for encrypting images with high redundancy in their content? for example, the encryption of an image which shows a bird in the blue sky. Most of the pixels ...
0
votes
1answer
89 views

Generating child keys for a hill climb algorithm

As a little pet project I'm writing some code to do a little cryptanalysis. Starting with something simple I have created a hill climbing algorithm for solving a simple substitution cipher. So I ...
0
votes
1answer
104 views

Roots of polynomial in Shamir secret sharing

I need to know whether one can obtain any roots of the polynomial in Shamir secret sharing if he possesses less than threshold shares. For instance in (t,n) if he has t-1 shares can he obtain any ...
0
votes
2answers
168 views

RSA decrypting of a huge file by parts [closed]

I need to decrypt a huge file that I own previously encoded by myself with a RSA public key (it's possible for this step using a symmetric algorithm key). Problem is that I can't load it in my ...
0
votes
1answer
55 views

find $x$, given $\{c_ix = k_i + y_i\}_{i=[1,n]} $

Given $$c_1x = k_1 + y_1 $$ $$c_2x = k_2 + y_2 $$ $$\vdots $$ $$c_nx = k_n + y_n $$ where the values of $\{c_1 \ldots c_n \}$ and $\{ k_1 \ldots k_n \}$ are known, and $x, \{y_1 \ldots y_n \}$ are ...
0
votes
0answers
41 views

Need help solving a shift cipher problem?

A three letter alphabet {a, b, c} has probabilities p(a) = .5 and p(b) = p(c) = .25. A shift cipher is applied to pairs of letters. More precisely: plaintexts consist of two-letter sequences of ...
0
votes
0answers
24 views

impersonating attack against a protocol

recently I'm reading Efficient eCK-secure Authenticated Key Exchange Protocols in the Standard Model, and I sense that the scheme in the following(the reader can refer to the paper for details) is ...
0
votes
1answer
46 views

For calculating the index of coincidence for each sequence

I was learning about the finding the key length reading the following web site... http://practicalcryptography.com/cryptanalysis/stochastic-searching/cryptanalysis-vigenere-cipher/ and I really don't ...
0
votes
0answers
225 views

Blum-Blum-Shub Cryptosystem

I am given $N$, which is Bob's encryption key. I was able to successfully factor $N$ into $N=p*q$. Alice encrypts a messages for bob and sends $a = [1,1,1,0,0,0,1,0,1,1,0,...]$ $b = 1545164156...$ ...
0
votes
0answers
225 views

How good is the RandomPool generator in Crypto++ library?

How good is the RandomPool generator in Crypto++ library? I never heard of it before… I wonder if there is a Fortuna C implementation that I could use in an Objective-C project. Also: How secure is ...
0
votes
0answers
42 views

Merkle-Damgard transform: necessity of the Length block [duplicate]

The Merkel-Damgard transform append the message length (in blocks) to the message itself and then computing the 'chained hash' algorithm. Does the last block (which contains the length of the ...
0
votes
0answers
64 views

Strength of Combining Hash functions [duplicate]

If I combine two hash functions, what will the impact on the strength of the resulting function. If I combine in following way: H1*H2 (multiply) H1 + H2 (concat) H1 Xor H2 H1 (H2) EDIT: Lets say H1 ...
-1
votes
2answers
285 views

Shamir Secret sharing - Can share generator keep x values secret?

I'm wondering, in Shamir secret sharing, can generator of the shares, keep the x values which are used in evaluating the polynomial to obtain y values (i.e., the shares) secret, and whenever the ...
-1
votes
1answer
167 views

Is it possible to find plaintext from ciphertext if (n) and (a) are known for RSA?

I have a couple of questions pertaining to a RSA problem. I need to decipher some ciphertext and find out what the original plaintext was. Modulus: $n = 2537$ and exponent: $a = 11$ Encrypting ...
-1
votes
1answer
163 views

cryptography and use of python programming language [closed]

why is it recommended to write cryptography programs ,for example crypt-analysis projects with python programming language? what is the advantages of python? why not use c or any other language?
-1
votes
1answer
132 views

Hash Based Encryption (fast & simple), how well would this compare to AES? [duplicate]

First of all, I know it's a very bad idea to invent your own encryption algorithm. It's better to use existing known, trusted, extensively tested and studied algorithms with a proven track record. The ...
-1
votes
1answer
134 views

How do I cryptanalyze a password field?

In a PostgreSQL database, I can see the following fields in a table (for a specific record): User = administrator Password = "ceMv9Me6go" Now the following are true: The password length is not ...
-1
votes
1answer
120 views

Reverse engineering a single checksum byte [closed]

I am working to understand a system which saves a few bytes of data together with what appears to be a single checksum byte that provides a very naive guarantee that the data has not been tampered ...
-1
votes
1answer
118 views

How to determine which type of crypto is used in a text file? [closed]

is there a tool or a way to determine which type of crypto is used in this type of text: ...
-2
votes
3answers
929 views

How can I find the prime numbers used in RSA?

I got this question in a local hacking event, but I couldn't solve it. Problem Statement ---- Continuing their snooping habit, NSA kept bugging Alice's communication. Resorting to the age old ...
-2
votes
1answer
746 views

How to hack the new save encryption on ipad for uplink? [closed]

The new iPad version of Uplink appears to be using some newer saving mechanic than the PC/Mac version. Macs and PCs use the REDSHIRT format, but the iPad appears to instead be using ...
-2
votes
1answer
85 views

Which causes longer “break” time (in general)?

In general (if possible to determine) which would make an output harder to turn into plain text with a computer? Extreme Length (minor complexity change) Extreme algorithmic complexity (minor length ...
-2
votes
0answers
28 views

what is the difference between existential forgery by know message attack and existential forgery by chosen message attack in digital signature?

existential forgery is the attack must create a valid signature on at least one message ,so can i know what is the differences between when they apply on chosen message and known message attack ? I ...
-3
votes
2answers
786 views

finding collision for truncated SHA1 hash output

Suppose we truncate only 40 bits of sha1 hash output.hence it is insecure.how can we find two message as input which gives first 40 bits of hash as same value i.e we have to find collision for first ...
-3
votes
1answer
132 views

ASCII Message in TV show? [closed]

So I was watching a popular series tonight (Person Of Interest) when suddenly during a frame change I noticed a very quick blue screen with writing. At the time I never thought anything of it as it ...
-4
votes
2answers
197 views

Any techniques for evading frequency based crypt analysis without encrypting?

Are there any general techniques for evading frequency based crypt analysis without using any encryption techniques?
-4
votes
1answer
153 views

Can someone tell if my Hand Cipher is secure? [closed]

In easy steps, this is how it works: Convert txt to numbers. mod 1-26. Generate random numbers (by my other cipher) equal to plain txt. Write random numbers under txt numbers. Like this: ...
-5
votes
4answers
309 views

Found a way to crack AES-128, what now?

I have just found a way to crack AES-128 in a reasonable time (1-2 days). How do I publish and prove this? I remember reading about lots of people who cracked DES and other ciphers but how did they ...