FURISC: FHE Encrypted URISC Design

  • Ayantika ChatterjeeEmail author
  • Khin Mi Mi Aung
Part of the Computer Architecture and Design Methodologies book series (CADM)


As stated by Gosser, “ Securing a computer system has traditionally been a battle of wits: the penetrator tries to find the holes, and the designer tries to close them”. Hence, for any secure program execution, the instruction flow should also be encrypted. However, finding suitable solution to determine the termination point of any encrypted program is still an open challenge. Encrypted termination requires handling of encrypted condition, which is infeasible by existing unencrypted processors. Thus, for outsourcing computations and achieving privacy, designs of processors which operate on encrypted data as well as address are extremely important. This chapter provides some insight on this issue.


  1. Becker GT, Regazzoni F, Paar C, Burleson WP (2013) Stealthy dopant-level hardware trojans. In: Proceedings of the 15th international conference on cryptographic hardware and embedded systems, CHES’13. Springer, Berlin, pp 197–214Google Scholar
  2. Bos JW, Lauter KE, Loftus J, Naehrig M (2013) Improved security for a ring-based fully homomorphic encryption scheme. In: Stam M (ed) IMA international conference, vol 8308. Lecture notes in computer science. Springer, Berlin, pp 45–64Google Scholar
  3. Brenner M, Perl H, Smith M (2012a) How practical is homomorphically encrypted program execution? an implementation and performance evaluation. In: Proceedings of the 11th IEEE international conference on trust, security and privacy in computing and communications, TrustCom 2012, Liverpool, United Kingdom, 25–27 June 2012, pp 375–382Google Scholar
  4. Brenner M, Perl H, Smith M (2012b) Practical applications of homomorphic encryption. In: SECRYPT 2012 - proceedings of the international conference on security and cryptography, Rome, Italy, 24–27 July 2012, pp 5–14Google Scholar
  5. Breuer PT, Bowen JP (2014) Idea: towards a working fully homomorphic crypto-processor - practice and the secret computer. In: ESSoS, pp 131–140Google Scholar
  6. Bruce Cousins David, Kurt Rohloff, Daniel Sumorok (2017) Designing an FPGA-accelerated homomorphic encryption co-processor. IEEE Trans Emerg Top Comput 5(2):193–206CrossRefGoogle Scholar
  7. Cao X, Moore C, O’Neill M, O’Sullivan E, Hanley N (2013) Accelerating fully homomorphic encryption over the integers with super-size hardware multiplier and modular reduction. IACR Cryptology ePrint ArchiveGoogle Scholar
  8. Doröz Y, Öztürk E, Sunar B (2015) Accelerating fully homomorphic encryption in hardware. IEEE Trans Comput 64(6):1509–1521MathSciNetzbMATHGoogle Scholar
  9. Doröz Y, Öztürk E, Sunar B (2013) Evaluating the hardware performance of a million-bit multiplier. In: DSD. IEEE Computer Society, pp 955–962Google Scholar
  10. Fletcher CW, Dijk Mv, Devadas S (2012) A secure processor architecture for encrypted computation on untrusted programs. In: Proceedings of the seventh ACM workshop on scalable trusted computing, STC ’12, ACM, New York, NY, USA, pp 3–8Google Scholar
  11. Gentry C, Halevi S (2011a) Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: IEEE 52nd annual symposium on foundations of computer science, FOCS 2011, Palm Springs, CA, USA, 22–25 Oct 2011, pp 107–109Google Scholar
  12. Gilreath WF, Laplante PA (2012) Computer architecture: a minimalist perspective. Springer Publishing Company Incorporated, BerlinzbMATHGoogle Scholar
  13. Goldwasser S, Kalai YT, Popa RA, Vaikuntanathan V, Zeldovich N (2013b) How to run turing machines on encrypted data. In: Advances in cryptology - CRYPTO 2013 - 33rd annual cryptology conference, Santa Barbara, CA, USA, 18–22 Aug 2013. Proceedings, Part II, pp 536–553Google Scholar
  14. Hauck S, Wilson WD (1999) Runlength compression techniques for FPGA configurations. In: Proceedings of the 7th IEEE symposium on field-programmable custom computing machines (FCCM ’99), pp 286–287Google Scholar
  15. Irena Florencia, Murphy Daniel, Parameswaran Sri (2018) CryptoBlaze: a partially homomorphic processor with multiple instructions and non-deterministic encryption support. ASP-DAC 2018:702–708Google Scholar
  16. Katz J, Lindell Y (2007) Introduction to modern cryptography (Chapman & Hall/CRC Cryptography and network security series). Chapman & Hall/CRCGoogle Scholar
  17. Koblitz N, Menezes A, Vanstone S (2000) The state of elliptic curve cryptography. Des Codes Cryptogr 19(2–3):173–193MathSciNetCrossRefGoogle Scholar
  18. Lindner R, Peikert C (2011) Better key sizes (and attacks) for lwe-based encryption. In: Proceedings of the 11th international conference on topics in cryptology: CT-RSA 2011, CT-RSA’11. Springer, Berlin, pp 319–339Google Scholar
  19. Lyubashevsky V (2008) Lattice-Based identification schemes secure under active attacks, pp 162–179Google Scholar
  20. Lyubashevsky V (2012) Lattice signatures without trapdoors. In: Proceedings of the 31st annual international conference on theory and applications of cryptographic techniques, EUROCRYPT’12, Springer, Berlin, pp 738–755Google Scholar
  21. Lyubashevsky V, Peikert C, Regev O (2010) On ideal lattices and learning with errors over rings. In: Proceedings of EUROCRYPT, volume 6110 of LNCS. Springer, pp 1–23Google Scholar
  22. Nelson M (1991) The data compression book. Henry Holt and Co. Inc, New YorkzbMATHGoogle Scholar
  23. Pöppelmann T, Naehrig M, Putnam A, Macias A (2015) Accelerating homomorphic evaluation on reconfigurable hardware. Springer, Berlin, pp 143–163zbMATHGoogle Scholar
  24. Pöppelmann T, Naehrig M, Putnam A, Macías A (201) Accelerating homomorphic evaluation on reconfigurable hardware. In: Proceedings of the cryptographic hardware and embedded systems - CHES 2015, pp 143–163Google Scholar
  25. Rivest RL, Shamir A, Adleman L (1978b) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120–126MathSciNetCrossRefGoogle Scholar
  26. Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings of the 35th annual symposium on foundations of computer science, SFCS ’94. IEEE Computer Society, Washington, DC, USA, pp 124–134Google Scholar
  27. Sinha Roy Sujoy, Frederik Vercauteren, Jo Vliegen, Verbauwhede, (2017) Ingrid hardware assisted fully homomorphic function evaluation and encrypted search. IEEE Trans Comput 66(9):1562–1572Google Scholar
  28. Sinha Roy S, Järvinen K, Vercauteren F, Dimitrov V, Verbauwhede I (2015) Modular hardware architecture for somewhat homomorphic function evaluation. Springer, Berlin, pp 164–184zbMATHGoogle Scholar
  29. Tsoutsos NG, Maniatakos M (2013a) Investigating the application of one instruction set computing for encrypted data computation. In: SPACE, pp 21–37Google Scholar
  30. Tsoutsos NG, Maniatakos M (2013b) Investigating the application of one instruction set computing for encrypted data computation. In: SPACE, pp 21–37Google Scholar
  31. Tsoutsos NG, Maniatakos M (2014) Heroic: homomorphically encrypted one instruction computer. In: Proceedings of the conference on design, automation & test in Europe, pp 246:1–246:6Google Scholar
  32. Wang W, Hu Y, Chen L, Huang X, Sunar B (2015) Exploring the feasibility of fully homomorphic encryption. IEEE Trans Comput 64(3):698–706MathSciNetCrossRefGoogle Scholar
  33. Wang W, Huang X (2013) Fpga implementation of a large-number multiplier for fully homomorphic encryption. In: ISCAS. IEEE, pp 2589–2592Google Scholar
  34. Wang W, Hu Y, Chen L, Huang X, Sunar B (2012) Accelerating fully homomorphic encryption using gpu. In: HPEC. IEEE, pp 1–5Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.Indian Institute of Technology KharagpurKharagpurIndia
  2. 2.Institute for Infocomm ResearchA*STARSingaporeSingapore

Personalised recommendations