Primes in quadratic unique factorization domains

The present paper is devoted to extension of a number of well-known results on natural primes for prime elements in quadratic UFD. We obtain analogues of Miller's, Euler's, Lucas' and Pocklington's criterions of primality in quadratic UFD. There is proved that an analogue of the...

Full description

Saved in:
Bibliographic Details
Published in:Journal of number theory 2016-11, Vol.168, p.101-116
Main Authors: Vaskouski, Maksim, Kondratyonok, Nikita, Prochorov, Nikolai
Format: Article
Language:English
Subjects:
Euclidean domain
Primality criterions
Quadratic UFD
RSA-cryptosystem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The present paper is devoted to extension of a number of well-known results on natural primes for prime elements in quadratic UFD. We obtain analogues of Miller's, Euler's, Lucas' and Pocklington's criterions of primality in quadratic UFD. There is proved that an analogue of the Miller–Rabin test can be realized in quadratic UFD and extended the Rabin result on probability of successful work of the Miller–Rabin test. We construct RSA-cryptosystem in quadratic domains and prove that there hold similar properties to RSA-cryptosystem on integers.
ISSN:0022-314X
1096-1658
DOI:10.1016/j.jnt.2016.04.022