default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaul Stankovski Wagner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j10]Alfred Åkesson, Christian Gehrmann, Görel Hedin, Björn A. Johnsson, Boris Magnusson, Mattias Nordahl, Sara Ramezanian, Paul Stankovski Wagner:
A Trust Establishment and Key Management Architecture for Hospital-at-Home. ACM Trans. Comput. Heal. 6(1): 3:1-3:28 (2025)- 2024
- [i11]Joakim Brorsson, Elena Pagnin, Bernardo David, Paul Stankovski Wagner:
Consistency-or-Die: Consistency for Key Transparency. IACR Cryptol. ePrint Arch. 2024: 879 (2024) - [i10]Erik Mårtensson, Paul Stankovski Wagner:
The Number of the Beast: Reducing Additions in Fast Matrix Multiplication Algorithms for Dimensions up to 666. IACR Cryptol. ePrint Arch. 2024: 2063 (2024) - 2023
- [j9]Qian Guo
, Erik Mårtensson, Paul Stankovski Wagner:
Modeling and simulating the sample complexity of solving LWE using BKW-style algorithms. Cryptogr. Commun. 15(2): 331-350 (2023) - [c17]Joakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner:
PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials. CT-RSA 2023: 163-190 - [i9]Joakim Brorsson, Bernardo David, Lorenzo Gentile, Elena Pagnin, Paul Stankovski Wagner:
PAPR: Publicly Auditable Privacy Revocation for Anonymous Credentials. IACR Cryptol. ePrint Arch. 2023: 137 (2023) - 2022
- [i8]Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
Modeling and Simulating the Sample Complexity of solving LWE using BKW-Style Algorithms. IACR Cryptol. ePrint Arch. 2022: 988 (2022) - 2021
- [j8]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Improvements on Making BKW Practical for Solving LWE. Cryptogr. 5(4): 31 (2021) - [c16]Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
On the Sample Complexity of solving LWE using BKW-Style Algorithms. ISIT 2021: 2405-2410 - [i7]Qian Guo, Erik Mårtensson, Paul Stankovski Wagner:
On the Sample Complexity of solving LWE using BKW-Style Algorithms. CoRR abs/2102.02126 (2021) - 2020
- [c15]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Making the BKW Algorithm Practical for LWE. INDOCRYPT 2020: 417-439 - [i6]Alessandro Budroni, Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Making the BKW Algorithm Practical for LWE. IACR Cryptol. ePrint Arch. 2020: 1467 (2020)
2010 – 2019
- 2019
- [j7]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
Some cryptanalytic and coding-theoretic applications of a soft stern algorithm. Adv. Math. Commun. 13(4): 559-578 (2019) - [j6]Alexander Nilsson, Thomas Johansson, Paul Stankovski:
Error Amplification in Code-based Cryptography. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2019(1): 238-258 (2019) - [j5]Qian Guo, Thomas Johansson, Paul Stankovski Wagner:
A Key Recovery Reaction Attack on QC-MDPC. IEEE Trans. Inf. Theory 65(3): 1845-1861 (2019) - [j4]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
On the Asymptotics of Solving the LWE Problem Using Coded-BKW With Sieving. IEEE Trans. Inf. Theory 65(8): 5243-5259 (2019) - [i5]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski Wagner:
On the Asymptotics of Solving the LWE Problem Using Coded-BKW with Sieving. IACR Cryptol. ePrint Arch. 2019: 9 (2019) - 2018
- [c14]Joakim Brorsson, Paul Stankovski Wagner, Martin Hell:
Guarding the Guards: Accountable Authorities in VANETs. VNC 2018: 1-4 - [i4]Alexander Nilsson, Thomas Johansson, Paul Stankovski:
Error Amplification in Code-based Cryptography. IACR Cryptol. ePrint Arch. 2018: 1223 (2018) - 2017
- [c13]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski:
Coded-BKW with Sieving. ASIACRYPT (1) 2017: 323-346 - [c12]Linus Karlsson, Martin Hell, Paul Stankovski:
Improved Greedy Nonrandomness Detectors for Stream Ciphers. ICISSP 2017: 225-232 - [c11]Linus Karlsson, Martin Hell, Paul Stankovski:
Not So Greedy: Enhanced Subset Exploration for Nonrandomness Detectors. ICISSP (Revised Selected Papers) 2017: 273-294 - [c10]Qian Guo, Thomas Johansson, Erik Mårtensson, Paul Stankovski:
Information set decoding with soft information and some cryptographic applications. ISIT 2017: 1793-1797 - [c9]Tomás Fabsic, Viliam Hromada, Paul Stankovski, Pavol Zajac, Qian Guo, Thomas Johansson:
A Reaction Attack on the QC-LDPC McEliece Cryptosystem. PQCrypto 2017: 51-68 - [i3]Tomás Fabsic, Viliam Hromada, Paul Stankovski, Pavol Zajac, Qian Guo, Thomas Johansson:
A Reaction Attack on the QC-LDPC McEliece Cryptosystem. IACR Cryptol. ePrint Arch. 2017: 494 (2017) - 2016
- [c8]Qian Guo, Thomas Johansson, Paul Stankovski:
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors. ASIACRYPT (1) 2016: 789-815 - [i2]Qian Guo, Thomas Johansson, Paul Stankovski:
Coded-BKW: Solving LWE Using Lattice Codes. IACR Cryptol. ePrint Arch. 2016: 310 (2016) - [i1]Qian Guo, Thomas Johansson, Paul Stankovski:
A Key Recovery Attack on MDPC with CCA Security Using Decoding Errors. IACR Cryptol. ePrint Arch. 2016: 858 (2016) - 2015
- [j3]Hui Wang, Paul Stankovski, Thomas Johansson:
A generalized birthday approach for efficiently finding linear relations in ℓ-sequences. Des. Codes Cryptogr. 74(1): 41-57 (2015) - [c7]Qian Guo, Thomas Johansson, Paul Stankovski:
Coded-BKW: Solving LWE Using Lattice Codes. CRYPTO (1) 2015: 23-42 - 2014
- [j2]Paul Stankovski, Martin Hell, Thomas Johansson:
An Efficient State Recovery Attack on the X-FCSR Family of Stream Ciphers. J. Cryptol. 27(1): 1-22 (2014) - [c6]Paul Stankovski, Lennart Brynielsson, Martin Hell:
The efficiency of optimal sampling in the random S-box model. ISIT 2014: 1712-1716 - [c5]Christopher Jämthagen, Linus Karlsson, Paul Stankovski, Martin Hell:
eavesROP: Listening for ROP Payloads in Data Streams. ISC 2014: 413-424 - 2013
- [b1]Paul Stankovski:
Cryptanalysis of Selected Stream Ciphers. Lund University, Sweden, 2013 - 2012
- [j1]Paul Stankovski, Sushmita Ruj, Martin Hell, Thomas Johansson:
Improved distinguishers for HC-128. Des. Codes Cryptogr. 63(2): 225-240 (2012) - [c4]Paul Stankovski, Martin Hell, Thomas Johansson:
Analysis of Xorrotation with Application to an HC-128 Variant. ACISP 2012: 419-425 - [c3]Paul Stankovski, Martin Hell:
An optimal sampling technique for distinguishing random S-boxes. ISIT 2012: 846-850 - 2010
- [c2]Paul Stankovski:
Greedy Distinguishers and Nonrandomness Detectors. INDOCRYPT 2010: 210-226
2000 – 2009
- 2009
- [c1]Paul Stankovski, Martin Hell, Thomas Johansson:
An Efficient State Recovery Attack on X-FCSR-256. FSE 2009: 23-37
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 2025-02-20 19:52 CET 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:
