Results 161 to 170 of about 7,081,606 (216)

Euclid's Algorithm in Cyclotomic Fields

Journal of the London Mathematical Society, 1975
openaire   +5 more sources

Secure and Efficient Lattice-Based Ring Signcryption Scheme for BCCL. [PDF]

Entropy (Basel)
Zhang Y, Duan P, Li C, Ahmad H, Zhang H.
europepmc   +1 more source

Diophantine equations in cyclotomic fields.

Journal für die reine und angewandte Mathematik (Crelles Journal), 1974
openaire   +1 more source

Threshold-adaptive pruning with multi-key homomorphic encryption for communication-efficient secure federated learning. [PDF]

PLoS One
Guo J, Liu R, Xing J.
europepmc   +1 more source

Summation-based Private Segmented Membership Test from Threshold-Fully Homomorphic Encryption. [PDF]

Proc Priv Enhanc Technol
Koirala N, Takeshita J, Stevens J, Jung T.   +3 more
europepmc   +1 more source

A note on cyclotomic fields

Inventiones Mathematicae, 1976
openaire   +2 more sources

End-to-End Privacy-Aware Federated Learning for Wearable Health Devices via Encrypted Aggregation in Programmable Networks. [PDF]

Sensors (Basel)
Khan H, Kavati R, Pulkaram SS, Jalooli A.   +3 more
europepmc   +1 more source

Cyclotomic fields with unique factorization

Masley, J.Myron, Montgomery, Hough L.
openaire   +1 more source

On the distribution of the signs of cyclotomic units of a cyclotomic field

openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

MONOGENEITY IN CYCLOTOMIC FIELDS

International Journal of Number Theory, 2010
A number field is said to be monogenic if its ring of integers is a simple ring extension ℤ[α] of ℤ. It is a classical and usually difficult problem to determine whether a given number field is monogenic and, if it is, to find all numbers α that generate a power integral basis {1, α, α2, …, αk} for the ring.
openaire   +1 more source