Notice
There is currently an issue with the citation download feature. Learn more

IEEE Transactions on Computers

Issue 10 • Oct. 2006

Filter Results

Displaying Results 1 - 14 of 14
  • [Front cover]

    Publication Year: 2006, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2006, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • New Methods for Digital Generation and Postprocessing of Random Data

    Publication Year: 2006, Page(s):1217 - 1229
    Cited by:  Papers (56)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (757 KB) | HTML iconHTML

    A new method for digital true random number generation based on asynchronous logic circuits with feedback is introduced. In particular, a concrete technique using the so-called Galois and Fibonacci ring oscillators is developed and analyzed both theoretically and experimentally. The generated random binary sequences may have a very high speed and a higher and more robust entropy rate in comparison... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tamper Proofing by Design Using Generalized Involution-Based Concurrent Error Detection for Involutional Substitution Permutation and Feistel Networks

    Publication Year: 2006, Page(s):1230 - 1239
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1971 KB) | HTML iconHTML

    Secure operation of cryptographic algorithms is critical to the success of secure transactions. Fault-based attacks that recover secret keys by deliberately introducing fault(s) in cipher implementations and analyzing the faulty outputs have been proven to be extremely powerful. Substitution permutation networks (SPN) and Feistel networks (FN) are the two important classes of symmetric block ciphe... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Truncated Online Arithmetic with Applications to Communication Systems

    Publication Year: 2006, Page(s):1240 - 12529
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3242 KB) | HTML iconHTML

    Truncation in digit-precision is a very important and common operation in embedded system design for bounding the required finite precision and for area-time-power savings. In this paper, we present the use of online arithmetic to provide truncated computations with communication systems as one of the applications. In contrast to truncation in conventional arithmetic, online arithmetic can truncat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Simple High-Speed Multiplier Design

    Publication Year: 2006, Page(s):1253 - 1258
    Cited by:  Papers (29)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1417 KB) | HTML iconHTML

    The performance of multiplication is crucial for multimedia applications such as 3D graphics and signal processing systems, which depend on the execution of large numbers of multiplications. Previously reported algorithms mainly focused on rapidly reducing the partial products rows down to final sums and carries used for the final accumulation. These techniques mostly rely on circuit optimization ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Attribute-Based Access Control with Hidden Policies and Hidden Credentials

    Publication Year: 2006, Page(s):1259 - 1270
    Cited by:  Papers (40)  |  Patents (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (289 KB) | HTML iconHTML

    In an open environment such as the Internet, the decision to collaborate with a stranger (e.g., by granting access to a resource) is often based on the characteristics (rather than the identity) of the requester, via digital credentials: access is granted if Alice's credentials satisfy Bob's access policy. The literature contains many scenarios in which it is desirable to carry out such trust nego... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • SmashGuard: A Hardware Solution to Prevent Security Attacks on the Function Return Address

    Publication Year: 2006, Page(s):1271 - 1285
    Cited by:  Papers (26)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1621 KB) | HTML iconHTML

    A buffer overflow attack is perhaps the most common attack used to compromise the security of a host. This attack can be used to change the function return address and redirect execution to the attacker's code. We present a hardware-based solution, called SmashGuard, to protect against all known forms of attack on the function return addresses stored on the program stack. With each function call i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks

    Publication Year: 2006, Page(s):1286 - 1299
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1633 KB) | HTML iconHTML

    While in-network data fusion can reduce data redundancy and, hence, curtail network load, the fusion process itself may introduce significant energy consumption for emerging wireless sensor networks with vectorial data and/or security requirements. Therefore, fusion-driven routing protocols for sensor networks cannot optimize over communication cost only - fusion cost must also be accounted for. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A New Source Coding Scheme with Small Expected Length and Its Application to Simple Data Encryption

    Publication Year: 2006, Page(s):1300 - 1305
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (648 KB) | HTML iconHTML

    We present a new source coding scheme with smaller expected length than Shannon-Fano-Elias codes. The ordering of source symbols input to the proposed encoding algorithm can be arbitrary. We show that this property leads to exponential complexity for eavesdropping even though an adversary knows the code construction rule and the probability mass function of the source View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography

    Publication Year: 2006, Page(s):1306 - 1311
    Cited by:  Papers (48)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2014 KB) | HTML iconHTML

    Digit serial multipliers are used extensively in hardware implementations of elliptic and hyperelliptic curve cryptography. This contribution shows different architectural enhancements in least significant digit (LSD) multiplier for binary fields GF(2m). We propose two different architectures, the double accumulator multiplier (DAM) and N-accumulator multiplier (NAM), which are both fas... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Join the IEEE Computer Society!

    Publication Year: 2006, Page(s): 1312
    Request permission for commercial reuse | PDF file iconPDF (43 KB)
    Freely Available from IEEE
  • TC Information for authors

    Publication Year: 2006, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (88 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2006, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE

Aims & Scope

The IEEE Transactions on Computers is a monthly publication with a wide distribution to researchers, developers, technical managers, and educators in the computer field.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Paolo Montuschi
Politecnico di Torino
Dipartimento di Automatica e Informatica
Corso Duca degli Abruzzi 24 
10129 Torino - Italy
e-mail: pmo@computer.org