Dwivedi AMittal RSaxena NAceto L(2019)Counting basic-irreducible factors mod p in deterministic poly-time and p-adic applicationsProceedings of the 34th Computational Complexity Conference10.4230/LIPIcs.CCC.2019.15(1-29)Online publication date: 17-Jul-2019
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2019.15
Dwivedi AMittal RSaxena NDavenport JWang DKauers MBradford R(2019)Efficiently Factoring Polynomials Modulo p4Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326233(139-146)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326233
Cheon JLee HSeo JAhn GYung MLi N(2014)A New Additive Homomorphic Encryption based on the co-ACD ProblemProceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security10.1145/2660267.2660335(287-298)Online publication date: 3-Nov-2014
https://dl.acm.org/doi/10.1145/2660267.2660335
Show More Cited By

Index Terms

On the generation of multivariate polynomials which are hard to factor
1. Computing methodologies
  1. Symbolic and algebraic manipulation
    1. Symbolic and algebraic algorithms
      1. Algebraic algorithms
2. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Nonlinear equations
    2. Numerical analysis
      1. Computations on polynomials
      2. Number-theoretic computations

Recommendations

Properties of Multivariate Homogeneous Orthogonal Polynomials

It is well-known that the denominators of Pade approximants can be considered as orthogonal polynomials with respect to a linear functional. This is usually shown by defining Pade-type approximants from so-called generating polynomials and then ...
Christoffel transformations for multivariate orthogonal polynomials

Polynomial perturbations of real multivariate measures are discussed and corresponding Christoffel type formulas are found. The 1D Christoffel formula is extended to the multidimensional realm: multivariate orthogonal polynomials are expressed in terms ...
Extracting numerical factors of multivariate polynomials from taylor expansions
SNC '09: Proceedings of the 2009 conference on Symbolic numeric computation

We present a method to extract factors of multivariate polynomials with complex coefficients in floating point arithmetic. We establish the connection between the reciprocal of a multivariate polynomial and its Taylor expansion. Since the multivariate ...

Comments

Information & Contributors

Information

Published In

STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing

June 1993

812 pages

ISBN:0897915917

DOI:10.1145/167088

Chairmen:
Rao Kosaraju
John Hopkins Univ., Baltimore, MD
,
David Johnson
AT&T Bell Lab.
,
Alok Aggarwal
IBM T. J. Watson Research Center,Yorktown Heights, NY

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1993

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC93

Sponsor:

SIGACT

STOC93: 25th Annual ACM Symposium on the Theory of Computing

May 16 - 18, 1993

California, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
501
Total Downloads

Downloads (Last 12 months)27
Downloads (Last 6 weeks)4

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Dwivedi AMittal RSaxena NAceto L(2019)Counting basic-irreducible factors mod p in deterministic poly-time and p-adic applicationsProceedings of the 34th Computational Complexity Conference10.4230/LIPIcs.CCC.2019.15(1-29)Online publication date: 17-Jul-2019
https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2019.15
Dwivedi AMittal RSaxena NDavenport JWang DKauers MBradford R(2019)Efficiently Factoring Polynomials Modulo p4Proceedings of the 2019 International Symposium on Symbolic and Algebraic Computation10.1145/3326229.3326233(139-146)Online publication date: 8-Jul-2019
https://dl.acm.org/doi/10.1145/3326229.3326233
Cheon JLee HSeo JAhn GYung MLi N(2014)A New Additive Homomorphic Encryption based on the co-ACD ProblemProceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security10.1145/2660267.2660335(287-298)Online publication date: 3-Nov-2014
https://dl.acm.org/doi/10.1145/2660267.2660335
Boneh DCorrigan-Gibbs H(2014)Bivariate Polynomials Modulo Composites and Their ApplicationsAdvances in Cryptology – ASIACRYPT 201410.1007/978-3-662-45611-8_3(42-62)Online publication date: 2014
https://doi.org/10.1007/978-3-662-45611-8_3
Cheon JHong HLee H(2014)Invertible Polynomial Representation for Private Set OperationsInformation Security and Cryptology -- ICISC 201310.1007/978-3-319-12160-4_17(277-292)Online publication date: 19-Oct-2014
https://doi.org/10.1007/978-3-319-12160-4_17
Narayanan SRaghunathan AVenkatesan RAl-Shaer EJin HHeileman G(2009)Obfuscating straight line arithmetic programsProceedings of the nineth ACM workshop on Digital rights management10.1145/1655048.1655057(47-58)Online publication date: 9-Nov-2009
https://dl.acm.org/doi/10.1145/1655048.1655057
Singh M(2004)Public key cryptography with matricesProceedings from the Fifth Annual IEEE SMC Information Assurance Workshop, 2004.10.1109/IAW.2004.1437810(146-152)Online publication date: 2004
https://doi.org/10.1109/IAW.2004.1437810
Cheng HLabahn GKaltofen EVillard G(2001)Computing all factorizations in ***Proceedings of the 2001 international symposium on Symbolic and algebraic computation10.1145/384101.384111(64-71)Online publication date: 1-Jul-2001
https://dl.acm.org/doi/10.1145/384101.384111
Shamir A(2001)Efficient Signature Schemes Based on Birational PermutationsAdvances in Cryptology — CRYPTO’ 9310.1007/3-540-48329-2_1(1-12)Online publication date: 13-Jul-2001
https://doi.org/10.1007/3-540-48329-2_1
Theobald T(2001)How to Break Shamir’s Asymmetric BasisAdvances in Cryptology — CRYPT0’ 9510.1007/3-540-44750-4_11(136-147)Online publication date: 13-Jul-2001
https://doi.org/10.1007/3-540-44750-4_11
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Properties of Multivariate Homogeneous Orthogonal Polynomials

Christoffel transformations for multivariate orthogonal polynomials

Extracting numerical factors of multivariate polynomials from taylor expansions