Cryptographic Applications of Sparse Polynomials Over Finite Rings

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-45247-8_17
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lower Bounds on Solutions of Quadratic Polynomials Defined Over Finite Rings

International Journal of Mathematics and Mathematical Sciences
Mathematics
2015English

Near-Rings of Polynomials Over Groups

Proceedings of the Edinburgh Mathematical Society
Mathematics
1985English

Finite Free Complexes Over Polynomial Rings

Notices of the American Mathematical Society
Mathematics
2018English

Finding Irreducible Polynomials Over Finite Fields

1986English

Deterministic Factorization of Polynomials Over Finite Fields

English

Polynomials Over Finite Fields: Relationships With Integers and Permutation Polynomials

English

Factoring Polynomials Over Finite Fields: A Survey

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
2001English

Solving Sparse Linear Equations Over Finite Fields

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
1986English

Functorial Finite Subcategories Over Triangular Matrix Rings

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1991English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy