Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDBenjamin Wesolowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c10]Benjamin Wesolowski
:
Orientations and the Supersingular Endomorphism Ring Problem. EUROCRYPT (3) 2022: 345-371- [i24]Luca De Feo, Antonin Leroux, Benjamin Wesolowski:
New algorithms for the Deuring correspondence: SQISign twice as fast. IACR Cryptol. ePrint Arch. 2022: 234 (2022) - [i23]Wouter Castryck, Marc Houben, Frederik Vercauteren, Benjamin Wesolowski:
On the decisional Diffie-Hellman problem for class group actions on oriented elliptic curves. IACR Cryptol. ePrint Arch. 2022: 345 (2022) - [i22]Benjamin Wesolowski:
Computing isogenies between finite Drinfeld modules. IACR Cryptol. ePrint Arch. 2022: 438 (2022) - 2021
- [j5]Ronald Cramer, Léo Ducas, Benjamin Wesolowski:
Mildly Short Vectors in Cyclotomic Ideal Lattices in Quantum Polynomial Time. J. ACM 68(2): 8:1-8:26 (2021) - [j4]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90(332): 2997-3022 (2021) - [c9]Luca De Feo, Cyprien Delpech de Saint Guilhem, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Christophe Petit, Javier Silva, Benjamin Wesolowski:
Séta: Supersingular Encryption from Torsion Attacks. ASIACRYPT (4) 2021: 249-278 - [c8]Benjamin Wesolowski:
The supersingular isogeny path and endomorphism ring problems are equivalent. FOCS 2021: 1100-1111 - [i21]Benjamin Wesolowski:
The supersingular isogeny path and endomorphism ring problems are equivalent. CoRR abs/2111.01481 (2021) - [i20]Benjamin Wesolowski:
The supersingular isogeny path and endomorphism ring problems are equivalent. IACR Cryptol. ePrint Arch. 2021: 919 (2021) - [i19]Benjamin Wesolowski:
Orientations and the supersingular endomorphism ring problem. IACR Cryptol. ePrint Arch. 2021: 1583 (2021) - 2020
- [j3]Benjamin Wesolowski:
Efficient Verifiable Delay Functions. J. Cryptol. 33(4): 2113-2147 (2020) - [c7]Luca De Feo, David Kohel, Antonin Leroux, Christophe Petit, Benjamin Wesolowski:
SQISign: Compact Post-quantum Signatures from Quaternions and Isogenies. ASIACRYPT (1) 2020: 64-93 - [c6]Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. CRYPTO (2) 2020: 243-273 - [i18]Koen de Boer, Léo Ducas, Alice Pellet-Mary, Benjamin Wesolowski:
Random Self-reducibility of Ideal-SVP via Arakelov Random Walks. IACR Cryptol. ePrint Arch. 2020: 297 (2020) - [i17]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. 2020: 965 (2020) - [i16]Luca De Feo, David Kohel, Antonin Leroux, Christophe Petit, Benjamin Wesolowski:
SQISign: compact post-quantum signatures from quaternions and isogenies. IACR Cryptol. ePrint Arch. 2020: 1240 (2020) - [i15]Karim Belabas, Thorsten Kleinjung, Antonio Sanso, Benjamin Wesolowski:
A note on the low order assumption in class group of an imaginary quadratic number fields. IACR Cryptol. ePrint Arch. 2020: 1310 (2020) - [i14]Benjamin Wesolowski, Ryan Williams:
Lower bounds for the depth of modular squaring. IACR Cryptol. ePrint Arch. 2020: 1461 (2020)
2010 – 2019
- 2019
- [c5]Léo Ducas, Maxime Plançon, Benjamin Wesolowski:
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm. CRYPTO (1) 2019: 322-351 - [c4]Benjamin Wesolowski:
Efficient Verifiable Delay Functions. EUROCRYPT (3) 2019: 379-407 - [i13]Thorsten Kleinjung, Benjamin Wesolowski:
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. CoRR abs/1906.10668 (2019) - [i12]Léo Ducas, Maxime Plançon, Benjamin Wesolowski:
On the Shortness of Vectors to be found by the Ideal-SVP Quantum Algorithm. IACR Cryptol. ePrint Arch. 2019: 234 (2019) - [i11]Thorsten Kleinjung, Benjamin Wesolowski:
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2019: 751 (2019) - 2018
- [j2]Cécile Pierrot, Benjamin Wesolowski:
Malleability of the blockchain's entropy. Cryptogr. Commun. 10(1): 211-233 (2018) - [i10]Benjamin Wesolowski:
Efficient verifiable delay functions. IACR Cryptol. ePrint Arch. 2018: 623 (2018) - [i9]Thorsten Kleinjung, Benjamin Wesolowski:
A new perspective on the powers of two descent for discrete logarithms in finite fields. IACR Cryptol. ePrint Arch. 2018: 647 (2018) - 2017
- [j1]Arjen K. Lenstra, Benjamin Wesolowski:
Trustworthy public randomness with sloth, unicorn, and trx. Int. J. Appl. Cryptogr. 3(4): 330-343 (2017) - [c3]Ronald Cramer, Léo Ducas, Benjamin Wesolowski:
Short Stickelberger Class Relations and Application to Ideal-SVP. EUROCRYPT (1) 2017: 324-348 - [c2]Alexandre Gélin, Benjamin Wesolowski:
Loop-Abort Faults on Supersingular Isogeny Cryptosystems. PQCrypto 2017: 93-106 - [i8]Dimitar Jetchev, Benjamin Wesolowski:
Horizontal isogeny graphs of ordinary abelian varieties and the discrete logarithm problem. IACR Cryptol. ePrint Arch. 2017: 53 (2017) - [i7]Alexandre Gélin, Benjamin Wesolowski:
Loop-abort faults on supersingular isogeny cryptosystems. IACR Cryptol. ePrint Arch. 2017: 374 (2017) - 2016
- [i6]Cécile Pierrot, Benjamin Wesolowski:
Malleability of the blockchain's entropy. IACR Cryptol. ePrint Arch. 2016: 370 (2016) - [i5]Ronald Cramer, Léo Ducas, Benjamin Wesolowski:
Short Stickelberger Class Relations and application to Ideal-SVP. IACR Cryptol. ePrint Arch. 2016: 885 (2016) - [i4]Ernest Hunter Brooks, Dimitar Jetchev, Benjamin Wesolowski:
Isogeny graphs of ordinary abelian varieties. IACR Cryptol. ePrint Arch. 2016: 947 (2016) - 2015
- [c1]Benjamin Wesolowski, Pascal Junod:
Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys. ICISC 2015: 53-68 - [i3]Dimitar Jetchev, Benjamin Wesolowski:
On Graphs of Isogenies of Principally Polarizable Abelian Surfaces and the Discrete Logarithm Problem. CoRR abs/1506.00522 (2015) - [i2]Arjen K. Lenstra, Benjamin Wesolowski:
A random zoo: sloth, unicorn, and trx. IACR Cryptol. ePrint Arch. 2015: 366 (2015) - [i1]Benjamin Wesolowski, Pascal Junod:
Ciphertext-Policy Attribute-Based Broadcast Encryption with Small Keys. IACR Cryptol. ePrint Arch. 2015: 836 (2015)
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-25 02:32 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 has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
