The following pages link to Mats Näslund (Q204361):
Displaying 16 items.
- Message authentication based on cryptographically secure CRC without polynomial irreducibility test (Q1696144) (← links)
- Practical construction and analysis of pseudo-randomness primitives (Q2482337) (← links)
- (Q2708625) (← links)
- Achieving Optimal Fairness from Biased Coinflips (Q2708630) (← links)
- (Q2757258) (← links)
- (Q3044319) (← links)
- All Bits in ax + b mod p are Hard (Q3452346) (← links)
- (Q4364539) (← links)
- (Q4409135) (← links)
- On the Bit Security of NTRUEncrypt (Q4414698) (← links)
- (Q4474190) (← links)
- Extraction of optimally unbiased bits from a biased source (Q4503565) (← links)
- (Q4552248) (← links)
- The security of all RSA and discrete log bits (Q5501189) (← links)
- Public Key Cryptography – PKC 2004 (Q5901801) (← links)
- Complexity bounds on general hard-core predicates. (Q5944107) (← links)