A public-key cryptosystem utilizing cyclotomic fields

DOI10.1007/BF01398010MaRDI QIDQ1894275zbMATH OpenOpenAlexFDO

Authors 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 fieldcryptosystemEuclidean divisionpublic-keyresidue symbols

Mathematics Subject Classification ID

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

Recommendations

• A public-key cryptosystem using purely cubic fields
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD
• scientific article; zbMATH DE number 5518675
• Public-key cryptosystems based on cubic finite field extensions
• scientific article; zbMATH DE number 1500484
• scientific article; zbMATH DE number 1931026
• An algebraic method for public-key cryptography
• An efficient probabilistic public-key cryptosystem over quadratic fields quotients
• A knapsack-type public key cryptosystem based on arithmetic in finite fields
• A public-key cryptosystem based on the group rings

Cites work

• scientific article; zbMATH DE number 3512041 (Why is no real title available?)
• scientific article; zbMATH DE number 3523707 (Why is no real title available?)
• A cubic RSA code equivalent to factorization
• A modification of the RSA public-key encryption procedure (Corresp.)
• Euclid's Algorithm in Cyclotomic Fields
• Euclidean number fields. I. II. III
• Explicit Bounds for Primality Testing and Related Problems
• Explicit forms of Kummer's complementary theorems to his law of quintic reciprocity.
• Lectures on number theory. Vol. 1, part 2, Vol. 2, Vol. 3
• On Principal Ideal Testing in Totally Complex Quartic Fields and the Determination of Certain Cyclotomic Constants
• On principal ideal testing in algebraic number fields
• On the computation of units and class numbers by a generalization of Lagrange's algorithm

Cited in

(15)

• A public key cryptosystem as hard as factorisation
• SOME PUBLIC-KEY CRYPTO-FUNCTIONS AS INTRACTABLE AS FACTORIZATION
• Efficient cryptosystems from \(2^k\)-th power residue symbols
• scientific article; zbMATH DE number 5518675 (Why is no real title available?)
• The eleventh power residue symbol
• Cryptoanalysis of cryptosystems based on the quadratic residue problem
• 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
• A type of public cryptosystem using polynomials and pell sequences
• New number-theoretic cryptographic primitives
• Some Public-Key Crypto-Functions as Intractable as Factorization
• An efficient seventh power residue symbol algorithm
• PUBLIC KEY CRYPTOSYSTEM USING A RECIPROCAL NUMBER WITH THE SAME INTRACTABILITY AS FACTORING A LARGE NUMBER
• scientific article; zbMATH DE number 5708377 (Why is no real title available?)
• Public key cryptography based on Moufang loops

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1894275)