Fast Arithmetic for Public-Key Algorithms in Galois Fields With Composite Exponents

IEEE Transactions on Computers - United States
doi 10.1109/12.805153
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Improved Algorithms for Efficient Arithmetic on Elliptic Curves Using Fast Endomorphisms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields

SIAM Journal on Computing
MathematicsComputer Science
1990English

Imaginary Quadratic Fields With Isomorphic Abelian Galois Groups

The Open Book Series
2013English

Reducible Galois Representations and Arithmetic Homology for \Protect \Mathrm{GL}(4)

Annales mathématiques Blaise Pascal
2018English

A Bit-Serial Multiplier Architecture for Finite Fields Over Galois Fields

Journal of Computer Science
Computer NetworksSoftwareArtificial IntelligenceCommunications
2010English

Quantum Query Algorithms for Automorphisms of Galois Groups

2013English

Quandles Associated to Galois Covers of Arithmetic Schemes

Kyushu Journal of Mathematics
Mathematics
2019English

Arithmetic of Division Fields

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
2012English

A New Sender-Side Public-Key Deniable Encryption Scheme With Fast Decryption

KSII Transactions on Internet and Information Systems
Computer NetworksInformation SystemsCommunications
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy