Results 31 to 40 of about 993 (178)
The Eleventh Power Residue Symbol
Journal of Mathematical Cryptology, 2020 This paper presents an efficient algorithm for computing 11th-power residue symbols in the cyclo-tomic field ℚ(ζ11),$ \mathbb{Q}\left( {{\zeta }_{11}} \right), $where 11 is a primitive 11th root of unity.
Joye Marc +3 more
doaj +1 more source
Permutable Cut-and-Choose Oblivious Transfer and Its Application
IEEE Access, 2020 Oblivious transfer (OT) is a significant primitive with wide use in secure two-party computation, private set intersection private and other cryptographic schemes.
Xiaochao Wei +3 more
doaj +1 more source
Quantum Security of Cryptographic Primitives
CoRR, 2017 We call quantum security the area of IT security dealing with scenarios where one or more parties have access to quantum hardware. This encompasses both the fields of post-quantum cryptography (that is, traditional cryptography engineered to be resistant against quantum adversaries), and quantum cryptography (that is, security protocols designed to be ...
openaire +4 more sources
Pseudo-free families and cryptographic primitives
Journal of Mathematical Cryptology, 2022 Abstract In this article, we study the connections between pseudo-free families of computational Ω \Omega
openaire +3 more sources
Femtosecond‐Laser‐Induced Physical Unclonable Random Maze Structure for Storage‐Free Encryption
Advanced Science, EarlyView.Femtosecond‐laser‐induced gold random maze structures serve as multimodal physical unclonable functions for storage‐free encryption. Their stochastic optical, electrical, and Raman responses are generated by plasmon‐assisted Marangoni formation and converted into AES‐compatible keys without permanent secret‐key storage, offering a portable route toward
Shiru Jiang +6 more
wiley +1 more source
On the Bit Security of Cryptographic Primitives
, 2018 We introduce a formal quantitative notion of “bit security” for a general type of cryptographic games (capturing both decision and search problems), aimed at capturing the intuition that a cryptographic primitive with k-bit security is as hard to break as an ideal cryptographic function requiring a brute force attack on a k-bit key space.
Daniele Micciancio, Michael Walter 0001
openaire +2 more sources
Hierarchical Multi‐Mode Computing in Interlayer‐Coupled 3D RRAM Crossbar Arrays
Advanced Science, EarlyView.2‐deck RRAM crossbar array provides a versatile hardware platform for multifunctional in‐memory computing. Stacked, series, and entropy node configurations enable multi‐layer conductance modulation, logic‐in‐memory operation, genetic learning, and reconfigurable physical unclonable functions.
Seungman Park +7 more
wiley +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
npj Quantum Information, 2022 Anonymity in networked communication is vital for many privacy-preserving tasks. Secure key distribution alone is insufficient for high-security communications.
Zixin Huang +14 more
doaj +1 more source
Hierarchical Physical‐Cyber Encryption via Metasurface‐Encoded Holographic Keys
Advanced Science, EarlyView.ABSTRACT Physical‐layer encryption based on metasurfaces has emerged as a promising alternative to conventional algorithmic cryptography by embedding security into physical processes. However, most existing metasurface‐based encryption schemes operate within single‐stage or static frameworks, where correct physical illumination directly reveals the ...
Zhen Liu +8 more
wiley +1 more source