default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Wronski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Michal Wronski, Lukasz Dzierzkowski
:
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. 24(7&8): 541-564 (2024)- [c11]Adrian Cinal, Gabriel Wechta, Michal Wronski:
Hybrid Approach to Public-Key Algorithms in the Near-Quantum Era. ICCS (6) 2024: 375-388 - [c10]Mateusz Lesniak, Elzbieta Burek, Michal Wronski:
Unsafe Mechanisms of Bluetooth, E0 Stream Cipher Cryptanalysis with Quantum Annealing. ICCS (6) 2024: 389-404 - [i9]Michal Wronski, Mateusz Lesniak:
Transformation of the discrete logarithm problem over 𝔽2n to the QUBO problem using normal bases. CoRR abs/2409.18534 (2024) - 2023
- [c9]Olgierd Zolnierczyk, Michal Wronski:
Searching B-Smooth Numbers Using Quantum Annealing: Applications to Factorization and Discrete Logarithm Problem. ICCS (5) 2023: 3-17 - [c8]Ryszard Leniowski, Krzysztof Tomecki, Michal Wronski, Tomasz Szymanski:
Nesting Control Algorithm for the 3D/5D Printers, Based on the Virtual Forces and Collision Detection. PCC (2) 2023: 405-419 - [i8]Michal Wronski, Elzbieta Burek, Mateusz Lesniak:
(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: 1502 (2023) - 2022
- [j5]Elzbieta Burek, Michal Wronski, Krzysztof Mank, Michal Misztal:
Algebraic Attacks on Block Ciphers Using Quantum Annealing. IEEE Trans. Emerg. Top. Comput. 10(2): 678-689 (2022) - [c7]Ryszard Leniowski, Lucyna Leniowska, Michal Wronski, Krzysztof Tomecki, Marcin Grochowina, Lukasz Ryk:
Intelligent candidate recommendation system based on experimental calculation of the similarity model. FUZZ-IEEE 2022: 1-7 - [c6]Michal Wronski:
Practical Solving of Discrete Logarithm Problem over Prime Fields Using Quantum Annealing. ICCS (4) 2022: 93-106 - [c5]Elzbieta Burek, Michal Wronski:
Quantum Annealing and Algebraic Attack on Speck Cipher. ICCS (4) 2022: 143-149 - 2021
- [j4]Michal Wronski, Tomasz Kijko, Robert Drylo:
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications. Fundam. Informaticae 184(2): 107-139 (2021) - [c4]Michal Wronski:
Index Calculus Method for Solving Elliptic Curve Discrete Logarithm Problem Using Quantum Annealing. ICCS (6) 2021: 149-155 - [i7]Michal Wronski, Tomasz Kijko, Robert Drylo:
High-degree compression functions on alternative models of elliptic curves and their applications. CoRR abs/2111.04533 (2021) - [i6]Michal Wronski:
Application of Velusqrt algorithm to Huff's and general Huff's curves. IACR Cryptol. ePrint Arch. 2021: 73 (2021) - [i5]Michal Wronski:
Solving discrete logarithm problem over prime fields using quantum annealing and $\frac{n^3}{2}$ logical qubits. IACR Cryptol. ePrint Arch. 2021: 527 (2021) - [i4]Elzbieta Burek, Michal Misztal, Michal Wronski:
Algebraic attacks on block ciphers using quantum annealing. IACR Cryptol. ePrint Arch. 2021: 620 (2021) - 2020
- [i3]Robert Drylo, Tomasz Kijko, Michal Wronski:
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: 526 (2020)
2010 – 2019
- 2019
- [j3]Robert Drylo, Tomasz Kijko, Michal Wronski:
Determining Formulas Related to Point Compression on Alternative Models of Elliptic Curves. Fundam. Informaticae 169(4): 285-294 (2019) - 2017
- [j2]Michal Wronski, Robert Drylo, Tomasz Kijko, Piotr Bora:
Constructing Elliptic Curves for the GLV Method with Low-cost Decomposition. Fundam. Informaticae 153(4): 399-413 (2017) - [c3]Michal Wronski, Tomasz Kijko:
On the Possibility of Transformation of Multidimensional ECDLP into 1-Dimensional ECDLP. NuTMiC 2017: 37-47 - 2015
- [i2]Michal Wronski:
Faster point scalar multiplication on NIST elliptic curves over GF(p) using (twisted) Edwards curves over GF(p³). IACR Cryptol. ePrint Arch. 2015: 977 (2015) - [i1]Michal Wronski:
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: 1114 (2015)
2000 – 2009
- 2005
- [c2]Krzysztof Benedyczak, Michal Wronski, Aleksander Nowinski, Krzysztof Nowinski, Jaroslaw Wypychowski, Piotr Bala:
UNICORE as Uniform Grid Environment for Life Sciences. EGC 2005: 364-373 - 2004
- [j1]Jaroslaw Wypychowski, Jaroslaw Pytlinski, Lukasz Skorwider, Miroslaw Nazaruk, Krzysztof Benedyczak, Michal Wronski, Piotr Bala:
Life Sciences Grid in EUROGRID and GRIP Projects. New Gener. Comput. 22(2): 147-156 (2004) - 2003
- [c1]Jaroslaw Pytlinski, Lukasz Skorwider, Krzysztof Benedyczak, Michal Wronski, Piotr Bala, Valentina Huber:
Uniform Access to the Distributed Resources for the Computational Chemistry Using UNICORE. International Conference on Computational Science 2003: 307-315
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
