Author:
Sedlacek Vladimir,Jancar Jan,Svenda Petr
Publisher
Springer International Publishing
Reference37 articles.
1. Albrecht, M.R., Massimo, J., Paterson, K.G., Somorovsky, J.: Prime and prejudice: primality testing under adversarial conditions. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 281–298. ACM, New York (2018).
https://doi.org/10.1145/3243734.3243787
2. American National Standard X9.62-1998, Public key cryptography for the financial services industry: the elliptic curve digital signature algorithm (ECDSA). Preliminary draft, Accredited Standards Committee X9 (1998)
3. Arnault, F.: Constructing Carmichael numbers which are strong pseudoprimes to several bases. J. Symb. Comput. 20(2), 151–161 (1995).
https://doi.org/10.1006/jsco
4. Arnault, F.: Rabin-Miller primality test: composite numbers which pass it. Math. Comput. 64(209), 355–361 (1995).
https://doi.org/10.1090/S0025-5718-1995-1260124-2
5. Bernstein, D.J., Lange, T.: SafeCurves: choosing safe curves for elliptic-curve cryptography (2017).
https://safecurves.cr.yp.to/