Ping Wang

According to our database1, Ping Wang authored at least 18 papers between 2011 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Quantum algorithms for hash preimage attacks.
Quantum Eng., 2020

2018
Delay-Optimal Back-Pressure Routing Algorithm for Multihop Wireless Networks.
IEEE Trans. Veh. Technol., 2018

2017
High-Throughput Network Coding Aware Routing in Time-Varying Multihop Networks.
IEEE Trans. Veh. Technol., 2017

Multi-party quantum key agreement protocol secure against collusion attacks.
Quantum Inf. Process., 2017

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm.
Adv. Math. Commun., 2017

Sphere Decoding Algorithm Based on a New Radius Definition.
Proceedings of the Smart Computing and Communication, 2017

Multi-population Based Search Strategy Ensemble Artificial Bee Colony Algorithm with a Novel Resource Allocation Mechanism.
Proceedings of the Neural Information Processing - 24th International Conference, 2017

A New Lattice Sieving Algorithm Base on Angular Locality-Sensitive Hashing.
Proceedings of the Information Security and Cryptology - 13th International Conference, 2017

2016
Efficient multi-party quantum key agreement by cluster states.
Quantum Inf. Process., 2016

Efficient multiparty quantum key agreement protocol based on commutative encryption.
Quantum Inf. Process., 2016

Multiparty quantum key agreement protocol secure against collusion attacks.
CoRR, 2016

2015
Quantum private comparison with a malicious third party.
Quantum Inf. Process., 2015

2013
Speeding up elliptic curve discrete logarithm computations with point halving.
Des. Codes Cryptogr., 2013

Improving the Parallelized Pollard Rho Method for Computing Elliptic Curve Discrete Logarithms.
Proceedings of the 2013 Fourth International Conference on Emerging Intelligent Data and Web Technologies, 2013

2012
Improved Pollard rho method for computing discrete logarithms over finite extension fields.
J. Comput. Appl. Math., 2012

An Efficient Collision Detection Method for Computing Discrete Logarithms with Pollard's Rho.
J. Appl. Math., 2012

Computing elliptic curve discrete logarithms with the negation map.
Inf. Sci., 2012

2011
On Relationship of Computational Diffie-Hellman Problem and Computational Square-Root Exponent Problem.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011


  Loading...