3 papers
math.CO2026
The perfect divisibility and chromatic number of some odd hole-free graphs
Weihua He, Yueping Shi, Rong Wu +1
A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph is perfectly di…
cs.IT2023
Linear Codes Constructed From Two Weakly Regular Plateaued Functions with Index (p-1)/2
Shudi Yang, Tonghui Zhang, Zheng-An Yao
Linear codes are the most important family of codes in cryptography and coding theory. Some codes have only a few weights and are widely used in many areas, such as authentication…
cs.CR2021
The Elliptic Net Algorithm Revisited
Shiping Cai, Zhi Hu, Zheng-An Yao +1
Pairings have been widely used since their introduction to cryptography. They can be applied to identity-based encryption, tripartite Diffie-Hellman key agreement, blockchain and o…