Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with ciphertext-only-attack
Search options not deleted
user 29742
A cyphertext-only attack is a form of cryptographic attack in which the attacker possesses only the encrypted message, with no corresponding plain text or segment of the key to work with.
2
votes
1
answer
669
views
Are the following schemes based on a pseudo-random permutation secure?
I am currently working on the following task:
Let F be a pseudorandom permutation.
Consider the encryption scheme for the message space $\{0, 1\}^n$ defined as follows: $Gen(1^n)$ chooses two random …
- 411
3
votes
2
answers
567
views
Are parts of a pseudorandom string also a pseudorandom string?
I am working on an exercise that encrypts a message using only the first $n$ bits of a pseudorandom generator's output $G(k)$, i.e. $F_k(m) := G(k)_{0...n−1} \oplus m$.
$k$ is chosen uniformly at ran …
- 411
4
votes
2
answers
3k
views
Given a pseudorandom function F, is $(F_k(r) \; | \; F_k(r + 1))$ also a PRF?
Given: F is a pseudorandom function, G is a pseudorandom generator with $l(n) = n+1$. The following schemes should be classified as being insecure, IND-COA secure, IND-CPA secure.
To encrypt $m \in …
- 411