Research by Mats Näslund

Short Description

I was until quite recently a graduate student at the theoretical computer science group (TCS), NADA (Dept. of Numerical Analysis and Computing Science) at the Royal Institute of Technology, Stockholm, Sweden. (I am now at Ericsson Research.) I am doing work in the cryptography area, mainly pseudo-randomness. Another interest is digital cash systems.

Research Papers in Cryptography

Universal Hash Functions & Hard Core Bits

M. Näslund

Proceedings, EUROCRYPT '95, LNCS 921, pp 356-366, Springer-Verlag

All Bits in ax+b mod p are Hard

M. Näslund

Proceedings, CRYPT0 '96. LNCS 1109, pp 114-128, Springer-Verlag.

The Complexity of Computing Hard Core Predicates

M. Goldmann and M. Näslund

Proceedings, CRYPT0 '97. LNCS 1294, pp 1-15, Springer-Verlag.

The Security of Individual RSA Bits

J. Håstad and M. Näslund

Proceedings, FOCS '98, pp 510-519, IEEE

Research Papers in Mathematics

On Steiner Triple Systems and Perfect Codes

M. Näslund

Ars Combinatoria 53(1999), 129-132

Extraction of Optimally Unbiased Bits from a Biased Source

M. Näslund and A. Russell

IEEE Trans. on Information Theory 48(2000), no 3, 1093-1103

PhD Thesis

Bit Extraction, Hard-Core Predicates, and the Bit Security of RSA

M. Näslund

Available here in PostScript (185 pages, 1.8 Mb), the errata (also in .ps) and the abstract in an ASCII text file.