A public-key cryptosystem utilizing cyclotomic fields

DOI10.1007/BF01398010zbMath0829.94005OpenAlexW2090015297MaRDI QIDQ1894275

Renate Scheidler, Hugh C. Williams

Publication date: 24 January 1996

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01398010

zbMATH Keywords

cyclotomic fieldEuclidean divisioncryptosystempublic-keyresidue symbols

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Cubic and quartic extensions (11R16) Cyclotomic extensions (11R18)

Related Items (6)

Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Extended Galbraith's test on the anonymity of IBE schemes from higher residuosity ⋮ Efficient algorithms for the gcd and cubic residuosity in the ring of Eisenstein integers ⋮ New number-theoretic cryptographic primitives ⋮ The eleventh power residue symbol ⋮ AN EFFICIENT SEVENTH POWER RESIDUE SYMBOL ALGORITHM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On principal ideal testing in algebraic number fields
• Euclidean number fields. I. II. III
• A cubic RSA code equivalent to factorization
• On the computation of units and class numbers by a generalization of Lagrange's algorithm
• On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic Constants
• Explicit Bounds for Primality Testing and Related Problems
• A modification of the RSA public-key encryption procedure (Corresp.)
• Euclid's Algorithm in Cyclotomic Fields
• Explicit forms of Kummer's complementary theorems to his law of quintic reciprocity.

This page was built for publication: A public-key cryptosystem utilizing cyclotomic fields