Analysis of individual security aspects of a cipher or algorithm, not the security of a cipher or algorithm in general (which would lean towards “algorithm-design”).

learn more… | top users | synonyms (1)

1
vote
0answers
22 views

Difference between SHA1 and SHA1HMAC? [duplicate]

Can anyone let me know the difference between SHA1 and SHA1HMAC algo?
1
vote
0answers
15 views

How to calculate LOW(b) and HIGH(b) in spritz cryptography

I try to implement spritz cryptography like this paper . But I don't know how to calculate LOW(b) and HIGH(b). In paper page 7. ...
1
vote
0answers
56 views

Carrying out a known-plaintext attack on a cipher [closed]

Previously posted here. Someone suggested I could post it here to get some answers. I am trying to solve a CTF challenge, here. Basically we're given message and key inputs to a cipher and its ...
1
vote
0answers
65 views

How to overcome issues with big ciphers? E.g. with small vs. big Vigenére Ciphers

I understand that bigger ciphers show more recurring patterns and therefore should be easier (or at least faster) to decrypt as you'll have a better statistical analysis, being However if we use a ...
1
vote
0answers
65 views

Powerline password conversion [closed]

I read this post from Ben Tasker describing how to take control of a powerline network. Since I am interested in security, I tried to do the same thing, to see if it was possible. I used Devolo ...
1
vote
0answers
65 views

Understanding a faulty Needam-Schroeder protocol

Give this mutual-authentication protocol (along with the attack) in which Alice wants to communicate with Bob, I can't understand how the attack works. A chooses $N$ (nonce) and sends to C (trusted ...
1
vote
0answers
225 views

Is chaotic encryption secure? [closed]

I know this sounds too broad. But I noticed that there was a chapter on chaotic crypto in the recent Handbook of Information and Communication Security Editors: Stavroulakis, Peter, Stamp, Mark (Eds.) ...
1
vote
0answers
62 views

Statistical saturation attack on block ciphers [duplicate]

I was wondering if anyone around here could give me some explanation on this type of attacks. Pretty much the only thing that I could find is this What I really need is basic explanation of the ...
1
vote
0answers
55 views

Decrypt a message which is encrypted using XOR? [duplicate]

This is a puzzle asked in a contest. Given that encryption , decryption happens as per following rule/code: ...
1
vote
0answers
51 views

Infer encoding mechanism from $n$-grams distance?

I have a series of obfuscated strings which across the set of strings have regions of high variance and regions of low variance – implying some encoding mechanism as opposed to an encryption procedure ...
1
vote
0answers
92 views

To prove $r_2$ is a uniformly at random value in $Z_n$, where $r_2=r_1 . m$

$m$ is arbitrary value in $Z_n$, where n is RSA modulo. Then we do: $r_2=r_1 . m (modn)$, where $r_1$ is a random value such that $r_1\in Z^*_n$. ** Question(1): is $r_2$ a uniformly at random ...
1
vote
0answers
96 views

(n,n) Shamir secret sharing [duplicate]

In (n,n) Shamir secret sharing if n shareholders do not have the public values (X values) can they still obtain the secret with only Y values?
1
vote
0answers
73 views

How to decrypt a text which is ciphered same length key? [duplicate]

I have ten piece of ciphered texts. I know that they ciphered with a same-length key. Any idea how I can decrypt the ciphertexts? What kind of algorithms should I use? What are the points of taking ...
1
vote
0answers
22 views

Cryptography — with a semi-priveleged user in the middle — to prevent request-tampering with another server

I'm working on a chat server for a mobile app I am writing. I would like to use a different application server for non-chat related operations and another application for chat operations. I would ...
1
vote
0answers
487 views

Example of second preimage attack [closed]

Please, I'm trying to understand second-preimage attacks on cryptographic hash functions. I understand the definition well: given a message and it's hash, an attacker finds another message which ...
1
vote
0answers
354 views

Is there any analysis of freebsd's “geli” encrypted geometry provider?

I've done a few obvious searches on google and google scholar and not turned up any security analysis of FreeBSD's geli. Is there some out there, or has it gone unanalyzed since its introduction ...
1
vote
0answers
57 views

AES and Known-plaintext attack [duplicate]

Can you help me to finding some papers that shows AES is secure against known-plaintext attack?
1
vote
0answers
40 views

Computing A, B given A+K and B+K [duplicate]

In his writeup of the Solitaire keystream generator algorithm, Bruce Schneier warns not to use the same key for two different messages: The first rule of an output-feedback mode stream cipher, any ...
1
vote
0answers
173 views

Partial encryption of a file?

I want to partially encrypt a large block of data using AES. Meaning: given plaintext[0:1100], I would like to encrypt ...
1
vote
0answers
153 views

Career advice for our readers [closed]

I am a first year math PhD student with work experience and an MS in math. Do you have any advice regarding internships involved with cryptography and other mathematics other than the NSA? Thanks.
1
vote
0answers
209 views

Differential Cryptanalysis of FEAL-4

I'm currently carrying out a differential attack on the FEAL-4 algorithm, however I have hit a bit of a wall. Basically I attacked the final round first ($K3$) using the differential characteristic ...
1
vote
0answers
84 views

Two untrusted party want to exchange data: how to ensure each one gets the data it needs? [duplicate]

Possible Duplicate: Two untrusted party want to exchange data: how to insure each one gets the data it needs? I am trying to come up with what could maybe be a novel algorithm for an ...
0
votes
2answers
268 views

How secure would this code be against cryptanalysis?

Simple version: Create software that takes a database of the dictionary, alphabet, and phrases. Randomly generate a database of random strings of letters/numbers/symbols of varying length. Randomly ...
0
votes
3answers
349 views

When is a cipher considered broken?

We've all read how some people claim AES is broken because there was supposedly a way to get the plain text from a cipher text faster than brute-force. But is this the definition? Is a cipher broken ...
0
votes
1answer
480 views

Is this encryption scheme perfectly secure?

Let $m = 6$, and let $\mathbb{Z}_m$ denote the set $\{0,…,m-1\}$. Let $X \mod m$ denote the remainder obtained when dividing $X$ by $m$. (a) Consider the symmetric encryption scheme in ...
0
votes
2answers
94 views

Analyzing security flaws of cipher

I know using homebrew encryption can be very dangerous as it is very likely to have many flaws in its design. The following concept is just for learning purpose in case anybody is getting red flags ...
0
votes
1answer
770 views

detecting ROT13/base64 encryption

Is there anyway to detect that a cipher is encrypted with ROT13 Or Base64 without decrypting it using the algorithm and check that the result means (works)? I mean does an algorithm exists that test ...
0
votes
1answer
67 views

Secure blinding factor switching at malicious server-side (Switching in One Time pad)

Suppose all the values and operations are defined over a finite field $\mathbb{F}_p$ where $p$ is a large prime number. Assume all values are non-zero. Here $(z)^{-1}$ denotes multiplicative inverse ...
0
votes
1answer
105 views

What makes this mixer function resistant to differential cryptanalysis?

I recently learned how differential cryptanalysis works, and decided to have a play around with testing various designs for resistance against attack. My testing algorithm is essentially to loop ...
0
votes
1answer
76 views

Text in random image encoder: is it flawed?

I have created a small cryptographic programme: You input your text A random image is generated Random coordinate pairs in number equal to the chars of the message are generated. The red component ...
0
votes
1answer
297 views

How does Blowfish avoid successful cryptanalysis? [closed]

I have researched the Blowfish algorithm and am curious as to why there exists no effective cryptanalysis for this algorithm as of yet. What basic principles or features allow Blowfish to achieve ...
0
votes
2answers
394 views

Cryptographic Symmetric Stream Cipher

Let me know a cryptographic symmetric stream cipher system with only two functions say S() and P() and it should satisfy the ...
0
votes
2answers
48 views

RSA numerical questions

Let $n$ be the modular arithmetic, $p$ and $q$ the two large primes such that $n=p*q$ and $e$ the public exponent. Here they are two "simple" numerical questions: If $p = 13$ and $q = 17$, what is ...
0
votes
1answer
85 views

How secure is this modified Bazeries Cylinder?

This device is a modification of the Bazeries cylinder, it has two stacks of 5 rotors which each bear two alphabets plus numbers 0-9, one in correct order and one in random order ( 36 characters in ...
0
votes
1answer
82 views

How hard is it to recover $p$ if I can get $h(p) \oplus h(p^*) \oplus r$ and $h(r)$?

Assume that $h:\{0,1\}^* \rightarrow \{0,1\}^\lambda$ is a cryptologic hash function, $r$ is taken randomly from $\{0,1\}^\lambda$, $p$ is a low-entropy password and $p^*$ is a guess. Now we get $h(p) ...
0
votes
1answer
149 views

Finding Vigenère cipher key(s) [closed]

How can we find the key used with a Vigenère cipher in small number of steps? If we have text like: Peit Wokm! Mhfa fepatgb ets bvvrvxmea ebte bae twkd qiqi ...
0
votes
1answer
154 views

How do you implement a cipher as one lookup table?

I am reading up on whitebox cryptography and have trouble understanding how are ciphers implemented as one lookup table? assuming my plaintext is just 4 bits so the size of my lookup table should be ...
0
votes
2answers
109 views

Counter Mode with a sequence of zeros bits plaintext, is it secure?

I had a quiz last week in computer security course. There was a confusing question that I am still looking for a good and clear answer. First, I know that counter mode with a good block cipher is ...
0
votes
1answer
73 views

“Kernel attack” on MinRank — why do we guess $\left\lceil \frac k n \right\rceil$ vectors?

The kernel attack on MinRank is described here (page 5). My question refers to this line: Note that if $m = \left\lceil \frac k n \right\rceil$, the system essentially has only one solution ...
0
votes
1answer
109 views

rotational cryptanalysis on modulo multiplication?

I saw the paper 'Rotational Cryptanalysis of ARX', it is effective against design primitives using XOR, addition, and rotation. http://www.iacr.org/archive/fse2010/61470339/61470339.pdf However ...
0
votes
1answer
530 views

how to calculate non linearity of AES S-box?

S-box has to satisfy different design criteria. How to calculate non-linearity , propagation criteria for an AES S-box?
0
votes
1answer
326 views

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312

Prove that the affine cipher over Z26 has perfect secrecy if every key is used with equal probability of 1/312. Just some guidance/help with this problem would be greatly appreciated not sure how to ...
0
votes
1answer
155 views

A variant of Shamir secret sharing

Suppose implement the Shamir secret sharing as following: we select a degree $d$ polynomial $P$ with a zero coefficient of 0, and all other coefficents selected randomly from $Z_p$; and to this ...
0
votes
1answer
321 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 ...
0
votes
1answer
131 views

Prime factors of non-random keys

I have been working on a challenge i found on the internet. It is as follows: You've stumbled onto a significant vulnerability in a commonly used cryptographic library. It turns out that the ...
0
votes
1answer
277 views

Partially-known-plaintext attack of a stream cipher based on modular arithmetic

I have a function called $F$, using modular arithmetic as does RSA, defined as $$x\mapsto F(x) = g^x\bmod p$$ where $p$ is a 1024-bit prime and $g$ is a generator of $\mathbb Z_p^*$. A secret key $r$ ...
0
votes
1answer
64 views

Bicliques for permutations

So I'm trying to understand the complexity of the biclique attack on Grostl and I have some questions: 1) The paper introduces sliced bicliques where on Grostl one constructs a biclique of dimension ...
0
votes
1answer
326 views

modfied man in the middle attack diffie hellman

I have been given a problem in preparation for my cryptography final that I'm not sure how to solve. It asks me to suppose a scenario where instead of where an attacker would intercept some message ...
0
votes
1answer
541 views

WIN LM Password Hashes (using John the ripper) [closed]

In a problem set, we've been asked to use John The Ripper to crack a list of Win LANMAN passwords. They are of the following form: 953A55E36AB85C0B9DA92C18555E42E1:0169295E0A6A6B35B2DD9932D10C1978 ...
0
votes
1answer
395 views

What is the complexity of the Square attack against the reduced 4-rounds 128-bit Rijndael variant?

I'm looking at a square attack against a reduced version of AES-128 with only 4 rounds (with block and key size of each 128 bit). I have a set of 256 plaintext-ciphertext block pairs. What is the ...