Welcome to RSA signature benchmark as a service.

We don't trust third-party solutions so we implemented RSA ourselves using Square and Multiply algorithm!

The algorithm works pretty much like this:

Our environment is not perfectly sandboxed so data may be not entirely accurate and not repeatable between runs.

We will RSA-sign any messages from you.

If you want to verify the signatures, the RSA public key is:

e = 65537

N = 38128340283641422802661719742156964603621737810653491613515248018842136876409727212998774054781417622845013241975333532853155777176993659522258239483743882483105515791473788333468623357368925391

Put message below:

We don't trust third-party solutions so we implemented RSA ourselves using Square and Multiply algorithm!

The algorithm works pretty much like this:

def square_and_multiply(base, exponent, modulus): binary_exponent = to_binary(exponent) result = 1 for di in binary_exponent: square = result * result if di == 0: result = square % modulus else: result = (square * base) % modulus return resultWe like benchmarks so we will provide some CPU usage data after the operation.

Our environment is not perfectly sandboxed so data may be not entirely accurate and not repeatable between runs.

We will RSA-sign any messages from you.

If you want to verify the signatures, the RSA public key is:

e = 65537

N = 38128340283641422802661719742156964603621737810653491613515248018842136876409727212998774054781417622845013241975333532853155777176993659522258239483743882483105515791473788333468623357368925391

Put message below: