Mats Näslund

	2008
18		Marcos A. Simplício Jr., Paulo S. L. M. Barreto, Tereza Cristina M. B. Carvalho, Cintia B. Margi, Mats Näslund: The CURUPIRA-2 Block Cipher for Constrained Platforms: Specification and Benchmarking. PiLBA 2008
17		Johan Håstad, Mats Näslund: Practical Construction and Analysis of Pseudo-Randomness Primitives. J. Cryptology 21(1): 1-26 (2008)
	2006
16		Reinaldo Matushima, Yeda R. Venturini, Rony R. M. Sakuragui, Tereza Cristina M. B. Carvalho, Wilson Vicente Ruggiero, Mats Näslund, Makan Pourzandi: Multiple personal security domains. IWCMC 2006: 361-366
	2005
15		Jari Arkko, Pekka Nikander, Mats Näslund: Enhancing Privacy with Shared Pseudo Random Sequences. Security Protocols Workshop 2005: 187-196
	2004
14		Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: New Results on the Hardness of Diffie-Hellman Bits. Public Key Cryptography 2004: 159-172
13		Johan Håstad, Mats Näslund: The security of all RSA and discrete log bits. J. ACM 51(2): 187-230 (2004)
	2003
12		Mats Näslund, Igor Shparlinski, William Whyte: On the Bit Security of NTRUEncrypt. Public Key Cryptography 2003: 62-70
	2002
11		Wen-Ching W. Li, Mats Näslund, Igor Shparlinski: Hidden Number Problem with the Trace and Bit Security of XTR and LUC. CRYPTO 2002: 433-448
10		Maria Isabel Gonzalez Vasco, Mats Näslund, Igor Shparlinski: The Hidden Number Problem in Extension Fields and Its Applications. LATIN 2002: 105-117
	2001
9		Johan Håstad, Mats Näslund: Practical Construction and Analysis of Pseudo-Randomness Primitives. ASIACRYPT 2001: 442-459
8		Mikael Goldmann, Mats Näslund, Alexander Russell: Complexity Bounds on General Hard-Core Predicates. J. Cryptology 14(3): 177-195 (2001)
	2000
7		Mats Näslund, Alexander Russell: Extraction of optimally unbiased bits from a biased source. IEEE Transactions on Information Theory 46(3): 1093-1103 (2000)
	1999
6		Mats Näslund: On Steiner Triple Systems and Perfect Codes. Ars Comb. 53: (1999)
5		Johan Håstad, Mats Näslund: The Security of all RSA and Discrete Log Bits Electronic Colloquium on Computational Complexity (ECCC) 6(37): (1999)
	1998
4		Johan Håstad, Mats Näslund: The Security of Individual RSA Bits. FOCS 1998: 510-521
	1997
3		Mikael Goldmann, Mats Näslund: The Complexity of Computing Hard Core Predicates. CRYPTO 1997: 1-15
	1996
2		Mats Näslund: All Bits ax+b mod p are Hard (Extended Abstract). CRYPTO 1996: 114-128
	1995
1		Mats Näslund: Universal Hash Functions & Hard Core Bits. EUROCRYPT 1995: 356-366

Coauthor Index

1	Jari Arkko	[15]
2	Paulo S. L. M. Barreto	[18]
3	Tereza Cristina M. B. Carvalho	[16] [18]
4	Mikael Goldmann	[3] [8]
5	Johan Håstad	[4] [5] [9] [13] [17]
6	Wen-Ching W. Li	[11]
7	Cintia B. Margi	[18]
8	Reinaldo Matushima	[16]
9	Pekka Nikander	[15]
10	Makan Pourzandi	[16]
11	Wilson Vicente Ruggiero	[16]
12	Alexander Russell	[7] [8]
13	Rony R. M. Sakuragui	[16]
14	Igor Shparlinski	[10] [11] [12] [14]
15	Marcos A. Simplício Jr.	[18]
16	Maria Isabel Gonzalez Vasco	[10] [14]
17	Yeda R. Venturini	[16]
18	William Whyte	[12]

Colors in the list of coauthors