Sökning: "Lightweight cryptography"
Visar resultat 1 - 5 av 6 avhandlingar innehållade orden Lightweight cryptography.
1. On Some Symmetric Lightweight Cryptographic Designs
Sammanfattning : This dissertation presents cryptanalysis of several symmetric lightweight primitives, both stream ciphers and block ciphers. Further, some aspects of authentication in combination with a keystream generator is investigated, and a new member of the Grain family of stream ciphers, Grain-128a, with built-in support for authentication is presented. LÄS MER
2. Lightweight Cryptographic Group Key Management Protocols for the Internet of Things
Sammanfattning : The Internet of Things (IoT) is increasingly becoming an integral component of many applications in consumer, industrial and other areas. Notions such as smart industry, smart transport, and smart world are, in large part, enabled by IoT. LÄS MER
3. Design and Implementation of Efficient and Secure Lightweight Cryptosystems
Sammanfattning : In recent years there has been a wide-spread deployment of battery-powered and passive devices such as RFID tags, systems with very strong limitations on area, cost and power budgets. Deploying cryptographic solutions for these systems is both important, because it could unlock several security-critical applications, and challenging, due to the stringent budgets: the overheads of even the smallest block ciphers are often one or more orders of magnitude too high. LÄS MER
4. Public Key Infrastructure and its applications for resource-constrained IoT
Sammanfattning : The Internet of Things (IoT) is rapidly expanding and IoT devices are being deployed in security-critical scenarios, such as in critical infrastructure monitoring and within e-health, and privacy-sensitive applications in hospitals and homes. With this, questions of security and safety become paramount. LÄS MER
5. Using Coding Techniques for Attacking Post-Quantum Cryptographic Assumptions and Systems
Sammanfattning : Post-quantum cryptography for resisting possible attacks from malicious quantum adversaries has become one of the key topics in recent cryptographic research. Its ultimate goal is to search for efficient and secure primitives replacing the factoring- and discrete log-based schemes in service that will be broken in polynomial time by Shor’s algorithm. LÄS MER