A5034965387- Coding theory and cryptography
- Cryptographic Implementations and Security
- graph theory and CDMA systems
- Chaos-based Image/Signal Encryption
- Cryptography and Data Security
- Cryptography and Residue Arithmetic
- Cellular Automata and Applications
- Polynomial and algebraic computation
- Physical Unclonable Functions (PUFs) and Hardware Security
- Advanced Malware Detection Techniques
- Finite Group Theory Research
- Advanced Authentication Protocols Security
- Quantum Computing Algorithms and Architecture
- User Authentication and Security Systems
- Complexity and Algorithms in Graphs
- semigroups and automata theory
- Privacy-Preserving Technologies in Data
- Wireless Communication Networks Research
- Advanced Wireless Communication Techniques
- Quantum Information and Cryptography
- Quantum-Dot Cellular Automata
- Cooperative Communication and Network Coding
- Computability, Logic, AI Algorithms
- RFID technology advancements
- DNA and Biological Computing
Chinese Academy of Sciences
2016-2025
Institute of Information Engineering
2016-2025
Institute of Atmospheric Physics
2024
University of Chinese Academy of Sciences
2010-2024
State Key Laboratory of Information Security
2005-2024
Washington University in St. Louis
2023
Constellation Technology (United States)
2023
Zunyi Medical University
2022
Krirk University
2022
Georgia Institute of Technology
2022
In this paper, three constructions of balanced Boolean functions with optimum algebraic immunity are proposed.The cryptographical properties such as degree and nonlinearity the constructed also analyzed.
Search for different types of distinguishers are common tasks in symmetrickey cryptanalysis. In this work, we employ the constraint programming (CP) technique to tackle such problems. First, show that a simple application CP approach proposed by Gerault et al. leads solution open problem determining exact lower bound number active S-boxes 6-round AES-128 related-key model. Subsequently, same can be applied searching integral distinguishers, impossible differentials, zero-correlation linear...
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that order for one peer to another, it needs know other peer's identity. Hence, there exists an inherent tradeoff between and anonymity. To best our knowledge, is currently no P2P protocol provides complete mutual anonymity as well authentication management. We propose a zero-knowledge scheme called pseudo (PT), where each peer, instead using its real identity, generates unforgeable verifiable...
In this correspondence, new binary sequence families F <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">k</sup> of period 2 xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -1 are constructed for even n and any k with gcd(k,n)=2 if n/2 is odd or gcd(k,n)=1 even. The distribution their correlation values completely determined. These have maximum xmlns:xlink="http://www.w3.org/1999/xlink">n/2+1</sup> family size...
In this paper, the cycle structure and adjacency graphs of a class linear feedback shift registers (LFSRs) are determined. By recursively applying D-morphism to maximum-length LFSRs representing cycles by generating functions, new family nonlinear (NFSRs) proposed based on properties these LFSRs. The number NFSRs in is also considered.
Boolean formula minimization is a notoriously hard problem. Circuit minimization, typically studied in the context of much broader subject known as synthesis and optimization circuits, introduces another layer complexity since ultimately those technology-independent representations (e.g., formulas truth tables) has to be transformed into netlist cells target technology library. To manage complexities, industrial community separates process two steps: mapping. In each step, this approach only...