The never ending problem of counting bits efficiently

Proceedings - RoEduNet IEEE International Conference

Volumn , Issue , 2011, Pages

  Suciu, A ^a   Cobarzan, P ^a   Marton, K ^a  

^a TECHNICAL UNIVERSITY OF CLUJ NAPOCA   (Romania)

Author keywords

counting bits; cryptography; popcount; random number generator; SSE instruction set; statistical testing

Indexed keywords

COUNTING BITS; INSTRUCTION SET; POPCOUNT; RANDOM NUMBER GENERATORS; STATISTICAL TESTING;

CRYPTOGRAPHY; NUMBER THEORY; PROGRAM PROCESSORS; STATISTICAL TESTS;

RANDOM NUMBER GENERATION;

EID: 80055048698     PISSN: 20681038     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RoEduNet.2011.5993702     Document Type: Conference Paper

References (7)

1. A. Rukhin, J. Soto, J. Nechvatal, M. Smid, E. Barker, "A statistical test suite for random and pseudorandom number generators for cryptographic applications", in press, 2001. Available online at: http://csrc.nist.gov/ groups/ST/toolkit/rng/
2. D. E. Knuth: The Art of Computer Programming, 3rd ed., vol 2: Seminumerical Algorithms, Addison-Wesley, 1998.
3. P. L'Ecuyer, R. Simard, "TestU01: A C library for empirical testing of random number generators", ACM Trans. Math. Softw., vol. 33, no. 4, article 22, 2007.
4. E. El-Qawasmeh, "Performance Investigation of Bit-Counting Algorithms With a Speedup to Lookup Table", Journal of Research and Practice in Information Technology, Australia, 32(3/4), 2001, pp. 215-230.
5. W. Press, S. Teukolsky, W. Vetterling, and B. Flannery: Numerical Recipes in C, 3rd ed., Cambridge University Press, 2007.
6. Specifications for Intel Xeon E5620 are available online at http://ark.intel.com/Product.aspx?id=47925
7. Intel 64 and IA-32 Architectures documentation are available at http://www.intel.com/Assets/ja-JP/PDF/manual/253665.pdf