Rsaes-pkcs1-v1_5
RSAES-PKCS1-v1_5 is a PKCS #1 standard RSA encryption scheme that formats messages with type 2 padding before encryption.
Real-World Cryptography
RSA PKCS#1 v1.5 is an RSA encryption and signature specification version whose encryption encoding uses legacy padding vulnerable to adaptive padding-oracle attacks.
- How it is used
- Explains legacy RSA encryption padding and its failure under adaptive decryption queries.
- How deep it goes
- Describes padding, encryption behavior, and Bleichenbacher's attack, but stops short of attack mathematics or implementation details.
- Examples
- Uses m = 2, random padding, Figure 6.14, and Bleichenbacher's million-message attack.
- What you can do after
- Evaluate RSA encryption choices and avoid deploying PKCS#1 v1.5 where RSA-OAEP is available.
Read how Real-World Cryptography explains rsaes-pkcs1-v1_5 →
Software Security for Developers
RSAES-PKCS1-v1_5 is an RSA encryption scheme that encodes messages using the PKCS #1 version 1.5 encryption encoding method.
- How it is used
- Positions RSAES-PKCS1-v1_5 as a legacy encryption option to reject during RSA configuration.
- How deep it goes
- Defines the scheme, compares it with OAEP, and explains configuration risks without descending into padding internals or proofs.
- Examples
- Uses RSA key-size choices, legacy-system compatibility, downgrade scenarios, and AES hybrid-encryption steps as concrete examples.
- What you can do after
- Configure applications to reject RSAES-PKCS1-v1_5 and select RSA-OAEP for modern RSA encryption.
Read how Software Security for Developers explains rsaes-pkcs1-v1_5 →
Hacking Cryptography
PKCS #1 v1.5 is an RSA encoding standard that defines formatting and randomized padding for encryption and related operations.
- How it is used
- Protects RSA signatures from existential forgery by enforcing a structured encoded message.
- How deep it goes
- Defines the byte layout and traces cube-root forgery, emphasizing exact FF validation rather than general RSA theory.
- Examples
- Uses 00 01 headers, FF padding, ASN.1 hash identifiers, e = 3, cube roots, and forged signatures.
- What you can do after
- Diagnose/debug RSA signature verifiers by enforcing the complete PKCS #1 v1.5 structure and rejecting malformed padding.
Related concepts
- Bleichenbacher's e=3 forgery attackused by · Bleichenbacher's e=3 forgery attack is an RSA signature-forgery attack that exploits lax validation of PKCS #1 v1.5 signature padding when the public exponent is 3.
- signature forgery attackused by · A signature forgery attack produces a signature that a verifier accepts as authentic without authorization from the legitimate signer's private key.
- RSAkind of · RSA is a public-key cryptosystem based on the computational difficulty of factoring large composite integers and supporting encryption and digital signatures.
- paddingkind of · Padding is the addition of extra space, values, or data around or within a structure to satisfy size, alignment, layout, or processing requirements.
- rsa-oaepalternative to · RSA-OAEP is a randomized RSA encryption scheme that encodes plaintext with hash-based Optimal Asymmetric Encryption Padding before encryption.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.