query: RSA plaintext repetition attack, (same plaintext, different ciphertext)
positive_passages.docid: 21399
positive_passages.text: Deciphering the RSA encrypted message from three different public keys
negative_passages.docid: 124935
negative_passages.text: AES-CBC ciphertext manipulation with known IV and plaintext!
negative_passages.docid: 128081
negative_passages.text: RSA encryption. Breaking 2048 keys with index
negative_passages.docid: 120813
negative_passages.text: Why are RSA key sizes almost always a power of two?
negative_passages.docid: 125718
negative_passages.text: RSA key fingerprints don't match
negative_passages.docid: 35531
negative_passages.text: Block cipher fixed points (plaintext equal to ciphertext)
negative_passages.docid: 112039
negative_passages.text: Is RSA encryption with a private key the same as signature generation?
negative_passages.docid: 3765
negative_passages.text: Is it possible to obtain AES-128 key from a known ciphertext-plaintext pair?
negative_passages.docid: 109614
negative_passages.text: Understanding the length extension attack
negative_passages.docid: 26873
negative_passages.text: Is it possible to validate a Public Key in RSA?
negative_passages.docid: 93803
negative_passages.text: What security authorities and standards reject $e=3$ in RSA, when, and with what rationale?
negative_passages.docid: 41240
negative_passages.text: Generating a cryptographically secure, many-time use, symmetric encryption key
negative_passages.docid: 150612
negative_passages.text: How bad it is using the same IV twice with AES/GCM?
negative_passages.docid: 87659
negative_passages.text: SHA256 HMAC brute force with chosen plaintext attacks
negative_passages.docid: 40642
negative_passages.text: Using same modulus for RSA
negative_passages.docid: 148073
negative_passages.text: How much computing resource is required to brute-force RSA?
negative_passages.docid: 31454
negative_passages.text: IND-CPA security of mode of operation using triple AES with plaintext || IV+counter