# Tagged Questions

The tag has no usage guidance.

1k views

### RSA least significant bit oracle attack

I have been reading up on RSA attacks and came across one that could be called a least-significant-bit (LSB) oracle attack. For the sake of clarity lets define RSA primes $(p, q)$, private key $d$ ...
312 views

### Attacking a hardware AES implementation if it leaks the intermediate round states

Let's say that we have a hardware AES implementation that, on request, will encrypt or decrypt a 16-byte block of data in ECB mode using a fixed key, but refuses to reveal its fixed key. In other ...
381 views

### Definition of the Decryption oracle

In the context of public-key encryption, what would be a formal definition of the decryption oracle? I know the informal definition (i.e., a function that is available to the adversary and that ...
615 views

### Is One Time Pad considered Chosen-Plaintext Attack Secure?

If we're considering Chosen-Plaintext Attack setting, then the adversary has access to the Encryption Oracle right, and we know that OTP is only considered secure if we use the key only once. How ...
97 views

### Could use an explanation of the notation for an oracle adversary

In the definition below, what exactly does it mean for the adversary (not even sure that's the correct term?) to equal one? $$\underset{K}{Pr} \left [A^{F_k(\cdot)} = 1 \right ]$$ Source (Page 22/...
93 views

### Encrypting decryption key

What's that property called when a scheme is secure even if you encrypt the decryption key? Some schemes have problems when your plaintext is the decryption key (or just the key if symmetric).
101 views

### have a question in the book “introduction to modern cryptography”

"introduction to modern cryptography. 2ed" in page 254 "By obtaining sufficiently many estimates and letting $x_{i}$ be the majority value, $A{'}$can ensure that $x_{i}$ is equal to $gl(x, e^{i})$ ...
162 views

### What is an easy method of proving that a cryptographic oracle attack is possible?

Lets say an application is using CBC mode without authentication. The application is generating cipher text. This cipher text can be manipulated by the attacker and then transmitted back to the ...
I have access to an oracle that can encrypt and partially decrypt a number with RSA-1024 algorithm. For encryption: $$C = M^e\bmod n$$ But for decryption, result will ...