Deciding Irreducibility/Indecomposability of Feedback Shift Registers Is NP‐Hard
Feedback shift registers (FSRs) are used as a fundamental component in electronics and confidential communication. A FSR f is said to be reducible if all the output sequences of another FSR g can also be generated by f and the FSR g costs less memory than f.
Lin Wang, Guowen Xu
wiley +1 more source
On the security risk of pre-image attack on cancelable biometrics
Over the years, a number of biometric template protection schemes, often based on the notion of “cancelable biometrics”, have been proposed. An ideal cancelable biometric algorithm complies with four criteria: irreversibility, revocability, unlinkability,
Xingbo Dong +5 more
doaj +1 more source
Functional Graphs and Their Applications in Generic Attacks on Iterated Hash Constructions
We provide a survey about generic attacks on cryptographic hash constructions including hash-based message authentication codes and hash combiners. We look into attacks involving iteratively evaluating identical mappings many times.
Zhenzhen Bao, Jian Guo, Lei Wang
doaj +1 more source
The beta family at the prime two and modular forms of level three
We use the orientation underlying the Hirzebruch genus of level three to map the beta family at the prime p=2 into the ring of divided congruences. This procedure, which may be thought of as the elliptic greek letter beta construction, yields the f ...
Hanno von Bodecker, Ravenel, Shimomura
core +1 more source
Improved AB‐CPREs with Revocability and HRA Security under LWE
Attribute‐based conditional proxy re‐encryption protocols (AB‐CPREs) enable a delegator to delegate his decryption rights via different policies and grant the data owner greater flexibility in allocating their encrypted private data stored in the cloud.
Yang Wang, Mingqiang Wang, Jiwei Tian
wiley +1 more source
Superposition Attacks on Pseudorandom Schemes Based on Two or Less Permutations
We study quantum superposition attacks against permutation‐based pseudorandom cryptographic schemes. We first extend Kuwakado and Morii’s attack against the Even–Mansour cipher and exhibit key recovery attacks against a large class of pseudorandom schemes based on a single call to an n‐bit permutation, with polynomial O(n) (or O(n2), if the concrete ...
Shaoxuan Zhang +3 more
wiley +1 more source
A New Cryptosystem Based On Hidden Order Groups [PDF]
Let $G_1$ be a cyclic multiplicative group of order $n$. It is known that the Diffie-Hellman problem is random self-reducible in $G_1$ with respect to a fixed generator $g$ if $\phi(n)$ is known. That is, given $g, g^x\in G_1$ and having oracle access to
Saxena, Amitabh, Soh, Ben
core +2 more sources
Lattice‐Based CP‐ABE for Optimal Broadcast Encryption With Polynomial‐Depth Circuits
Most current broadcast encryption with optimal parameters is limited to Nick’s class 1 (NC1) circuits and does not support polynomial‐depth circuits (P‐depth circuits), making it difficult to provide flexible access control in broadcast channels among vast user groups.
Shaohua Ma +4 more
wiley +1 more source
Practical Preimage Attacks on 3-Round Keccak-256 and 4-Round Keccak[r=640, c=160]
Recently, linear structures and algebraic attacks have been widely used in preimage attacks on round-reduced Keccak. Inherited by pioneers’ work, we make some improvements for 3-round Keccak-256 and 4-round Keccak[r=640, c=160].
Xiaoen Lin, Le He, Hongbo Yu
doaj +1 more source
Secure and Efficient Multi-Authority Attribute-Based Encryption Scheme From Lattices
Attribute-based encryption (ABE) mechanism on lattices can against quantum attack and guarantees fine-grained access control of encrypted data, and it has been widely used in cloud computing and privacy protection.
Yuan Liu +3 more
doaj +1 more source

