Gecko [ v3.cesa.co.za ]

Linux cesa-www-main 6.1.0-49-cloud-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.174-1 (2026-05-26) x86_64
Apache/2.4.68 (Debian)
Server IP : 10.218.0.2 & Your IP : 216.73.216.28
Domains : Cant Read [ /etc/named.conf ]
User : www-data

Name	Size	Permission	Date
__pycache__	[ DIR ]	drwxr-xr-x	2026-06-08 18:08
LICENSE	10.47 KB	-rw-r--r--	1980-01-01 08:00
__init__.py	1.57 KB	-rw-r--r--	1980-01-01 08:00
asn1.py	1.7 KB	-rw-r--r--	1980-01-01 08:00
common.py	4.57 KB	-rw-r--r--	1980-01-01 08:00
core.py	1.62 KB	-rw-r--r--	1980-01-01 08:00
key.py	26.78 KB	-rw-r--r--	1980-01-01 08:00
pem.py	3.9 KB	-rw-r--r--	1980-01-01 08:00
pkcs1.py	15.83 KB	-rw-r--r--	1980-01-01 08:00
pkcs1_v2.py	3.37 KB	-rw-r--r--	1980-01-01 08:00
prime.py	4.99 KB	-rw-r--r--	1980-01-01 08:00
randnum.py	2.59 KB	-rw-r--r--	1980-01-01 08:00
transform.py	2.15 KB	-rw-r--r--	1980-01-01 08:00

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