blob: 56aa72494aa9cae588bbcbb2def3f191bbdf161e (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
/*
This file is part of Anastasis
Copyright (C) 2020, 2021 Anastasis SARL
Anastasis is free software; you can redistribute it and/or modify it under the
terms of the GNU General Public License as published by the Free Software
Foundation; either version 3, or (at your option) any later version.
Anastasis is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR
A PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with
Anastasis; see the file COPYING.GPL. If not, see <http://www.gnu.org/licenses/>
*/
/**
* @file reducer/validation_XY_PRIME.c
* @brief anastasis reducer api
* @author Christian Grothoff
* @author Dominik Meister
* @author Dennis Neufeld
*/
#include <string.h>
#include <stdbool.h>
#include <stdio.h>
#include <gcrypt.h>
/**
* Function to validate a prime number.
*
* @param pr_number prime number to validate (input)
* @return true if pr_number is a prime, else false
*/
bool
XY_PRIME_check (const char *pr_number)
{
unsigned long long n;
char dummy;
gcry_mpi_t p;
bool is_prime;
if (1 != sscanf (pr_number,
"%llu%c",
&n,
&dummy))
return false;
p = gcry_mpi_set_ui (NULL,
(unsigned long) n);
is_prime = (0 == gcry_prime_check (p,
0));
gcry_mpi_release (p);
return is_prime;
}
|