From post

A General Polynomial Selection Method and New Asymptotic Complexities for the Tower Number Field Sieve Algorithm.

, и . ASIACRYPT (1), том 10031 из Lecture Notes in Computer Science, стр. 37-62. (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Minimax Estimation of Quadratic Fourier Functionals., , и . CoRR, (2018)Challenges with Assessing the Impact of NFS Advances on the Security of Pairing-Based Cryptography., , и . Mycrypt, том 10311 из Lecture Notes in Computer Science, стр. 83-108. Springer, (2016)FPGA Based SoC Estimator and Constant Current Charging/Discharging Controller for Lead-Acid Battery., , , , и . CoRR, (2020)On the Reconstruction Risk of Convolutional Sparse Dictionary Learning., , и . CoRR, (2017)Nonparametric Density Estimation under Adversarial Losses., , , , , и . NeurIPS, стр. 10246-10257. (2018)n-Player Stochastic Duel Game Model with Applied Deep Learning and Its Modern Implications., , , , , , и . Sensors, 22 (6): 2422 (2022)Nonparanormal Information Estimation., и . ICML, том 70 из Proceedings of Machine Learning Research, стр. 3210-3219. PMLR, (2017)New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields., и . EUROCRYPT (1), том 9665 из Lecture Notes in Computer Science, стр. 429-458. Springer, (2016)Realization of Self-Demand Response Through Non-Intrusive Load Monitoring Algorithm., , и . CoRR, (2020)DARC: Differentiable ARchitecture Compression., , и . CoRR, (2019)