Public-key cryptosystems based on cubic finite field extensions

DOI10.1109/18.796413MaRDI QIDQ4503477zbMATH OpenOpenAlexFDO

Authors Guang Gong, Lein Harn

Publication date 7 September 2000

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/32fd8eb479fd4de4eacfd7d4b5e9b65ec8aac7f1

zbMATH Keywords

characteristic sequencecubic finite field extensionpublic-key distribution schemeRSA-type encryptionthird-order linear feedback shift-register sequences

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Recommendations

• A Public-Key Cryptosystem Based on Shift Register Sequences
• A public-key cryptosystem using purely cubic fields
• scientific article; zbMATH DE number 2085212
• A cubic analogue of the RSA cryptosystem
• A PUBLIC-KEY CRYPTOSYSTEM BASED UPON EQUATIONS OVER A FINITE FIELD

Cited in

(33)

• Applications to cryptography of twisting commutative algebraic groups
• A cryptographic system based on finite field transforms
• Cryptanalysis of short secret exponents modulo RSA primes.
• A game-theoretical and cryptographical approach to crypto-cloud computing and its economical and financial aspects
• A public-key cryptosystem utilizing cyclotomic fields
• A refinement of Müller's cube root algorithm
• New \((k,l,m)\)-verifiable multi-secret sharing schemes based on XTR public key system
• A fully dynamic secret sharing scheme
• Point compression for the trace zero subgroup over a small degree extension field
• New cube root algorithm based on the third order linear recurrence relations in finite fields
• Message transmission for GH-public key cryptosystem
• An overview of trace based public key cryptography over finite fields
• Generating elements of orders dividing \(p^6 \pm p^5 + p^4 \pm p^3 + p^2 \pm+1\)
• Two methods of directly constructing probabilistic public-key encryption primitives based on third-order LFSR sequences
• Effective compression maps for torus-based cryptography
• The cubic public-key transformation
• Public-key cryptography based on a cubic extension of the Lucas functions
• Factor-4 and 6 compression of cyclotomic subgroups of \(\mathbb F^*_{2^{4m}}\) and \(\mathbb F^*_{3^{6m}}\)
• On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes
• A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft)
• A Public-Key Cryptosystem Based on Shift Register Sequences
• scientific article; zbMATH DE number 4093359 (Why is no real title available?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Verifiable multi-secret sharing based on LFSR sequences
• Generating Large Instances of the Gong-Harn Cryptosystem
• Trace expression of \(r\)-th root over finite field
• An optimal representation for the trace zero subgroup
• Two verifiable multi secret sharing schemes based on nonhomogeneous linear recursion and LFSR public-key cryptosystem
• On the k-th order LFSR sequence with public key cryptosystems
• Efficient computation of terms of linear recurrence sequences of any order
• New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
• On the application of rings of integer algebraic numbers to the construction of public-key cryptoschemes
• Linear complexity of ternary sequences formed on the basis of power residue classes

This page was built for publication: Public-key cryptosystems based on cubic finite field extensions

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