The design of naming and routing scheme is an important research area for scalable future Internet infrastructure. Currently, existing naming and routing schemes such as hierarchical or flat structure have some individual drawbacks, which limit the development of future Internet greatly. In this paper, we make an in-depth study of existing naming and routing schemes for future Internet, and propose a naming scheme named HFA, which is built by a hybrid Hierarchical-Flat-Attributes structure. Based on this design, an efficient routing scheme using Trie and Hash Table is further proposed as the corresponding routing method. Experimental results show that the HFA has a good flexibility and superior performance with respective to purely hierarchical-based and flat-based naming scheme using our routing method in terms of routing aggregation, lookup time and memory consumption.