Gecko [ gtgates.com ]

Linux ams-business-8.hostwindsdns.com 4.18.0-553.80.1.lve.el8.x86_64 #1 SMP Wed Oct 22 19:29:36 UTC 2025 x86_64
LiteSpeed
Server IP : 192.236.177.161 & Your IP : 216.73.216.50
Domains : Cant Read [ /etc/named.conf ]
User : ajzdfbpz

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2024-02-12 23:56
__init__.py	1.57 KB	-rw-r--r--	2022-07-20 10:28
asn1.py	1.75 KB	-rw-r--r--	2021-03-29 21:17
cli.py	9.94 KB	-rw-r--r--	2021-11-24 09:39
common.py	4.75 KB	-rw-r--r--	2021-11-24 10:00
core.py	1.67 KB	-rw-r--r--	2021-11-24 10:00
key.py	27.62 KB	-rw-r--r--	2022-04-13 08:57
parallel.py	2.35 KB	-rw-r--r--	2021-03-29 21:17
pem.py	4.03 KB	-rw-r--r--	2021-03-29 21:17
pkcs1.py	16.3 KB	-rw-r--r--	2022-07-20 09:28
pkcs1_v2.py	3.47 KB	-rw-r--r--	2021-11-24 10:00
prime.py	5.18 KB	-rw-r--r--	2021-11-24 10:00
py.typed	64 B	-rw-r--r--	2021-03-24 09:26
randnum.py	2.69 KB	-rw-r--r--	2021-03-29 21:15
transform.py	2.22 KB	-rw-r--r--	2021-11-24 10:00
util.py	3.02 KB	-rw-r--r--	2021-03-29 21:17

Rename

#  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