Description:
I just launched my brand new signature service called "message.sign".
The domain is still missing but you can beta-test it if you want.
Hopefully you are not finding any bugs, let me know if you do :)
Sophie-Germain-Primes are prime numbers of the form q = 2p + 1 where p is also a prime.
In this challenge, sophie-germain-primes are used as prime numbers for RSA.
The problem is, that the primes q, r and s can be computed from p which makes this usage insecure.
Since we know that
This can be solved for p, and with that we can compute q, r, s and with these values we are able to compute
| import random | |
| def heapsort(data: list) -> list: | |
| data = heapify_array(data) | |
| for i in range(len(data) - 1, -1, -1): | |
| data[i], data[0] = data[0], data[i] | |
| data[:i] = heapify(data[:i], 0) |
| #include <mpi.h> | |
| #include <stdio.h> | |
| #define ROOT 0 | |
| #define COMM_TAG 1 | |
| int main(int argc, char *argv[]) | |
| { | |
| int communicator_size, process_rank; |
| import csv | |
| import os | |
| def main(): | |
| '''Main Methode of the analysis-tool''' | |
| data_path = "data/sensors" | |
| for sensor in os.listdir(data_path): |
| #!/usr/bin/python3 | |
| # -*- coding: utf-8 -*- | |
| """ | |
| A tool to create Markdowntables from Turingcode | |
| """ | |
| import sys | |
| import re |
| using System; | |
| using System.Collections.Generic; | |
| using System.ComponentModel; | |
| using System.Data; | |
| using System.Drawing; | |
| using System.Linq; | |
| using System.Text; | |
| using System.Threading.Tasks; | |
| using System.Windows.Forms; | |
| using newMV; |