Results 51 to 60 of about 380,993 (266)
A New Algorithm for Solving Ring-LPN with a Reducible Polynomial [PDF]
, 2014 The LPN (Learning Parity with Noise) problem has recently proved to be of great importance in cryptology. A special and very useful case is the RING-LPN problem, which typically provides improved efficiency in the constructed cryptographic primitive.
Guo, Qian +2 more
core +1 more source
Post-quantum cryptographic hardware primitives [PDF]
, 2020 The development and implementation of post-quantum cryptosystems have become a pressing issue in the design of secure computing systems, as general quantum computers have become more feasible in the last two years.
Agrawal, Rashmi +3 more
core
Cloud-based Quadratic Optimization with Partially Homomorphic Encryption [PDF]
, 2019 The development of large-scale distributed control systems has led to the outsourcing of costly computations to cloud-computing platforms, as well as to concerns about privacy of the collected sensitive data.
Alexandru, Andreea B. +5 more
core +2 more sources
A new Definition and Classification of Physical Unclonable Functions
, 2015 A new definition of "Physical Unclonable Functions" (PUFs), the first one that fully captures its intuitive idea among experts, is presented. A PUF is an information-storage system with a security mechanism that is 1. meant to impede the duplication of
Merli, Dominik, Plaga, Rainer
core +1 more source
Advanced Science, EarlyView.This study proposed physical unclonable function based multi‐level key space generation scheme. By exploiting speckle characteristic, a size‐controllable structure is achieved and that is suitable foundation for multiple key extraction. The flexible key space supports various specifications for advanced applications, such as hierarchical authentication
Jeong Jin Kim, Min Seong Kim, Gil Ju Lee
wiley +1 more source
Compiling symbolic attacks to protocol implementation tests
, 2012 Recently efficient model-checking tools have been developed to find flaws in security protocols specifications. These flaws can be interpreted as potential attacks scenarios but the feasability of these scenarios need to be confirmed at the ...
Ghabri, Hatem +2 more
core +4 more sources
Modeling Adversaries in a Logic for Security Protocol Analysis [PDF]
, 2012 Logics for security protocol analysis require the formalization of an adversary model that specifies the capabilities of adversaries. A common model is the Dolev-Yao model, which considers only adversaries that can compose and replay messages, and ...
Halpern, Joseph Y., Pucella, Riccardo
core +1 more source
Optimization of Additive Fibonacci Generators Based on Primitive Polynomials Over GF(p)
IEEE AccessThis paper presents an approach to the modification of the additive Fibonacci generator by implementing it based on primitive polynomials over the field GF(p).
Pawel Sawicki +7 more
doaj +1 more source
Breaking universal limitations on quantum conference key agreement without quantum memory
Communications Physics, 2023 Quantum conference key agreement is an important cryptographic primitive for future quantum network. Realizing this primitive requires high-brightness and robust multiphoton entanglement sources, which is challenging in experiment and unpractical in ...
Chen-Long Li +7 more
doaj +1 more source
Advanced Electronic Materials, EarlyView.A CMOS‐compatible flash memory structure with multi‐level programming produces reliable and reproducible physically unclonable functions (PUFs) for secure IoT applications. Device‐specific variations in flat‐band voltage enable scalable key generation without standby power.
Kyumin Sim +6 more
wiley +1 more source