Weiqiang Wen

Orcid: 0000-0001-5272-2572

According to our database1, Weiqiang Wen authored at least 18 papers between 2014 and 2024.

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

2024
Compact Encryption based on Module-NTRU problems.
IACR Cryptol. ePrint Arch., 2024

2023
On the Hardness of Module Learning with Errors with Short Distributions.
J. Cryptol., 2023

A Generic Transform from Multi-Round Interactive Proof to NIZK.
IACR Cryptol. ePrint Arch., 2023

2022
Partial Key Exposure Attacks on BIKE, Rainbow and NTRU.
IACR Cryptol. ePrint Arch., 2022

Entropic Hardness of Module-LWE from Module-NTRU.
IACR Cryptol. ePrint Arch., 2022

Post-Quantum κ-to-1 Trapdoor Claw-free Functions from Extrapolated Dihedral Cosets.
CoRR, 2022

2021
On the Hardness of Module-LWE with Binary Secret.
IACR Cryptol. ePrint Arch., 2021

2020
Towards Classical Hardness of Module-LWE: The Linear Rank Case.
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-based Lattice Reduction: Root Hermite Factor k^(1/(2k)) in Time k^(k/8 + o(k)).
IACR Cryptol. ePrint Arch., 2020

Faster Enumeration-Based Lattice Reduction: Root Hermite Factor k<sup>1/(2k)</sup> Time k<sup>k/8+o(k)</sup>.
Proceedings of the Advances in Cryptology - CRYPTO 2020, 2020

2019
A refined analysis of the cost for solving LWE via uSVP.
IACR Cryptol. ePrint Arch., 2019

Middle-Product Learning with Rounding Problem and its Applications.
IACR Cryptol. ePrint Arch., 2019

2018
Contributions to the hardness foundations of lattice-based cryptography. (Contributions aux fondements de complexité de la cryptographie sur réseaux).
PhD thesis, 2018

Measuring, simulating and exploiting the head concavity phenomenon in BKZ.
IACR Cryptol. ePrint Arch., 2018

Learning with Errors and Extrapolated Dihedral Cosets.
Proceedings of the Public-Key Cryptography - PKC 2018, 2018

2016
Unified security model of authenticated key exchange with specific adversarial capabilities.
IET Inf. Secur., 2016

Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices.
IACR Cryptol. ePrint Arch., 2016

2014
One-Round Deniable Key Exchange with Perfect Forward Security.
IACR Cryptol. ePrint Arch., 2014


  Loading...