The PASSERINE Public Key Encryption and Authentication Mechanism
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.
KeywordsRabin Cryptosystem Randomized Multiplication RFID Wireless Sensor Networks
Unable to display preview. Download preview PDF.
- 4.Brugia, O., di Porto, A., Filiponi, P.: Un metodo per migliorare I’efficienza degli algoritmi di generazione delle chiavi crittografiche basati sull’impiego di grandi numeri primi. Note Recesioni e Notizie, Ministero Poste e Telecommunicazioni 33(1-2), 15–22 (1984)Google Scholar
- 6.Gaubatz, G., Kaps, J., Özturk, E., Sunar, B.: State of the Art in Ultra-Low Power Public Key Cryptography for Wireless Sensor Networks. In: PerCom 2005 Workshops, pp. 146–150. IEEE (2005)Google Scholar
- 8.Kleinjung, T., Aoki, K., Franke, J., Lenstra, A., Thomé, E., Bos, J., Gaudry, P., Kruppa, A., Montgomery, P., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. IACR Cryptology ePrint Archive: Report 2010/006 (2010), http://eprint.iacr.org/2010/006
- 9.Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press (1996)Google Scholar
- 11.Naccache, D.: Method, Sender Apparatus And Receiver Apparatus For Modulo Operation. US patent: US5479511 (December 26, 1995), European patent application: EP0611506 (August 24, 1994), World publication: WO9309620 (1993)Google Scholar
- 13.NIST. Specification for the Advanced Encryption Standard (AES) Federal Information Processing Standards Publication. FIPS-197, NIST (2001)Google Scholar
- 14.Oren, Y., Feldhofer, M.: A Low-Resource Public-Key Identification Scheme for RFID Tags and Sensor Nodes. In: WiSec 2009, pp. 59–68. ACM (2009)Google Scholar
- 15.NIST. Recommendation for Block Cipher Modes of Operation: The CCM Mode for Authentication and Confidentiality. NIST Special Publication 800-38 C, NIST (2004)Google Scholar
- 16.NIST. Recommendation for Block Cipher Modes of Operation: Galois/Counter Mode (GCM) and GMAC. NIST Special Publication 800-38 D, NIST (2007)Google Scholar
- 17.National Security Agency. NSA Suite B Cryptography, http://www.nsa.gov/ia/programs/suiteb_cryptography/
- 18.Rabin, M.C.: Digitalized Signatures and Public-Key Functions as Intractable as Factorization. MIT / LCS / TR-212, Massachusetts Institute of Technology (1979)Google Scholar