Yao Sun

Orcid: 0000-0002-3429-3476

Affiliations:
  • Chinese Academy of Sciences, Institute of Information Engineering, State Key Laboratory of Information Security (SKLOIS), Beijing, China
  • Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing, China (PhD 2010)


According to our database1, Yao Sun authored at least 51 papers between 2009 and 2022.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
SuperBall: A New Approach for MILP Modelings of Boolean Functions.
IACR Trans. Symmetric Cryptol., 2022

Fine-Grained Human-Centric Tracklet Segmentation with Single Frame Supervision.
IEEE Trans. Pattern Anal. Mach. Intell., 2022

2021
Automatic Search of Cubes for Attacking Stream Ciphers.
IACR Trans. Symmetric Cryptol., 2021

Algorithms for computing greatest common divisors of parametric multivariate polynomials.
J. Symb. Comput., 2021

On the efficiency of solving Boolean polynomial systems with the characteristic set method.
J. Symb. Comput., 2021

Analyzing Boolean Functions via Solving Parametric Polynomial Systems.
J. Syst. Sci. Complex., 2021

Towards the Least Inequalities for Describing a Subset in Z<sub>2<sup>n</sup></sub>.
IACR Cryptol. ePrint Arch., 2021

Cube Attack against 843-Round Trivium.
IACR Cryptol. ePrint Arch., 2021

2020
On the Construction of Involutory MDS Matrices over \(\mathbb{F}_{2^{m}}\).
J. Syst. Sci. Complex., 2020

2019
Accurate Facial Image Parsing at Real-Time Speed.
IEEE Trans. Image Process., 2019

A Survey on Algorithms for Computing Comprehensive Gröbner Systems and Comprehensive Gröbner Bases.
J. Syst. Sci. Complex., 2019

Speeding Up the GVW Algorithm via a Substituting Method.
J. Syst. Sci. Complex., 2019

Applying Horner's Rule to Optimize Lightweight MDS Matrices.
Int. J. Digit. Crime Forensics, 2019

GPS: Group People Segmentation with Detailed Part Inference.
Proceedings of the IEEE International Conference on Multimedia and Expo, 2019

Preimage Attacks on Round-Reduced Keccak-224/256 via an Allocating Approach.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

Building Detail-Sensitive Semantic Segmentation Networks With Polynomial Pooling.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2019

2018
Composing Semantic Collage for Image Retargeting.
IEEE Trans. Image Process., 2018

A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials.
J. Syst. Sci. Complex., 2018

Learning adaptive receptive fields for deep image parsing networks.
Comput. Vis. Media, 2018

The lightest 4 × 4 MDS matrices over GL(4, 𝔽<sub>2</sub>).
Sci. China Inf. Sci., 2018

An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

Cross-Domain Human Parsing via Adversarial Feature and Label Adaptation.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Preimage Attacks on the Round-reduced Keccak with Cross-linear Structures.
IACR Trans. Symmetric Cryptol., 2017

A weakly supervised method for makeup-invariant face verification.
Pattern Recognit., 2017

Automated Reducible Geometric Theorem Proving and Discovery by Gröbner Basis Method.
J. Autom. Reason., 2017

RSVP: A Real-Time Surveillance Video Parsing System with Single Frame Supervision.
Proceedings of the 2017 ACM on Multimedia Conference, 2017

Time Traveler: A Real-time Face Aging System.
Proceedings of the 2017 ACM on Multimedia Conference, 2017

Face Aging with Contextual Generative Adversarial Nets.
Proceedings of the 2017 ACM on Multimedia Conference, 2017

On Checking Linear Dependence of Parametric Vectors.
Proceedings of the Intelligent Computing Theories and Application, 2017

Learning Adaptive Receptive Fields for Deep Image Parsing Network.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

Surveillance Video Parsing with Single Frame Supervision.
Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016
On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra.
J. Syst. Sci. Complex., 2016

An improvement over the GVW algorithm for inhomogeneous polynomial systems.
Finite Fields Their Appl., 2016

2015
On implementing signature-based Gröbner basis algorithms using linear algebraic routines from M4RI.
ACM Commun. Comput. Algebra, 2015

2014
A Monomial-Oriented GVW for Computing Gröbner Bases.
CoRR, 2014

An Improvement over the GVW Algorithm for Inhomogeneous Polynomial Systems.
CoRR, 2014

New constructions of APN polynomial functions in odd characteristic.
Appl. Algebra Eng. Commun. Comput., 2014

2013
An efficient method for computing comprehensive Gröbner bases.
J. Symb. Comput., 2013

An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system.
J. Symb. Comput., 2013

Signature-Based Gröbner Basis Algorithms - Extended MMM Algorithm for computing Gröbner bases.
CoRR, 2013

2012
A signature-based algorithm for computing Gröbner bases in solvable polynomial algebras.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

2011
The F5 algorithm in Buchberger's style.
J. Syst. Sci. Complex., 2011

Solving Detachability Problem for the Polynomial Ring by Signature-based Groebner Basis Algorithms
CoRR, 2011

A Generalized Criterion for Signature-based Algorithms to Compute Gröbner Bases
CoRR, 2011

A generalized criterion for signature related Gröbner basis algorithms.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Computing comprehensive Gröbner systems and comprehensive Gröbner bases simultaneously.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
On Computing Groebner Basis in the Rings of Differential Operators
CoRR, 2010

A New Proof of the F5 Algorithm
CoRR, 2010

A new algorithm for computing comprehensive Gröbner systems.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009
An Efficient Algorithm for Factoring Polynomials over Algebraic Extension Field
CoRR, 2009

The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings.
Proceedings of the Computer Mathematics, 2009


  Loading...