Mats Näslund

MaRDI QIDQ204361zbMATH OpenWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Message authentication based on cryptographically secure CRC without polynomial irreducibility test Cryptography and Communications	2018-02-14	Paper
All bits in \(ax + b\bmod p\) are hard Advances in Cryptology — CRYPTO ’96	2015-11-11	Paper
The security of all RSA and discrete log bits Journal of the ACM	2015-08-01	Paper
Public Key Cryptography – PKC 2004 Lecture Notes in Computer Science	2009-05-14	Paper
Practical construction and analysis of pseudo-randomness primitives Journal of Cryptology	2008-04-16	Paper
scientific article; zbMATH DE number 2086222 (Why is no real title available?)	2004-08-11	Paper
scientific article; zbMATH DE number 2081080 (Why is no real title available?)	2004-08-04	Paper
On the Bit Security of NTRUEncrypt Public Key Cryptography — PKC 2003	2003-07-27	Paper
scientific article; zbMATH DE number 1942436 (Why is no real title available?)	2003-06-30	Paper
scientific article; zbMATH DE number 1792655 (Why is no real title available?)	2002-08-29	Paper
scientific article; zbMATH DE number 1676656 (Why is no real title available?)	2001-11-25	Paper
Complexity bounds on general hard-core predicates. Journal of Cryptology	2001-11-07	Paper
Achieving Optimal Fairness from Biased Coinflips Cryptography and Computational Number Theory	2001-07-17	Paper
scientific article; zbMATH DE number 1588478 (Why is no real title available?)	2001-07-17	Paper
Extraction of optimally unbiased bits from a biased source IEEE Transactions on Information Theory	2000-09-07	Paper
scientific article; zbMATH DE number 1088223 (Why is no real title available?)	1998-03-17	Paper

Research outcomes over time

This page was built for person: Mats Näslund