Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (142)
- Software Engineering (99)
- Artificial Intelligence and Robotics (37)
- Engineering (33)
- Business (30)
-
- Computer Engineering (29)
- Medicine and Health Sciences (25)
- OS and Networks (23)
- Data Storage Systems (22)
- Numerical Analysis and Scientific Computing (16)
- Theory and Algorithms (16)
- Health Information Technology (13)
- Graphics and Human Computer Interfaces (12)
- Social and Behavioral Sciences (12)
- Finance and Financial Management (11)
- E-Commerce (9)
- Public Affairs, Public Policy and Public Administration (8)
- Transportation (7)
- Programming Languages and Compilers (6)
- Computer and Systems Architecture (4)
- Digital Communications and Networking (4)
- Systems Architecture (4)
- Technology and Innovation (4)
- Management Information Systems (3)
- Communication (2)
- Law (2)
- Rehabilitation and Therapy (2)
- Keyword
-
- Privacy (47)
- Cloud computing (41)
- Access control (37)
- Security (31)
- Authentication (30)
-
- Privacy-preserving (28)
- Blockchain (27)
- Encryption (27)
- Searchable encryption (24)
- Attribute-based encryption (20)
- Data privacy (19)
- Servers (19)
- Cloud storage (18)
- Cryptography (18)
- Anonymity (16)
- RFID (15)
- Revocation (15)
- Homomorphic encryption (14)
- Android (13)
- Protocols (13)
- Machine learning (12)
- Digital signature (10)
- Information security (10)
- Keyword search (10)
- Proxy re-encryption (10)
- Bitcoin (9)
- Cloud Computing (9)
- Cybersecurity (9)
- Data outsourcing (9)
- Deep learning (9)
- Publication Year
Articles 1021 - 1050 of 1051
Full-Text Articles in Information Security
Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng
Privacy Protection For Transactions Of Digital Goods, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
In this paper we study the problem of how to protect users’ privacy in web transactions of digital goods. In particular, we introduce a system which allows a user to disclose his/her identity information (such as user account or credit card number) to a web site in exchange for a digital item, but prevents the web site from learning which specific item the user intends to obtain. The problem concerned here is orthogonal to the problem of anonymous transactions [RSG98], [RR98] but commensurate with the general problem of PIR (private information retrieval) [CGK95]
A Method For Fast Revocation Of Public Key Certificates And Security Capabilities, D. Boneh, Xuhua Ding, Gene Tsudik, Chi Ming Wong
A Method For Fast Revocation Of Public Key Certificates And Security Capabilities, D. Boneh, Xuhua Ding, Gene Tsudik, Chi Ming Wong
Research Collection School Of Computing and Information Systems
We present a new approach to fast certificate revocation centered around the concept of an on-line semi-trusted mediator (SEM). The use of a SEM in conjunction with a simple threshold variant of the RSA cryptosystem (mediated RSA) offers a number of practical advantages over current revocation techniques. Our approach simplifies validation of digital signatures and enables certificate revocation within legacy systems. It also provides immediate revocation of all security capabilities. This paper discusses both the architecture and implementation of our approach as well as performance and compatibility with the existing infrastructure. Our results show that threshold cryptography is practical for …
Generating Market Basket Data With Temporal Information, Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia
Generating Market Basket Data With Temporal Information, Yingjiu Li, Peng Ning, X. Sean Wang, Sushil Jajodia
Research Collection School Of Computing and Information Systems
This paper presents a synthetic data generator that outputs timestamped transactional data with embedded temporal patterns controlled by a set of input parameters. In particular, calendar schema, which is determined by a hierarchy of input time granularities, is used as a framework of possible temporal patterns. An example of calendar schema is (year, month, day), which provides a framework for calendar-based temporal patterns of the form -38352 , where each is either an integer or the symbol . For example, is such a pattern, which corresponds to the time intervals consisting of all the 16th days of all months in …
Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu
Secure And Private Distribution Of Online Video And Some Related Cryptographic Issues, Feng Bao, Robert H. Deng, Peirong Bao, Yan Guo, Hongjun Wu
Research Collection School Of Computing and Information Systems
With the rapid growth of broadband infrastructure, it is thought that the bottleneck for video-on-demand service through Internet is being cleared. However, digital video content protection and consumers privacy protection emerge as new major obstacles. In this paper we propose an online video distribution system with strong content security and privacy protection. We mainly focus on the study of security and privacy problems related to the system. Besides presenting the new system, we intensively discuss some relevant cryptographic issues, such as content protection, private information retrieval, super-speed encryption/decryption for video, and PKC with fast decryption etc. The paper can be …
Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng
Cryptanalysis Of A Digital Signature Scheme On Id-Based Key-Sharing Infrastructures, Hongjun Wu, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete logarithm problem is hard to solve. Two schemes (the ID-type and the random-type schemes) based on the linear scheme for the Key Predistribution Systems (KPS) and the discrete logarithm problem (DLP) were given. In this paper we show that those two schemes fail to meet the nonrepudiation requirement: with negligible amount of computation, a signature could be forged. For the ID-type signature scheme, any verifier could forge a signature to raise repudiation between that …
Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu
Cryptanalysis Of Two Sparse Polynomial Based Public Key Cryptosystems, Feng Bao, Robert H. Deng, Willi Geiselmann, Claus Schnorr, Rainer Steinwandt, Hongjun Wu
Research Collection School Of Computing and Information Systems
The application of sparse polynomials in cryptography has been studied recently. A public key encryption scheme EnRoot [4] and an identification scheme SPIFI [1] based on sparse polynomials were proposed. In this paper, we show that both of them are insecure. The designers of SPIFI proposed the modified SPIFI [2] after Schnorr pointed out some weakness in its initial version. Unfortunately, the modified SPIFI is still insecure. The same holds for the generalization of EnRoot proposed in [2].
An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng
An Efficient And Practical Scheme For Privacy Protection In E-Commerce Of Digital Goods, Feng Bao, Robert H. Deng, Peirong Feng
Research Collection School Of Computing and Information Systems
It is commonly acknowledged that customers’ privacy in electronic commerce should be well protected. The solutions may come not only from the ethics education and legislation, but also from cryptographic technologies. In this paper we propose and analyze a privacy protection scheme for e-commerce of digital goods. The scheme takes cryptography as its technical means to realize privacy protection for online customers. It is efficient in both computational cost and communication cost. It is very practical for real e-commerce systems compared with previous solutions. The cryptographic technique presented in this paper is rather simple. But the scheme has great application …
Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng
Cryptanalysis Of The M-Permutation Protection Schemes, Hongjun Wu, Feng Bao, Dingfeng Ye, Robert H. Deng
Research Collection School Of Computing and Information Systems
Anderson and Kuhn have proposed the EEPROM modification attack to recover the secret key stored in the EEPROM. At ACISP ’98, Fung and Gray proposed an m-permutation protection scheme against the EEPROM modification attack. At ACISP ’99, Fung and Gray pointed out that in their original scheme, a secret key with too small or too large Hamming weight could be recovered easily. Then they proposed a revised m- permutation protection scheme and claimed that their revised scheme does not leak any information of the secret key. In this paper, we break completely both the original and the revised …
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Multicast Internet Protocol, X. K. Wang, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
In this paper, we first review the existing IPv4 based multicast protocols and identify their shortcomings. We then proposed a new multicast protocol, called Multicast Internet Protocol (MIP), which is both scalable and flexible. The design principle of MIP is fundamentally different from the existing IPv4 based multicast protocols. The issues related to MIP routing and implementations are also studied in this paper.
On The Validity Of Digital Signatures, Jianying Zhou, Robert H. Deng
On The Validity Of Digital Signatures, Jianying Zhou, Robert H. Deng
Research Collection School Of Computing and Information Systems
An important feature of digital signatures is to serve as non-repudiation evidence. To be eligible as non-repudiation evidence, a digital signature on an electronic document should remain valid until its expiry date which is specified by some non-repudiation policy. As signature keys may be compromised and the validity of signatures may become questionable, additional security mechanisms need to be imposed on digital signatures. This paper examines the mechanisms for maintaining the validity of digital signatures, and provides a guideline on the use of these mechanisms in various context of applications.
Some Remarks On Fair Exchange Protocol, Jianying Zhou, Robert H. Deng, Feng Bao
Some Remarks On Fair Exchange Protocol, Jianying Zhou, Robert H. Deng, Feng Bao
Research Collection School Of Computing and Information Systems
Fair exchange turns out to be an increasingly important topic due to the rapid growth of electronic commerce. An exchange is deemed to be fair if at the end of exchange, either each party receives the expected item or neither party receives any useful information about the other’s item. Several protocols for fair exchange have been proposed in recent years. In this paper, we first examine a newly published fair exchange protocol and point out its flaws and weaknesses. We then put forward a more efficient and secure protocol and give an informal analysis.
A Signcryption Scheme With Signature Directly Verifiable By Public Key, Feng Bao, Robert H. Deng
A Signcryption Scheme With Signature Directly Verifiable By Public Key, Feng Bao, Robert H. Deng
Research Collection School Of Computing and Information Systems
Signcryption, first proposed by Zheng, is a cryptographic primitive which combines both the functions of digital signature and public key encryption in a logical single step, and with a computational cost significantly lower than that needed by the traditional signature-then-encryption approach. In Zheng's scheme, the signature verification can be done either by the recipient directly (using his private key) or by engaging a zero-knowledge interative protocol with a third party, without disclosing recipient's private key. In this note, we modify Zheng's scheme so that the recipient's private key is no longer needed in signature verification. The computational cost of the …
A New On-Line Cash Check Scheme, Robert H. Deng, Yongfei Han, Albert B. Jeng, Teow-Hin Ngair
A New On-Line Cash Check Scheme, Robert H. Deng, Yongfei Han, Albert B. Jeng, Teow-Hin Ngair
Research Collection School Of Computing and Information Systems
This paper presents a new on-line cash check scheme which guarantees payor anonymity and improves upon existing similar schemes in efficiency and security.
An On-The-Fly Decoding Technique For Reed-Solomon Codes, Yuan Xing Lee, Robert H. Deng, Eng Hean Koh
An On-The-Fly Decoding Technique For Reed-Solomon Codes, Yuan Xing Lee, Robert H. Deng, Eng Hean Koh
Research Collection School Of Computing and Information Systems
An on-the-fly error correction technique for double-byte-error-correction (DBEC) and triple-byte-error-detection (TBED) Reed-Solomon (RS) codes is presented in this paper. This new algorithm finds number of byte-errors (single byte-error, double-byte errors, and triple-byte errors) by simply testing the values of a few syndrome functions, and locates and corrects the byte-errors directly without using the standard iterative algorithms for finding the error location polynomial. More importantly, it neither suffers from malfunctions incurred in Deng-Costello algorithm (1987), nor requires syndrome re-calculation as in Koksal-Yucel's modification (1992). It is also much more simpler and faster than the original Deng-Costello algorithm. It has found applications …
A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin
A Type I Hybrid Arq System With Adaptive Code Rates, Robert H. Deng, Michael L. Lin
Research Collection School Of Computing and Information Systems
Type I hybrid ARQ systems use an error-control code of fixed rate for error-correction in each transmitted packet. In such systems, the code rate must be carefully chosen to match the channel bit error rate (BER) in order to maximize system throughput. Whenever there is a mismatch between code rate and channel BER, the throughput suffers. In this paper, we proposed a type I hybrid ARQ system which automatically adjusts its code rates to match channel BERs. The proposed system is very simple to implement and yet performs significantly better than type I hybrid ARQ systems of fixed code rate
Performance Of Combined Diversity Reception And Convolutional Coding For Qdpsk Land Mobile Radio, Huafei Zhou, Robert H. Deng, T. T. Tjhung
Performance Of Combined Diversity Reception And Convolutional Coding For Qdpsk Land Mobile Radio, Huafei Zhou, Robert H. Deng, T. T. Tjhung
Research Collection School Of Computing and Information Systems
Diversity reception and error correction coding are powerful techniques to combat multipath fading encountered in mobile radio communications. In order to improve the transmission performance of the ?/4-shift QDPSK signal in mobile radio channels, the authors propose a new scheme of combined coding and diversity reception, i.e., combination of diversity reception employing code combining (CC) and convolutional coding employing error-and erasure correction Viterbi decoding. They also consider another combination scheme, i.e., combination of diversity reception employing postdetection maximal ratio combining (MRC) and convolutional coding employing hard decision Viterbi decoding. They theoretically analyze the performance of the schemes taking into account …
On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang
On The Equivalence Of Mceliece's And Niederreiter's Public-Key Cryptosystems, Y. X. Li, Robert H. Deng, X. M. Wang
Research Collection School Of Computing and Information Systems
It is shown that McEliece's and Niederreiter's public-key cryptosystems are equivalent when set up for corresponding choices of parameters. A security analysis for the two systems based on this equivalence observation, is presented
A Probabilistic Approach To Fault Diagnosis In Linear Lightwave Networks, Robert H. Deng, A. A. Lazar, W. Wang
A Probabilistic Approach To Fault Diagnosis In Linear Lightwave Networks, Robert H. Deng, A. A. Lazar, W. Wang
Research Collection School Of Computing and Information Systems
The application of probabilistic reasoning to fault diagnosis in linear lightwave networks (LLNs) is investigated. The LLN inference model is represented by a Bayesian network (or causal network). An inference algorithm is proposed that is capable of conducting fault diagnosis (inference) with incomplete evidence and on an interactive basis. Two belief updating algorithms are presented which are used by the inference algorithm for performing fault diagnosis. The first belief updating algorithm is a simplified version of the one proposed by Pearl (1988) for singly connected inference models. The second belief updating algorithm applies to multiply connected inference models and is …
An Adaptive Coding Scheme With Code Combining For Mobile Radio Systems, Robert H. Deng, Huafei Zhou
An Adaptive Coding Scheme With Code Combining For Mobile Radio Systems, Robert H. Deng, Huafei Zhou
Research Collection School Of Computing and Information Systems
The authors propose and study an adaptive error-control coding scheme for binary digital FM (BFM) mobile radio transmission. The scheme employs code combining through packet retransmissions. The number of transmissions of a packet is in proportion to the channel fading/noise levels, which is in contrast to time diversity techniques where a fixed number of repetitions of a data packet is performed even in the absence of channel errors. Furthermore, the receiver uses received signal envelopes as channel state information, which significantly improves the throughput and bit error rate (BER) performance. Performance of the proposed scheme is analyzed for frequency-flat Rayleigh …
Hybrid Arq Schemes For Point-To-Multipoint Communications Over Nonstationary Broadcast Channels, Robert H. Deng
Hybrid Arq Schemes For Point-To-Multipoint Communications Over Nonstationary Broadcast Channels, Robert H. Deng
Research Collection School Of Computing and Information Systems
Hybrid automatic-repeat-request (ARQ) error control schemes make use of both error detection and error correction in order to achieve high throughput and low undetected error probabilities on two way channels. Two hybrid ARQ schemes, termed hybrid go-back-N (HGB- N) and hybrid selective-repeat (HSR), are proposed for point-to-multipoint communications over broadcast channels. Both schemes incorporate a concatenated code for error correction and error detection. The performance study of the hybrid schemes is based on a two-state Markov model of a burst noise channel. An analytic solution is derived for the throughput efficiency of the HSR scheme, while approximations and computer simulation …
Performance Analysis Of Two Bridged Csma/Cd Networks, C. C. Ko, W. C. Wang, J. L. Du, Robert H. Deng, K. M. Lye
Performance Analysis Of Two Bridged Csma/Cd Networks, C. C. Ko, W. C. Wang, J. L. Du, Robert H. Deng, K. M. Lye
Research Collection School Of Computing and Information Systems
This paper analyses the performance of two non-persistent CSMA/CD LANs linked by a bridge. The main function of the bridge is to buffer all internet work packets and forward them across networks to their destinations. From establishing and solving the main equations governing the behaviour of the bridged networks, the effects of design parameters such as the bridge buffer size and re-transmission back off delay on the performance of the system are studied. It is shown that if these parameters are chosen properly, better throughput and delay performance can be obtained, when compared with an equivalent CSMA/CD network without using …
Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko
Performance Analysis Of Interconnected Lans With Server/Client Configuration, Jiangling Du, Robert H. Deng, Chi Chung Ko
Research Collection School Of Computing and Information Systems
In this paper, we study the end-to-end performance of interconnected local area networks (LAN) with server/client configuration. The system uses bridges to connect two token-ring LANs through a high-speed communication link. A server station located on one LAN receives requests from client-stations on the same LAN as well as on the remote LAN, processes the requests, and returns responses to the client-stations. The end-to-end connections of the interconnected network are modelled as single-chain and multiple-chain closed queueing systems, which are solved by an iterative algorithm based on the MVA (mean value analysis) method. The performance examples are shown in terms …
Performance Of A Token-Passing System With Batch Arrivals And Its Application To File Transfers, Robert H. Deng, Xuanyu Zhang, Kuan Tase Huang
Performance Of A Token-Passing System With Batch Arrivals And Its Application To File Transfers, Robert H. Deng, Xuanyu Zhang, Kuan Tase Huang
Research Collection School Of Computing and Information Systems
This paper investigates the performance of token-passing systems with limited service and Poisson arrivals. For pure Poisson arrivals, the Laplace-Stieltjes Transform (LST) of an approximate customer/packet waiting time distribution is derived and expressed as a functional equation, from which the approximate mean and variance of waiting time are obtained; for batch Poisson arrivals, an approximate mean of waiting time is derived. Mean waiting time approximations are compared against both simulation results and other results presented in the literature; the variance approximation is evaluated by comparing it to simulation results only, since no other results on variance have been reported so …
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.
Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng
Trellis-Coded Multidimensional Phase Modulation, S. S. Pietrobon, Robert H. Deng
Research Collection School Of Computing and Information Systems
A 2L-dimensional multiple phase-shift keyed (L×MPSK) signal set is obtained by forming the Cartesian product of L two-dimensional MPSK signal sets. A systematic approach to partitioning L×MPSK signal sets that is based on block coding is used. An encoder system approach is developed. It incorporates the design of a differential precoder, a systematic convolutional encoder, and a signal set mapper. Trellis-coded L×4PSK, L×8PSK, and L×16PSK modulation schemes are found for 1⩽L⩽4 and a variety of code rates and decoder complexities, many of which are fully transparent to discrete phase rotations of the signal set. The new codes achieve asymptotic coding …
High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello
High Rate Concatenated Coding Systems Using Multidimensional Bandwidth Efficient Inner Codes, Robert H. Deng, Daniel J. Jr. Costello
Research Collection School Of Computing and Information Systems
A concatenated coding system using two-dimensional trellis-coded MPSK inner codes and Reed-Solomon outer codes for application in high-speed satellite communication systems was proposed previously by the authors (ibid., vol.37, no.5, p.420-7, May 1989). The authors extend their results to systems using symbol-oriented, multidimensional, trellis-coded MPSK inner codes. The concatenated coding systems are divided into two classes according to their achievable effective information rates. The first class uses multidimensional trellis-coded 8-PSK inner codes and achieves effective information rates around 1 b/dimension (spectral efficiency 2 b/s/Hz). The second class employs multidimensional trellis-coded 16-PSK inner codes and provides effective information rates around 1.5 …
Parity Retransmission Hybrid Arq Using Rate 1/2 Convolutional Codes On A Nonstationary Channel, L. R. Lugand, D. J. Costello, Jr., Robert H. Deng
Parity Retransmission Hybrid Arq Using Rate 1/2 Convolutional Codes On A Nonstationary Channel, L. R. Lugand, D. J. Costello, Jr., Robert H. Deng
Research Collection School Of Computing and Information Systems
A parity retransmission hybrid automatic repeat request (ARQ) scheme is proposed which uses rate 1/2 convolutional codes and Viterbi decoding. A protocol is described which is capable of achieving higher throughputs than previously proposed parity retransmission schemes. The performance analysis is based on a two-state Markov model of a nonstationary channel. This model constitutes a first approximation to a nonstationary channel. The two-state channel model is used to analyze the throughput and undetected error probability of the protocol presented when the receiver has both an infinite and a finite buffer size. It is shown that the throughput improves as the …
High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes, Robert H. Deng, D. J. Costello, Jr.
High Rate Concatenated Coding Systems Using Bandwidth Efficient Trellis Inner Codes, Robert H. Deng, D. J. Costello, Jr.
Research Collection School Of Computing and Information Systems
High-rate concatenated coding systems with bandwidth-efficient trellis inner codes and Reed-Solomon (RS) outer codes are investigated for application in high-speed satellite communication systems. Two concatenated coding schemes are proposed. In one the inner code is decoded with soft-decision Viterbi decoding, and the outer RS code performs error-correction-only decoding (decoding without side information). In the other the inner code is decoded with a modified Viterbi algorithm, which produces reliability information along with the decoded output. In this algorithm, path metrics are used to estimate the entire information sequence, whereas branch metrics are used to provide reliability information on the decoded sequence. …
Dc-Free Coset Codes, Robert H. Deng, M. A. Herro
Dc-Free Coset Codes, Robert H. Deng, M. A. Herro
Research Collection School Of Computing and Information Systems
An upper bound on the bit-error probability (BEP) of a linear cyclic code over GF(2l) with hard-decision (HD) maximum-likelihood (ML) decoding on memoryless symmetric channels is derived. Performance results are presented for Reed-Solomon codes on GF(32), GF(64), and GF(128). Also, a union upper bound on the BEP of a linear cyclic code with either hard- or soft-decision ML decoding is developed, as well as the corresponding bounds for the extended code of a linear cyclic code. Using these bounds, which are tight at low bit error rate, the performance advantage of soft-decision (SD) ML and HD ML over bounded-distance (BD) …
Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello
Decoding Of Dbec-Tbed Reed-Solomon Codes, Robert H. Deng, Daniel J. Jr. Costello
Research Collection School Of Computing and Information Systems
A problem in designing semiconductor memories is to provide some measure of error control without requiring excessive coding overhead or decoding time. In LSI and VLSI technology, memories are often organized on a multiple bit (or byte) per chip basis. For example, some 256K bit DRAM's are organized in 32K ?? 8 bit-bytes. Byte-oriented codes such as Reed-Solomon (RS) codes can provide efficient low overhead error control for such memories. However, the standard iterative algorithm for decoding RS codes is too slow for these applications. In this correspondence we present a special decoding technique for double-byte-error-correcting (DBEC), triple-byte-error-detecting (TBED) RS …