Michal Wronski
Orcid: 0000-0002-8679-9399
According to our database1,
Michal Wronski
authored at least 25 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Base of exponent representation matters - more efficient reduction of discrete logarithm problem and elliptic curve discrete logarithm problem to the QUBO problem.
Quantum Inf. Comput., June, 2024
Transformation of the discrete logarithm problem over 𝔽<sub>2<sup>n</sup></sub> to the QUBO problem using normal bases.
CoRR, 2024
Unsafe Mechanisms of Bluetooth, E<sub>0</sub> Stream Cipher Cryptanalysis with Quantum Annealing.
Proceedings of the Computational Science - ICCS 2024, 2024
Proceedings of the Computational Science - ICCS 2024, 2024
2023
(In)security of stream ciphers against quantum annealing attacks on the example of the Grain 128 and Grain 128a ciphers.
IACR Cryptol. ePrint Arch., 2023
Nesting Control Algorithm for the 3D/5D Printers, Based on the Virtual Forces and Collision Detection.
Proceedings of the Advanced, Contemporary Control, 2023
Searching B-Smooth Numbers Using Quantum Annealing: Applications to Factorization and Discrete Logarithm Problem.
Proceedings of the Computational Science - ICCS 2023, 2023
2022
IEEE Trans. Emerg. Top. Comput., 2022
Practical Solving of Discrete Logarithm Problem over Prime Fields Using Quantum Annealing.
Proceedings of the Computational Science - ICCS 2022, 2022
Proceedings of the Computational Science - ICCS 2022, 2022
Intelligent candidate recommendation system based on experimental calculation of the similarity model.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2022
2021
Solving discrete logarithm problem over prime fields using quantum annealing and $\frac{n^3}{2}$ logical qubits.
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
IACR Cryptol. ePrint Arch., 2021
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications.
Fundam. Informaticae, 2021
Index Calculus Method for Solving Elliptic Curve Discrete Logarithm Problem Using Quantum Annealing.
Proceedings of the Computational Science - ICCS 2021, 2021
2020
Efficient Montgomery-like formulas for general Huff's and Huff's elliptic curves and their applications to the isogeny-based cryptography.
IACR Cryptol. ePrint Arch., 2020
2019
Determining Formulas Related to Point Compression on Alternative Models of Elliptic Curves.
Fundam. Informaticae, 2019
2017
Fundam. Informaticae, 2017
On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP.
Proceedings of the Number-Theoretic Methods in Cryptology - First International Conference, 2017
2015
Faster arithmetic on elliptic curves using Fp2. Application to GLV-GLS and NIST elliptic curves over Fp isomorphic to twisted Hessian curves over fields extension.
IACR Cryptol. ePrint Arch., 2015
Faster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³).
IACR Cryptol. ePrint Arch., 2015
2005
Proceedings of the Advances in Grid Computing, 2005
2004
2003
Uniform Access to the Distributed Resources for the Computational Chemistry Using UNICORE.
Proceedings of the Computational Science - ICCS 2003, 2003