MCPcopy Create free account

hub / github.com/RsaCtfTool/RsaCtfTool / functions

Functions614 in github.com/RsaCtfTool/RsaCtfTool

Function_introot_gmpy
(n, r=2)
src/RsaCtfTool/lib/number_theory.py:145
Function_introot_gmpy2
(n, r=2)
src/RsaCtfTool/lib/number_theory.py:151
Function_invmod
(a, m)
src/RsaCtfTool/lib/number_theory.py:157
Function_iroot
(n, p)
src/RsaCtfTool/lib/number_theory.py:140
Function_is_congruent
(a, b, m)
src/RsaCtfTool/lib/number_theory.py:331
Function_is_divisible
(n, p)
src/RsaCtfTool/lib/number_theory.py:327
Function_is_square
(n)
src/RsaCtfTool/lib/number_theory.py:164
Function_isqrt_rem
(n)
src/RsaCtfTool/lib/number_theory.py:102
Function_lcm
(x, y)
src/RsaCtfTool/lib/number_theory.py:291
Function_lucas
(n)
src/RsaCtfTool/lib/number_theory.py:356
Function_mod
(a, b)
src/RsaCtfTool/lib/number_theory.py:319
Function_mul
(a, b)
src/RsaCtfTool/lib/number_theory.py:323
Function_next_prime
(n)
src/RsaCtfTool/lib/number_theory.py:236
Function_powmod
(b, e, m)
src/RsaCtfTool/lib/number_theory.py:335
Function_powmod_base_list
(base_lst, exp, mod)
src/RsaCtfTool/lib/number_theory.py:171
Function_powmod_exp_list
(base, exp_lst, mod)
src/RsaCtfTool/lib/number_theory.py:175
Function_primes_gmpy
(n)
src/RsaCtfTool/lib/number_theory.py:287
Function_remove
(n, p)
src/RsaCtfTool/lib/number_theory.py:113
Method_timeout_handler
(self, _signum, _frame)
src/RsaCtfTool/lib/utils.py:190
Functionaddpm1
(n)
src/RsaCtfTool/lib/system_primes.py:1300
Methodalarm_func
()
src/RsaCtfTool/lib/utils.py:197
Methodattack
Common factor attack
src/RsaCtfTool/attacks/multi_keys/common_factors.py:14
Methodattack
binary polynomial factoring
src/RsaCtfTool/attacks/single_key/binary_polynomial_factoring.py:16
Methodattack
Run partial_q attack with a timeout
src/RsaCtfTool/attacks/single_key/partial_q.py:14
Methodattack
Do nothing, used for multi-key attacks that succeeded so we just print the private key without spending any time factoring
src/RsaCtfTool/attacks/single_key/nullattack.py:12
Methodattack
Factors available online?
src/RsaCtfTool/attacks/single_key/wolframalpha.py:47
Methodattack
Run attack with Pollard Rho-brent
src/RsaCtfTool/attacks/single_key/williams_pp1.py:13
Methodattack
Try an attack where the public key has a common factor with the ciphertext - sourcekris
src/RsaCtfTool/attacks/single_key/comfact_cn.py:31
Methodattack
Run simple lattice attack with a timeout
src/RsaCtfTool/attacks/single_key/lattice.py:15
Methodattack
Run partial_d attack with a timeout
src/RsaCtfTool/attacks/single_key/partial_d.py:15
Methodcan_run
(self)
src/RsaCtfTool/attacks/single_key/wolframalpha.py:18
Functioncomposite_numbers
(known_primes)
tests/conftest.py:46
Functionerathostenes_sieve
Returns a list of primes < n
src/RsaCtfTool/lib/number_theory.py:243
Functionexample_cipher_files
(examples_dir)
tests/conftest.py:58
Functionexample_pub_files
(examples_dir)
tests/conftest.py:51
Functionexamples_dir
(repo_root)
tests/conftest.py:25
Functionfactor_ned_deterministic
800-56B R2 Recommendation for Pair-Wise Key Establishment Schemes Using Integer Factorization Cryptography in Appendix C.2.
src/RsaCtfTool/lib/number_theory.py:473
Functionfactordb_key_path
(examples_dir)
tests/conftest.py:75
Methodfind_class
(self, module, name)
src/RsaCtfTool/lib/pickling.py:8
Methodformat
(self, record)
src/RsaCtfTool/lib/customlogger.py:32
Methodhandle_timeout
(self, _signum, _frame)
src/RsaCtfTool/lib/timeout.py:16
Functionknown_primes
()
tests/conftest.py:41
Functionpytest_configure
(config)
tests/conftest.py:9
Functionrepo_root
()
tests/conftest.py:20
Functionsmall_rsa_key
()
tests/conftest.py:30
Functionsolve
(M, n, a, m, XX, invmod_Mn, F, x, beta)
src/RsaCtfTool/sage/roca_attack.py:5
Methodtest
Attack test case
src/RsaCtfTool/attacks/abstract_attack.py:60
Methodtest
(self)
src/RsaCtfTool/attacks/multi_keys/same_n_huge_e.py:42
Methodtest
(self)
src/RsaCtfTool/attacks/multi_keys/hastads.py:46
Methodtest
(self)
src/RsaCtfTool/attacks/multi_keys/common_modulus_related_message.py:43
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/partial_q.py:54
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/ecm.py:66
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/pastctfprimes.py:36
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/factorial_pm1_gcd.py:34
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/londahl.py:28
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/nonRSA.py:48
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/pollard_p_1.py:29
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/lehmer.py:24
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/rapid7primes.py:36
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/pollard_rho.py:26
Methodtest
Nothing to test
src/RsaCtfTool/attacks/single_key/nullattack.py:18
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/hart.py:25
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/mersenne_primes.py:86
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/factordb.py:54
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/cube_root.py:35
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/system_primes_gcd.py:38
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/siqs.py:99
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/primorial_pm1_gcd.py:38
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/lucas_gcd.py:26
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/pisano_period.py:45
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/quadratic_sieve.py:32
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/mersenne_pm1_gcd.py:31
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/ecm2.py:67
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/highandlowbitsequal.py:36
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/noveltyprimes.py:35
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/wiener.py:30
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/williams_pp1.py:37
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/pollard_strassen.py:36
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/qicheng.py:35
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/factor_2PN.py:41
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/prime_base_collision.py:28
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/boneh_durfee.py:50
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/XYXZ.py:40
Methodtest
FIXME: Implement testcase
src/RsaCtfTool/attacks/single_key/comfact_cn.py:35
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/fermat.py:24
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/lattice.py:42
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/classical_shor.py:38
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/neca.py:39
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/small_crt_exp.py:45
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/SQUFOF.py:22
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/lehman.py:25
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/smallfraction.py:36
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/strong_pseudoprime.py:26
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/z3_solver.py:89
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/kraitchik.py:24
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/dixon.py:32
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/compositorial_pm1_gcd.py:38
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/fibonacci_gcd.py:26
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/fermat_numbers_gcd.py:27
Methodtest
(self)
src/RsaCtfTool/attacks/single_key/partial_d.py:65
← previousnext →301–400 of 614, ranked by callers