Yanjun Li

ORCID: 0000-0003-3314-3764
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Cryptographic Implementations and Security
  • Coding theory and cryptography
  • Microplastics and Plastic Pollution
  • Chaos-based Image/Signal Encryption
  • graph theory and CDMA systems
  • Advanced Graph Theory Research
  • Mobile Ad Hoc Networks
  • Catalytic Processes in Materials Science
  • Graph Labeling and Dimension Problems
  • Cooperative Communication and Network Coding
  • Wireless Networks and Protocols
  • Interconnection Networks and Systems
  • Advanced Optical Network Technologies
  • Pharmaceutical and Antibiotic Environmental Impacts
  • Catalysis and Oxidation Reactions
  • biodegradable polymer synthesis and properties
  • Nanoparticles: synthesis and applications
  • Wind and Air Flow Studies
  • High-Temperature Coating Behaviors
  • Mobile Agent-Based Network Management
  • Distributed Control Multi-Agent Systems
  • Cryptography and Data Security
  • Effects and risks of endocrine disrupting chemicals
  • Caching and Content Delivery
  • Advanced Photocatalysis Techniques

Chinese Academy of Sciences
1998-2025

Northeast Institute of Geography and Agroecology
2022-2025

University of Chinese Academy of Sciences
2011-2024

Beijing Electronic Science and Technology Institute
2024

Institute of Computing Technology
2006-2024

State Key Laboratory of Cryptology
2024

Dalian Institute of Chemical Physics
2023

Yantai University
2023

Dalian National Laboratory for Clean Energy
2023

Northwest Minzu University
2016

10.1016/j.jisa.2023.103696 article EN Journal of Information Security and Applications 2024-01-17

Let G be a graph of order n, and let b integers such that 1 ≤ < b. We show has an [a, b]-factor if δ(G) ≥ a, n 2a + max {dG(u), dG(v) for any two nonadjacent vertices u v in G. This result is best possible, it extension T. Iida Nishimura's results (T. Nishimura, An Ore-type condition the existence k-factors graphs, Graphs Combinat. 7 (1991), 353–361; A degree k-factors, J. Graph Theory 16 (1992), 141–151). about k-factor. As immediate consequence, shows conjecture M. Kano (M. Kano, Some...

10.1002/(sici)1097-0118(199801)27:1<1::aid-jgt1>3.0.co;2-u article EN Journal of Graph Theory 1998-01-01

10.1002/(sici)1097-0118(199801)27:1<1::aid-jgt1>3.3.co;2-y article EN Journal of Graph Theory 1998-01-01

10.1007/bf02880002 article EN Science in China Series A Mathematics 1998-09-01

Peer-to-peer (P2P) file distribution imposes increasingly heavy traffic burden on the Internet service providers (ISPs). The vast volume of pushes up ISPs’ costs in routing and investment degrades their networks performance. Building ISP-friendly P2P is therefore critical importance for ISPs services. So far most efforts this area focused improving locality-awareness applications, example, to construct overlay with better knowledge underlying network topology. There is, however, growing...

10.1155/2014/968328 article EN cc-by Mathematical Problems in Engineering 2014-01-01

A novel signaling protocol called PS-JET for avoiding extra ETE delay in JET/OBS is proposed. It completes the resource reservation by two steps, and shows great improvement on reduction of compared with PJET

10.1109/ofc.2006.215830 article EN 2006-01-01

"VIL Block Cipher" is a kind of block cipher that supports Variable Input-Lengths. It was first proposed by Bellare, etc. and since then several constructions have been given, among which Cook's elastic special one. In this paper we present security model called "MIL model" for VIL ciphers, investigating their when fixed secret key used multiple input-lengths. Our results show if the schedule not well designed, vulnerable processing multiple-length inputs under key. Thus, further...

10.1145/1533057.1533110 article EN 2009-03-10
Coming Soon ...