Problem 46630. Find R*Rp-N*Np=1 given gcd(R,N)=1
Find Rp and Np, such that R*Rp-N*Np=1, given gcd(R,N)=1.
0<=Rp<N
0<=Np<R
Solution Stats
Problem Comments
-
1 Comment
HighPhi
on 15 Feb 2022
Solution tips: look into the Bezout Identity
Solution Comments
Show commentsGroup

Advanced Cryptography Algorithms and Mathematics
- 21 Problems
- 0 Finishers
- Determine RSA keys (public and private) given two prime number character strings (p and q)
- Create State Array for initiating SHA-3-224 Hash
- RSA encryption using public key
- RSA decryption
- Mask Generation Function (MGF1) for PKCS #1 Standard utilizing Optimal Asymmetric Encryption Padding for RSA Cryptography
- Optimal Asymmetric Encryption Padding of message for RSA Cryptography
- Optimal Asymmetric Encryption Padding decoding of message for RSA Cryptography
- Find R*Rp-N*Np=1 given gcd(R,N)=1
- Montgomery Reduction Algorithm (REDC)
- Inverse Number Theoretic Transform (iNTT)
- Number Theoretic Transform (NTT)
- Montgomery Multiplication
- Output the Montgomery Form of the Input Matrix
- RIPEMD160 Hash
- SHA256 Hashing
- Binary Array to Hex Representation
- String to Binary Representation
- AES-256 KeyExpansion()
- AES SubBytes() Transformation
- Elliptic Curve Cryptography (ECC) Point Addition
- Obtain the Bitcoin address associated to a given private key
Problem Recent Solvers12
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!