Zhuojun Liu

According to our database1, Zhuojun Liu authored at least 48 papers between 1993 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Optimal extended warranty pricing and retailing strategies in a closed-loop supply chain.
Int. J. Prod. Res., May, 2023

2022
Improved Degree Evaluation and Superpoly Recovery methods with Application to Trivium.
CoRR, 2022

2019
Recent Results on Constructing Boolean Functions with (Potentially) Optimal Algebraic Immunity Based on Decompositions of Finite Fields.
J. Syst. Sci. Complex., 2019

Optimal joint selective imperfect maintenance and multiple repairpersons assignment strategy for complex multicomponent systems.
Int. J. Prod. Res., 2019

2018
Optimal selective maintenance decisions for large serial <i>k</i>-out-of-<i>n: G</i> systems under imperfect maintenance.
Reliab. Eng. Syst. Saf., 2018

Three new infinite families of bent functions.
Sci. China Inf. Sci., 2018

Optimization of the joint selective maintenance and repairperson assignment problem under imperfect maintenance.
Comput. Ind. Eng., 2018

Direct Constructions of (Involutory) MDS Matrices from Block Vandermonde and Cauchy-Like Matrices.
Proceedings of the Arithmetic of Finite Fields - 7th International Workshop, 2018

Lightweight Recursive MDS Matrices with Generalized Feistel Network.
Proceedings of the Advances in Information and Computer Security, 2018

2017
Further results on permutation polynomials of the form (x<sup>p<sup>m</sup></sup>-x+δ)<sup>s</sup>+L(x) over F<sub>p<sup>2m</sup></sub>.
Finite Fields Their Appl., 2017

2016
Dembowski-Ostrom polynomials from reversed Dickson polynomials.
J. Syst. Sci. Complex., 2016

2015
A combinatorial condition and Boolean functions with optimal algebraic immunity.
J. Syst. Sci. Complex., 2015

2014
A note on two classes of Boolean functions with optimal algebraic immunity.
J. Syst. Sci. Complex., 2014

Constructing 2<i>M</i>-variable Boolean Functionswith Optimal Algebraic Immunity Based on Polar Decomposition of.
Int. J. Found. Comput. Sci., 2014

Constructing Boolean Functions With Potential Optimal Algebraic Immunity Based on Additive Decompositions of Finite Fields.
CoRR, 2014

Constructing Boolean functions with potentially optimal algebraic immunity based on additive decompositions of finite fields (extended abstract).
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2.
Finite Fields Their Appl., 2013

Linearized polynomials over finite fields revisited.
Finite Fields Their Appl., 2013

Constructing $2m$-variable Boolean functions with optimal algebraic immunity based on polar decomposition of $\mathbb{F}_{2^{2m}}^*$
CoRR, 2013

2012
Constructing Generalized Bent Functions from Trace Forms of Galois Rings.
Proceedings of the Computer Mathematics, 2012

2011
A general conjecture similar to T-D conjecture and its applications in constructing Boolean functions with optimal algebraic immunity.
IACR Cryptol. ePrint Arch., 2011

1-Resilient Boolean Function with Optimal Algebraic Immunity.
IACR Cryptol. ePrint Arch., 2011

The Single Cycle T-functions.
IACR Cryptol. ePrint Arch., 2011

A new proof to the complexity of the dual basis of a type I optimal normal basis
CoRR, 2011

2009
Cryptanalysis and Improvement on a Threshold Proxy Signature Scheme.
J. Inf. Sci. Eng., 2009

Credit Risk and Policy of Digital Content Production Online Trading.
Proceedings of the Business Intelligence: Artificial Intelligence in Business, 2009

2008
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation.
IACR Cryptol. ePrint Arch., 2008

Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs.
Sci. China Ser. F Inf. Sci., 2008

Sure Interpolation and Its Application to Hierarchical Threshold Secret Sharing Scheme.
Proceedings of the 2008 International Symposium on Computer Science and Computational Technology, 2008

2007
A fast algorithm for solving the Sylvester structured total least squares problem.
Signal Process., 2007

Dynamic and Verifiable Secret Sharing Among Weighted Participants.
J. Syst. Sci. Complex., 2007

A delayed marine bacteriophage infection model.
Appl. Math. Lett., 2007

2005
On the Security of Some Nonrepudiable Threshold Proxy Signature Schemes.
Proceedings of the Information Security Practice and Experience, 2005

2004
Non-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing.
IACR Cryptol. ePrint Arch., 2004

Delegateable Signature Using Witness Indistinguishable and Witness Hiding Proofs.
IACR Cryptol. ePrint Arch., 2004

Provably Secure Delegation-by-Certification Proxy Signature Schemes.
IACR Cryptol. ePrint Arch., 2004

2003
The term orderings which are compatible with composition II.
J. Symb. Comput., 2003

A Verifiable Secret Sharing Scheme with Statistical zero-knowledge.
IACR Cryptol. ePrint Arch., 2003

The Statistical Zero-knowledge Proof for Blum Integer Based on Discrete Logarithm.
IACR Cryptol. ePrint Arch., 2003

2001
Remarks on Gröbner basis for ideals under composition.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

The membership problem for ideals of binomial skew polynomial rings.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

2000
Linear Strategy for Boolean Ring Based Theorem Proving.
J. Comput. Sci. Technol., 2000

1999
Object-oriented analysis of ELIMINO.
J. Comput. Sci. Technol., 1999

Preface.
J. Comput. Sci. Technol., 1999

1998
Well-Behaved Inference Rules for First-Order Theorem Proving.
J. Autom. Reason., 1998

1994
Height as a coefficient bound for univariate polynomial factors, part II.
SIGSAM Bull., 1994

Height as a coefficient bound for univariate polynomial factors.
SIGSAM Bull., 1994

1993
Some Results on Theorem Proving in Geometry over Finite Fields.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993


  Loading...