Pawel Morawiecki

Orcid: 0000-0003-3349-8645

According to our database1, Pawel Morawiecki authored at least 33 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Shared file protection against unauthorised encryption using a Buffer-Based Signature Verification Method.
J. Inf. Secur. Appl., 2024

Can Models Help Us Create Better Models? Evaluating LLMs as Data Scientists.
CoRR, 2024

Towards More Realistic Membership Inference Attacks on Large Diffusion Models.
Proceedings of the IEEE/CVF Winter Conference on Applications of Computer Vision, 2024

File System Shield (FSS): A Pass-Through Strategy Against Unwanted Encryption in Network File Systems.
Proceedings of the Advances in Information and Computer Security, 2024

2023
The Compression Optimality of Asymmetric Numeral Systems.
Entropy, April, 2023

Hebbian Continual Representation Learning.
Proceedings of the 56th Hawaii International Conference on System Sciences, 2023

2022
Pseudorandom Bit Generation with Asymmetric Numeral Systems.
IACR Cryptol. ePrint Arch., 2022

Continual Learning with Guarantees via Weight Interval Constraints.
Proceedings of the International Conference on Machine Learning, 2022

Diverse Memory for Experience Replay in Continual Learning.
Proceedings of the 30th European Symposium on Artificial Neural Networks, 2022

2021
Compcrypt-Lightweight ANS-Based Compression and Encryption.
IEEE Trans. Inf. Forensics Secur., 2021

ANS-based Compression and Encryption with 128-bit Security.
IACR Cryptol. ePrint Arch., 2021

Adversarial Examples Detection and Analysis with Layer-wise Autoencoders.
Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, 2021

2020
Fast and Stable Interval Bounds Propagation for Training Verifiably Robust Models.
Proceedings of the 28th European Symposium on Artificial Neural Networks, 2020

2019
Malicious SHA-3.
Fundam. Informaticae, 2019

Differential Cryptanalysis of Round-Reduced SPECK Suitable for Internet of Things Devices.
IEEE Access, 2019

2018
Differential-linear and related key cryptanalysis of round-reduced scream.
Inf. Process. Lett., 2018

Differential cryptanalysis in ARX ciphers, Application to SPECK.
IACR Cryptol. ePrint Arch., 2018

Deep Neural Networks for Coreference Resolution for Polish.
Proceedings of the Eleventh International Conference on Language Resources and Evaluation, 2018

2017
Practical attacks on the round-reduced PRINCE.
IET Inf. Secur., 2017

Differential-linear and Impossible Differential Cryptanalysis of Round-reduced Scream.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

Differential and Rotational Cryptanalysis of Round-reduced MORUS.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

2016
SAT-based Cryptanalysis of Authenticated Ciphers from the CAESAR Competition.
IACR Cryptol. ePrint Arch., 2016

2015
Applications of Key Recovery Cube-attack-like.
IACR Cryptol. ePrint Arch., 2015

Malicious Keccak.
IACR Cryptol. ePrint Arch., 2015

2014
ICEPOLE: High-speed, Hardware-oriented Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2014

Cube Attacks and Cube-attack-like Cryptanalysis on the Round-reduced Keccak Sponge Function.
IACR Cryptol. ePrint Arch., 2014

Practical Complexity Cube Attacks on Round-Reduced Keccak Sponge Function.
IACR Cryptol. ePrint Arch., 2014

2013
A SAT-based preimage analysis of reduced Keccak hash functions.
Inf. Process. Lett., 2013

Preimage attacks on the round-reduced Keccak with the aid of differential cryptanalysis.
IACR Cryptol. ePrint Arch., 2013

Parallel authenticated encryption with the duplex construction.
IACR Cryptol. ePrint Arch., 2013

2012
Rotational cryptanalysis of round-reduced Keccak.
IACR Cryptol. ePrint Arch., 2012

Security margin evaluation of SHA-3 contest finalists through SAT-based attacks.
IACR Cryptol. ePrint Arch., 2012

2004
Efficient Method of Input Variable Partitioning in Functional Decomposition Based on Evolutionary Algorithms.
Proceedings of the 2004 Euromicro Symposium on Digital Systems Design (DSD 2004), Architectures, Methods and Tools, 31 August, 2004


  Loading...