[Samsung Galaxy S20 / S20+ / S20 Ultra Questions & ] adfree:
This is at the moment "record"... need to beat...

50 % match of 256 Byte Modulus...

So I have 128 Byte...

IMHO my p is tooo big... because +1 and calculated Modulus is bigger...

I will try with smaller p but still with beginning F...

And q with E...

Prime number (Bitsize: 1024) (*): p
============================================================= hex ====
fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffee1

Prime number (Bitsize: 1024) (*): q
============================================================= hex ====
e0c2818755afd2d1e08da3728023b9f63180df093106db52b0985a986b1e5cf3506d66bf82a3ab26427b5a0dba063fe4e40e8655a77a59a4c3d56dc29bc37ec0383343c3bc8508ad65eaef5f68994cc4e75d5595e4830e2812169fd4c4c66c0cef1c0980c1b5f93542e7c7eecf863a05dd941bacc27cdb20216e6c6aa43b8cf0

Modulus (Bitsize: 2048): n=p*q
============================================================= hex ====
e0c2818755afd2d1e08da3728023b9f63180df093106db52b0985a986b1e5cf3506d66bf82a3ab26427b5a0dba063fe4e40e8655a77a59a4c3d56dc29bc37ec0383343c3bc8508ad65eaef5f68994cc4e75d5595e4830e2812169fd4c4c66c0cef1c0980c1b5f93542e7c7eecf863a05dd941bacc27cdb20216e6c6aa43b8bf405f0c946efe2a6b54135c2a257f284fe8085f4b209501e4c05326f1fe8f5cb38d559cf4c8a83201b77b60a9c72fe5e6453b765f93dd5804873b9f2d35fd4e680fe87078fa6db459abd9da409bc22ef409e5d0cf4d1132113b8a2d077658cdd7fef9158a6d4fd9d49fe26db455884f36c96f4f951f60656fa85347471e13cfef0

Euler's phi(n) function (*): phi(n)=(p-1)*(q-1)
============================================================= hex ====
e0c2818755afd2d1e08da3728023b9f63180df093106db52b0985a986b1e5cf3506d66bf82a3ab26427b5a0dba063fe4e40e8655a77a59a4c3d56dc29bc37ec0383343c3bc8508ad65eaef5f68994cc4e75d5595e4830e2812169fd4c4c66c0cef1c0980c1b5f93542e7c7eecf863a05dd941bacc27cdb20216e6c6aa43b8bf2252e47bf9a32d3e360a81f2fd7cecb084f0515a8d84942f9549a14877dd76e4584ec688d07df74f5353ab08eb8f81e7f6fa8dfa3965b26a3afe48510c41167c0c653c3cbea563ced57b2b4aa5389a27bb6ffb75eec9012eba68c30a2a0c6717300754f261347a414bb3f135688feb966b960dda533897bda63c608073d017320

Public exponent: e [1 < e < phi ; e and phi are coprime]
============================================================= hex ====
10001

Private exponent (*): d=(e^-1) mod phi
============================================================= hex ====
11b5c1d7141d62933f0a6a129f9e310d012192717af77b58aca99499e5f6e2841996453e59e0e39f84258c1700cd754367e4ed18dab57d52ca4b8af686a784d9489461868ed83cb2cd111203868e6dca2620e8998304009d8faf50b0c7408b4b099c3ff37150116eecf2ae8256bfd0da9d770a2736bbf7d8344a2b28cc00152ae35b1e342ec64a83e41ddb373dde01898a107080796a6c68910e03081a165b8e06c74a05b2d51cb625979649e8b14455ee4a7434c3a833073ad8dad3535fbbb928e778ca1c90e7041ca0ec336f99acbfeacf83776b547ee92a9a694aa7387bc0000d3e4b55c193603ed0dd89380a3a39a9e9c40d3c5e5ceffc64a2454fbd4981

Chinese Remainder Theorem (CRT) exponent 1 (*): dP=d mod (p-1)
============================================================= hex ====
cfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd5302acfd52f41

Chinese Remainder Theorem (CRT) exponent 2 (*): dQ=d mod (q-1)
============================================================= hex ====
56b5530925da6dc7800cc46890dcb78a2df0dc9a8c2a6c044b928b28cff267c38a5c9a4df995309ad2fd0971d03946ff03a842d4da868dfccd7c121b08c273acae41c0bbcb87bb2041f84f9e8c18d0100a7dec5da64994f58a7ce5ee4c778c09b55928a55e95d86d5ec15255640411705fda1a8f1c7cd48061c55ad80d41d80e

Chinese Remainder Theorem (CRT) coefficient (*): qInv=(q^-1) mod p
============================================================= hex ====
bc69933ea5bf75af624244eedce49bdcce6f0cf73cbebbc105510473d9e2efc5d05cdf4aa66655836dea53ea470af277b13ff9f556e0f93ced212465f2187efa1e6c1507c2fae4210a1acf3ffd91e06feed7e0536c65dc03cc7855c84ef019f3f5684e07a36bd3b032a3cec35836907ca70b793e5a1db49005bfb46c7f340e5c

Plaintext:
======================================================================

Message: m
============================================================= hex ====

Ciphertext: c = m^e mod n
============================================================= hex ====

Time to encrypt the message (m):
============================================================= sec ====

Time to decrypt the ciphertext (c) with the private key A:
============================================================= sec ====

Time to decrypt the ciphertext (c) with the private key B (CRT):
============================================================= sec ====

(*) Keep this information secret!

Goal is to check how close I can get to my Target Modulus... with stupid Luck...

To check if maybe Private Exponent can be Bruteforce...

Again.

This Modulus is from 2013... inside Root CA Cert...

Best Regards