Cryptology ePrint Archive: Report 2010/433
The PASSERINE Public Key Encryption and Authentication Mechanism
Markku-Juhani O. Saarinen
Abstract: PASSERINE is a lightweight public key encryption mechanism which is based on a hybrid, randomized variant of the Rabin public key encryption scheme. Its design is targeted for extremely low-resource applications such as wireless sensor networks, RFID tags, embedded systems, and smart cards. As is the case with the Rabin scheme, the security of PASSERINE can be shown to be equivalent to factoring the public modulus. On many low-resource implementation platforms PASSERINE offers smaller transmission latency, hardware and software footprint and better encryption speed when compared to RSA or Elliptic Curve Cryptography. This is mainly due to the fact that PASSERINE implementations can avoid expensive big integer arithmetic in favor of a fully parallelizable CRT randomized-square operation. In order to reduce latency and memory requirements, PASSERINE uses Naccache-Shamir randomized multiplication, which is implemented with a system of simultaneous congruences modulo small coprime numbers. The PASSERINE private key operation is of comparable computational complexity to the RSA private key operation. The private key operation is typically performed by a computationally superior recipient such as a base station.
Category / Keywords: public-key cryptography / Rabin Cryptosystem, Randomized Multiplication, RFID, Wireless Sensor Networks.
Publication Info: Nordsec 2010 short paper ("work in progress")
Date: received 6 Aug 2010, last revised 10 Oct 2010
Contact author: m saarinen at tkk fi
Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation
Note: PASSERINE v 0.7
Version: 20101010:102429 (All versions of this report)
Short URL: ia.cr/2010/433
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]