Linux iad1-shared-b7-18 6.6.49-grsec-jammy+ #10 SMP Thu Sep 12 23:23:08 UTC 2024 x86_64
Apache
: 67.205.6.31 | : 216.73.216.47
Cant Read [ /etc/named.conf ]
8.2.29
fernandoquevedo
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
lib /
python3 /
dist-packages /
rsa /
[ HOME SHELL ]
Name
Size
Permission
Action
__pycache__
[ DIR ]
drwxr-xr-x
__init__.py
1.57
KB
-rw-r--r--
_compat.py
1.45
KB
-rw-r--r--
asn1.py
1.7
KB
-rw-r--r--
cli.py
9.63
KB
-rw-r--r--
common.py
4.57
KB
-rw-r--r--
core.py
1.62
KB
-rw-r--r--
key.py
26.89
KB
-rw-r--r--
parallel.py
2.25
KB
-rw-r--r--
pem.py
3.9
KB
-rw-r--r--
pkcs1.py
15.77
KB
-rw-r--r--
pkcs1_v2.py
3.37
KB
-rw-r--r--
prime.py
4.99
KB
-rw-r--r--
py.typed
63
B
-rw-r--r--
randnum.py
2.59
KB
-rw-r--r--
transform.py
2.15
KB
-rw-r--r--
util.py
2.92
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : core.py
# Copyright 2011 Sybren A. Stüvel <sybren@stuvel.eu> # # Licensed under the Apache License, Version 2.0 (the "License"); # you may not use this file except in compliance with the License. # You may obtain a copy of the License at # # https://www.apache.org/licenses/LICENSE-2.0 # # Unless required by applicable law or agreed to in writing, software # distributed under the License is distributed on an "AS IS" BASIS, # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. # See the License for the specific language governing permissions and # limitations under the License. """Core mathematical operations. This is the actual core RSA implementation, which is only defined mathematically on integers. """ def assert_int(var: int, name: str) -> None: if isinstance(var, int): return raise TypeError("%s should be an integer, not %s" % (name, var.__class__)) def encrypt_int(message: int, ekey: int, n: int) -> int: """Encrypts a message using encryption key 'ekey', working modulo n""" assert_int(message, "message") assert_int(ekey, "ekey") assert_int(n, "n") if message < 0: raise ValueError("Only non-negative numbers are supported") if message > n: raise OverflowError("The message %i is too long for n=%i" % (message, n)) return pow(message, ekey, n) def decrypt_int(cyphertext: int, dkey: int, n: int) -> int: """Decrypts a cypher text using the decryption key 'dkey', working modulo n""" assert_int(cyphertext, "cyphertext") assert_int(dkey, "dkey") assert_int(n, "n") message = pow(cyphertext, dkey, n) return message
Close