Andere Kunden interessierten sich auch für
![Lattice-Based Public-Key Cryptography in Hardware]( "Lattice-Based Public-Key Cryptography in Hardware")
Lattice-Based Public-Key Cryptography in Hardware41,99 €![Fully Homomorphic Encryption in Real World Applications]( "Fully Homomorphic Encryption in Real World Applications")
Fully Homomorphic Encryption in Real World Applications110,99 €![Fully Homomorphic Encryption in Real World Applications]( "Fully Homomorphic Encryption in Real World Applications")
Fully Homomorphic Encryption in Real World Applications110,99 €![Fault Tolerant Architectures for Cryptography and Hardware Security]( "Fault Tolerant Architectures for Cryptography and Hardware Security")
Fault Tolerant Architectures for Cryptography and Hardware Security103,99 €![Classical and Physical Security of Symmetric Key Cryptographic Algorithms]( "Classical and Physical Security of Symmetric Key Cryptographic Algorithms")
Classical and Physical Security of Symmetric Key Cryptographic Algorithms110,99 €![Classical and Physical Security of Symmetric Key Cryptographic Algorithms]( "Classical and Physical Security of Symmetric Key Cryptographic Algorithms")
Classical and Physical Security of Symmetric Key Cryptographic Algorithms110,99 €![Cryptology and Network Security with Machine Learning]( "Cryptology and Network Security with Machine Learning")
Cryptology and Network Security with Machine Learning161,99 €
This book describes the efficient implementation of public-key cryptography (PKC) to address the security challenges of massive amounts of information generated by the vast network of connected devices, ranging from tiny Radio Frequency Identification (RFID) tags to powerful desktop computers. It investigates implementation aspects of post quantum PKC and homomorphic encryption schemes whose security is based on the hardness of the ring-learning with error (LWE) problem. The work includes designing an FPGA-based accelerator to speed up computation on encrypted data in the cloud computer. It also proposes a more practical scheme that uses a special module called recryption box to assist homomorphic function evaluation, roughly 20 times faster than the implementation without this module.