Qi Cheng

J. Maurice Rojas

J. Complex., 2022

LWE from non-commutative group rings.

[BibT_eX]

[DOI]

Jun Zhang

Des. Codes Cryptogr., 2022

2021

On the Ideal Shortest Vector Problem over Random Rational Primes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2019

A faster method to compute primitive elements and discrete logarithms of factor base in Artin-Schreier extensions.

[BibT_eX]

[DOI]

Dianyan Xiao

Sci. China Inf. Sci., 2019

2018

Factor base discrete logarithms in Kummer extensions.

[BibT_eX]

[DOI]

Dianyan Xiao

Finite Fields Their Appl., 2018

2017

Sparse univariate polynomials with many roots over finite fields.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2017

Counting Roots of Polynomials Over Prime Power Rings.

[BibT_eX]

[DOI]

CoRR, 2017

2016

On Determining Deep Holes of Generalized Reed-Solomon Codes.

[BibT_eX]

[DOI]

Jiyou Li

IEEE Trans. Inf. Theory, 2016

Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields.

[BibT_eX]

[DOI]

J. Maurice Rojas

SIAM J. Comput., 2016

LWE from Non-commutative Group Rings.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2016

2015

On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2).

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

On Generating Coset Representatives of PGL2(Fq) in PGL2(Fq2).

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - 11th International Conference, 2015

2014

Lower bounds of shortest vector lengths in random NTRU lattices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Traps to the BGJT-algorithm for discrete logarithms.

[BibT_eX]

[DOI]

LMS J. Comput. Math., 2014

2013

On certain computations of Pisot numbers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields.

[BibT_eX]

[DOI]

J. Maurice Rojas

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012

A Deterministic Reduction for the Gap Minimum Distance Problem.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Constructing high order elements through subspace polynomials.

[BibT_eX]

[DOI]

Shuhong Gao

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2011

On the minimum gap between sums of square roots of small integers.

[BibT_eX]

[DOI]

Yu-Hsin Li

Theor. Comput. Sci., 2011

Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Counting Value Sets: Algorithm and Complexity

[BibT_eX]

[DOI]

Joshua E. Hill

CoRR, 2011

2010

Complexity of decoding positive-rate primitive Reed-Solomon codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing.

[BibT_eX]

[DOI]

Sergey P. Tarasov

Mikhail N. Vyalyi

Theory Comput. Syst., 2010

Bounding the sum of square roots via lattice reduction.

[BibT_eX]

[DOI]

Math. Comput., 2010

Finding the Smallest Gap between Sums of Square Roots.

[BibT_eX]

[DOI]

Yu-Hsin Li

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

A deterministic reduction for the gap minimum distance problem: [extended abstract].

[BibT_eX]

[DOI]

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

Hard Problems of Algebraic Geometry Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

A Number Theoretic Memory Bounded Function and Its Applications.

[BibT_eX]

[DOI]

Yu-Hsin Li

Proceedings of the 9th International Conference for Young Computer Scientists, 2008

Complexity of Decoding Positive-Rate Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

2007

Constructing Finite Field Extensions with Large Order Elements.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

On the List and Bounded Distance Decodability of Reed-Solomon Codes.

[BibT_eX]

[DOI]

SIAM J. Comput., 2007

Primality Proving via One Round in ECPP and One Iteration in AKS.

[BibT_eX]

[DOI]

J. Cryptol., 2007

On Deciding Deep Holes of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Elizabeth Murray

Proceedings of the Theory and Applications of Models of Computation, 2007

Derandomization of Sparse Cyclotomic Integer Zero Testing.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

2006

Partial Lifting and the Elliptic Curve Discrete Logarithm Problem.

[BibT_eX]

[DOI]

Ming-Deh A. Huang

Algorithmica, 2006

On Comparing Sums of Square Roots of Small Integers.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

Complexities for Generalized Models of Self-Assembly.

[BibT_eX]

[DOI]

Gagan Aggarwal

Michael H. Goldwasser

Ming-Yang Kao

Pablo Moisset de Espanés

Robert T. Schweller

SIAM J. Comput., 2005

On the construction of finite field elements of large order.

[BibT_eX]

[DOI]

Finite Fields Their Appl., 2005

2004

On the ultimate complexity of factorials.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On counting and generating curves over small finite fields.

[BibT_eX]

[DOI]

Ming-Deh A. Huang

J. Complex., 2004

Invadable self-assembly: combining robustness with efficiency.

[BibT_eX]

[DOI]

Pablo Moisset de Espanés

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

On the List and Bounded Distance Decodibility of the Reed-Solomon Codes (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003

Straight-line programs and torsion points on elliptic curves.

[BibT_eX]

[DOI]

Comput. Complex., 2003

2002

Kolmogorov random graphs only have trivial stable colorings.

[BibT_eX]

[DOI]

Fang Fang

Inf. Process. Lett., 2002

A New Class of Unsafe Primes.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2002

Combinatorial optimization problems in self-assembly.

[BibT_eX]

[DOI]

Pablo Moisset de Espanés

Paul W. K. Rothemund

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Some Remarks on the L-Conjecture.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

Nonuniform Polynomial Time Algorithm to Solve Decisional Diffie-Hellman Problem in Finite Fields under Conjecture.

[BibT_eX]

[DOI]

Shigenori Uchiyama

Proceedings of the Topics in Cryptology, 2002

2001

Running time and program size for self-assembled squares.

[BibT_eX]

[DOI]

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

2000

Computing simple paths among obstacles.

[BibT_eX]

[DOI]

Marek Chrobak

Gopalakrishnan Sundaram

Comput. Geom., 2000

Factoring Polynominals over Finite Fields and Stable Colorings of Tournaments.

[BibT_eX]

[DOI]

Ming-Deh A. Huang

Proceedings of the Algorithmic Number Theory, 4th International Symposium, 2000

1997

MNP: A class of NP optimization problems.

[BibT_eX]

[DOI]

Hong Zhu

J. Comput. Sci. Technol., 1997

1995

MNP: A Class of NP Optimization Problems (Extended Abstract).

[BibT_eX]

[DOI]