206,814 research outputs found
A turbo-decoding message-passing algorithm for sparse parity-check matrix codes
No full textA turbo-decoding message-passing (TDMP) algorithm for sparse parity-check matrix (SPCM) codes such as low-density parity-check, repeat-accumulate, and turbo-like codes is presented. The main advantages of the proposed algorithm over the standard decoding algorithm are 1) its faster convergence speed by a factor of two in terms of decoding iterations, 2) improvement in coding gain by an order of magnitude at high signal-to-noise ratio (SNR), 3) reduced memory requirements, and 4) reduced decoder complexity. In addition, an efficient algorithm for message computation using simple max operations is also presented. Analysis using EXIT charts shows that the TDMP algorithm offers a better performance-complexity tradeoff when the number of decoding iterations is small, which is attractive for high-speed applications. A parallel version of the TDMP algorithm in conjunction with architecture-aware (AA) SPCM codes, which have embedded structure that enables efficient high-throughput decoder implementation, are presented. Design examples of AA-SPCM codes based on graphs with large girth demonstrate that AA-SPCM codes have very good error-correcting capability using the TDMP algorithm. © 2006 IEEE.BAHL LR, 1974, IEEE T INFORM THEORY, V20, P284, DOI 10.1109-TIT.1974.1055186; Bangerter B., 2003, INTEL TECHNOL J, V7; BENES VE, 1964, ATandT TECH J, V43, P1641; BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109-ICC.1993.397441; Blanksby AJ, 2002, IEEE J SOLID-ST CIRC, V37, P404, DOI 10.1109-4.987093; Brink S. T., 2001, IEEE T COMMUN, V49, P1727; Divsalar D., 1998, Proceedings. Thiry-Sixth Annual Allerton Conference on Communication, Control, and Computing; FAN J, LDPC EFFICIENT ALTER; Gallager R., 1963, LOW DENSITY PARITY C; Gross WJ, 2001, IEEE T CIRCUITS-II, V48, P904, DOI 10.1109-82.974777; GUILLOUD F, 2004, THESIS ENST PARIS; Hocevar D. E., 2003, P IEEE INT C COMM, P2708; HU XY, 2001, P IEEE GLOB TEL C IE, pE1036; Jin H., 2001, THESIS CALTECH PASAD; Jin H., 2000, P 2 INT S TURB COD R, P1; Kschischang FR, 1998, IEEE J SEL AREA COMM, V16, P219, DOI 10.1109-49.661110; Lan CF, 2004, IEEE T COMMUN, V52, P1092, DOI 10.1109-TCOMM.2004.831406; Lin S., 2004, ERROR CONTROL CODING; LUBOTZKY A, 1988, COMBINATORICA, V8, P261, DOI 10.1007-BF02126799; Mansour M. M., 2002, P INT S LOW POW EL D, P284; MANSOUR MM, 2002, P IEEE GLOB TEL C 20, P1383; Mansor M, 2003, PASOH: ECOLOGY OF A LOWLAND RAIN FOREST IN SOUTHEAST ASIA, P215; MANSOUR MM, 2005, 39 ANN C INF SCI SYS; Mansour MM, 2003, IEEE T VLSI SYST, V11, P976, DOI 10.1109-TVLSI.2003.817545; MANSOUR MM, 2003, P IEEE INT S CIRC SY, V2, P57; MANSOUR MM, 2002, ANN C INF SCI SYST C; MARGULIS GA, 1982, COMBINATORICA, V2, P71, DOI 10.1007-BF02579283; MCLIECE RJ, 1998, IEEE J SEL AREA COMM, V16, P140; Pearl J., 1988, PROBABILISTIC REASON; RASHI Y, EFFICIENT ALTERNATIV; Richardson TJ, 2001, IEEE T INFORM THEORY, V47, P619, DOI 10.1109-18.910578; Rosenthal J., 2000, P 38 ALL C COMM CONT, P248; Roumy A, 2004, IEEE T INFORM THEORY, V50, P1711, DOI 10.1109-TIT.2004.831778; Royle G., CUBIC CAGES; SONG H, 2002, JPN J APPL PHYS, P1749; TANNER RM, 1981, IEEE T INFORM THEORY, V27, P533, DOI 10.1109-TIT.1981.1056404; Tanner R. M., 1999, P 37 ALL C COMM CONT; TANNER RM, 2001, P INT S COMM THEOR A, P1; Tanner RM, 2004, IEEE T INFORM THEORY, V50, P2966, DOI 10.1109-TIT.2004.838370; TUCHLER M, 2002, C INF SCI SYST PRINC; Vasic B, 2003, J LIGHTWAVE TECHNOL, V21, P438, DOI 10.1109-JLT.2003.808769; Yang M, 2004, IEEE T COMMUN, V52, P564, DOI 10.1109-TCOMM.2004.826367; YEO E, 2001, P IEEE GLOBECOM, P3019; Zhang JT, 2005, IEEE T COMMUN, V53, P209, DOI 10.1109-TCOMM.2004.84198252453
A novel design methodology for high-performance programmable decoder cores for AA-LDPC codes
No full textA new parameterized-core-based design methodology targeted for programmable decoders for low-density parity-check (LDPC) codes is proposed. The methodology solves the two major drawbacks of excessive memory overhead and complex on-chip interconnect typical of existing decoder implementations which limit the scalability, degrade the error-correction capability, and restrict the domain of application of LDPC codes. Diverse memory and interconnect optimizations are performed at the code-design, decoding algorithm, decoder architecture, and physical layout levels, with the following features: (1) Architecture-aware (AA)-LDPC code design with embedded structural features that significantly reduce interconnect complexity, (2) faster and memory-efficient turbo-decoding algorithm for LDPC codes, (3) programmable architecture having distributed memory, parallel message processing units, and dynamic-scalable transport networks for routing messages, and (4) a parameterized macro-cell layout library implementing the main components of the architecture with scaling parameters that enable low-level transistor sizing and power-rail scaling for power-delay-area optimization. A 14.3 mm 2 programmable decoder core for a rate-1-2, length 2048 AA-LDPC code generated using the proposed methodology is presented, which delivers a throughput of 6.4 Gbps at 125 MHz and consumes 787 mW of power. © 2005 Springer Science + Business Media, Inc.BAHL LR, 1974, IEEE T INFORM THEORY, V20, P284, DOI 10.1109-TIT.1974.1055186; BERROU C, 1993, IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS 93 : TECHNICAL PROGRAM, CONFERENCE RECORD, VOLS 1-3, P1064, DOI 10.1109-ICC.1993.397441; Gallager R., 1963, LOW DENSITY PARITY C; HU XY, 2001, GLOBECOM 2001, V2, P1036; Mansour M. M., 2002, IEEE Workshop on Signal Processing Systems (SPIS'02) (Cat. No.02TH8638), DOI 10.1109-SIPS.2002.1049702; Mansour M. M., 2002, P INT S LOW POW EL D, P284; MANSOUR MM, 2002, P IEEE GLOB TEL C 20, P1383; MANSOUR MM, 2003, THESIS U ILLINOIS UR; Mansour MM, 2003, IEEE T VLSI SYST, V11, P976, DOI 10.1109-TVLSI.2003.817545; Mansour MM, 2003, IEEE COMP SOC ANN, P62, DOI 10.1109-ISVLSI.2003.1183354; MANSOUR MM, 2002, C INF SCI SYST PRINC; ROWLAND C, 2001, P 2001 IEEE INT C CI, P742; Wiberg N., 1996, THESIS LINKOPING U S; Yeo E, 2001, IEEE T MAGN, V37, P7480
A reconfigurable TDMP decoder for raptor codes
No full textA Raptor code is a concatenation of a fixed rate precode and a Luby-Transform (LT) code that can be used as a rateless error-correcting code over communication channels. By definition, Raptor codes are characterized by irregularity features such as dynamic rate, check-degree variability, and joint coding, which make the design of hardware-efficient decoders a challenging task. In this paper, serial turbo decoding of architecture-aware Raptor codes is mapped into sequential row processing of a regular matrix by using a combination of code enhancements and architectural optimizations. The proposed mapping approach is based on three basic steps: (1) applying systematic permutations on the source matrix of the Raptor code, (2) confining LT random encoding to pseudo-random permutation of messages and periodic selection of rowsplitting scenarios, and (3) developing a reconfigurable parallel check-node processor that attains a constant throughput while processing LT- and LDPC-nodes of varying degrees and count. The decoder scheduling is, thus, made simple and uniform across both LDPC and LT decoding. A serial decoder implementing the proposed approach was synthesized in 65 nm, 1.2 V CMOS technology. Hardware simulations show that the decoder, decoding a rate-0.4 code instance, achieves a throughput of 36 Mb-s at SNR of 1.5 dB, dissipates an average power of 27 mW and occupies an area of 0.55 mm 2. © Springer Science+Business Media, LLC 2012.Elias P, 1955, 3 LOND S, P61; Etesami O, 2006, IEEE T INFORM THEORY, V52, P2033, DOI 10.1109-TIT.2006.872855; Fossorier MPC, 1999, IEEE T COMMUN, V47, P673, DOI 10.1109-26.768759; Gallager R., 1963, LOW DENSITY PARITY C; Kai Zhang X. H., 2009, IEEE T VERY LARGE SC, V27, P985; Luby M, 2002, ANN IEEE SYMP FOUND, P271; Mansour MA, 2006, IEEE T SIGNAL PROCES, V54, P4376, DOI 10.1109-TSP.2006.880240; Mansour MM, 2003, IEEE T VLSI SYST, V11, P976, DOI 10.1109-TVLSI.2003.817545; Palanki R., 2004, Proceedings. 2004 IEEE International Symposium on Information Theory (IEEE Cat. No.04CH37522); Shokrollahi A, 2006, IEEE T INFORM THEORY, V52, P2551, DOI 10.1109-TIT.2006.874390; TANNER RM, 1981, IEEE T INFORM THEORY, V27, P533, DOI 10.1109-TIT.1981.1056404; Xiang B, 2010, IEEE T VLSI SYST, V18, P1447, DOI 10.1109-TVLSI.2009.2025169; Zeineddine H, 2011, IEEE T SIGNAL PROCES, V59, P2943, DOI 10.1109-TSP.2011.21146550
Cataract surgery during active methicillin-resistant Staphylococcus aureus infection
No full textAhmad M Mansour,1,2 Haytham I Salti11Department of Ophthalmology, American University of Beirut, 2Rafic Hariri University Hospital, Beirut, LebanonAbstract: We present two patients with active, foul-smelling, methicillin-resistant ­Staphylococcus aureus (MRSA) wounds of the forehead and sternum following craniotomy or open heart surgery. Both had debilitating cataracts and were told by the infectious diseases team that cataract surgery is very risky. Both underwent sequential bilateral phacoemulsification with no sign of infection. Patients with active MRSA wound infections may safely undergo cataract surgery with additional precautions observed intraoperatively (good wound construction) and postoperatively (topical antibiotics and close observation). Banning such surgeries can unnecessarily jeopardize the lifestyles of such patients.Keywords: cataract, infection, methicillin-resistant Staphylococcus aureus, phacoe­mulsificatio
Developing GIS analysis techniques for the measurement of safe drinking water access
No full textGeographic Information Systems (GIS) have provided effective and useful methods that are widely used to measure spatial access to services and to inform the planning of public facilities and infrastructures. The development of innovative GIS tools has informed approaches for researching demographic and socioeconomic problems. Nevertheless, GIS methods have not yet been developed for construction of water indices that can provide measures of household accessibility to safe drinking water at the finest spatial scales such as district and sub-district. There has, to date, not been any integrated measurement of access to safe drinking water that can be used as a practical tool to quantitatively identify small areas suffering from poor water supplies or households who use unimproved water sources. A comprehensive and structured review of the literature indicates that although there is international emphasis on drinking water problems in developing countries, there is a wide gap in relation to the current international measurements and programmes set up to measure and monitor access to safe drinking water. This includes efforts made by the United Nations (UN) and the Millennium Development Goals (MDGs) to measure and monitor access to safe water. These measurements are not only limited in terms of the socioeconomic factors impacting safe water access but also have not addressed measurement at the sub-national resolution level of residential communities and spatial variation within individual countries. Therefore, the available measurements neither provide a convincing picture of water accessibility nor a spatially detailed measurement. To bridge this gap, this study introduces new GIS analysis techniques for the measurement of access to safe drinking water as a global problem in the developing world. The main objective is to develop a multivariate index which measures current access to safe drinking water using datasets commonly available in lower and lower middle income countries. It draws on a wider range of data than current United Nations monitoring efforts. GPS coordinates are increasingly collected as a part of household surveys, particularly in the developing world. This offers great opportunities to enhance national census data about drinking water by spatial linkage with other survey sources. Egypt was chosen as a case study and spatial linkage was undertaken between the 2005 Egyptian Demographic and Health Survey (DHS) and the 2006 Egyptian population census in order to develop indicators that reflect household access to safe drinking water. Understanding the spatial uncertainty associated with linking points (DHS GPS clusters) to polygons (sub-governorate census districts) was essential. Consequently, positional error relevant to DHS GPS clusters was detected, validated, measured and modelled. Selection criteria were developed for choosing the index components and a method for scoring these components was implemented. This was followed by standardisation and weighting of the components before combining them all into a single index. A map demonstrating index values for all Egyptian districts has been created. The index was evaluated against health factors to examine the influences of water accessibility on public health. The same types of datasets (DHS and local census) about another country (Jordan) were explored to examine potential index transferability. This was based on assessing the positional accuracy of the GPS clusters of the Jordanian DHS and evaluating the index construction. Potential limitations of this measurement were discussed and recommendations for further research suggested. Future policies options with a wider incorporation and implementation of GIS and spatial analysis methods were also considere
XPX: Generalized Tweakable Even-Mansour with Improved Security Guarantees
No full text© International Association for Cryptologic Research 2016. We present XPX, a tweakable blockcipher based on a single permutation P. On input of a tweak (t11, t12, t21, t22) ∈ Τ and a message m, it outputs ciphertext c = P(m⊕Δ1)⊕Δ2, where Δ1 = t11k⊕t12P(k) and Δ2 = t21k ⊕ t22P(k). Here, the tweak space Τ is required to satisfy a certain set of trivial conditions (such as (0, 0, 0, 0) ∉ T). We prove that XPX with any such tweak space is a strong tweakable pseudorandom permutation. Next, we consider the security of XPX under related-key attacks, where the adversary can freely select a key-deriving function upon every evaluation. We prove that XPX achieves various levels of related-key security, depending on the set of key-deriving functions and the properties of Τ. For instance, if t12, t22 ≠ 0 and (t21, t22) ≠ (0, 1) for all tweaks, XPX is XOR-related-key secure. XPX generalizes Even- Mansour (EM), but also Rogaway’s XEX based on EM, and various other tweakable blockciphers. As such, XPX finds a wide range of applications. We show how our results on XPX directly imply related-key security of the authenticated encryption schemes Prøst-COPA and Minalpher, and how a straightforward adjustment to the MAC function Chaskey and to keyed Sponges makes them provably related-key secure.sponsorship: This work was supported in part by the Research Council KU Leuven: GOA TENSE (GOA/11/007), and in part by COST Action "Cryptography for Secure Digital Interaction." Bart Mennink is a Postdoctoral Fellow of the Research Foundation - Flanders (FWO). The author would like to thank the DTU Compute team and the anonymous reviewers of CRYPTO 2016 for their comments and suggestions. (Research Council KU Leuven: GOA TENSE|GOA/11/007, COST Action "Cryptography for Secure Digital Interaction")status: Publishe
Pruned bit-reversal permutations: Mathematical characterization, fast algorithms and architectures
No full textA mathematical characterization of serially pruned permutations (SPPs) employed in variable-length permuters and their associated fast pruning algorithms and architectures are proposed. Permuters are used in many signal processing systems for shuffling data and in communication systems as an adjunct to coding for error correction. Typically, only a small set of discrete permuter lengths are supported. Serial pruning is a simple technique to alter the length of a permutation to support a wider range of lengths, but results in a serial processing bottleneck. In this paper, parallelizing SPPs is formulated in terms of recursively computing sums involving integer floor functions using integer operations, in a fashion analogous to evaluating Dedekind sums. A mathematical treatment for bit-reversal permutations (BRPs) is presented, and closed-form expressions for BRP statistics including descents-ascents, major index, excedances-descedances, inversions, and serial correlations are derived. It is shown that BRP sequences have weak correlation properties. Moreover, a new statistic called permutation inliers that characterizes the pruning gap of pruned interleavers is proposed. Using this statistic, a recursive algorithm that computes the minimum inliers count of a pruned BR interleaver (PBRI) in logarithmic time is presented. This algorithm enables parallelizing a serial PBRI algorithm by any desired parallelism factor by computing the pruning gap in lookahead rather than a serial fashion, resulting in significant reduction in interleaving latency and memory overhead. Extensions to 2-D block and stream interleavers, as well as applications to pruned fast Fourier transforms and LTE turbo interleavers, are also presented. Moreover, hardware-efficient architectures for the proposed algorithms are developed. Simulation results of interleavers employed in modern communication standards demonstrate three to four orders of magnitude improvement in interleaving time compared to existing approaches. © 1991-2012 IEEE.3GPP, 2008, 36212 3GPP TS; [Anonymous], 2008, 80220 IEEE; [Anonymous], 2009, 80216 IEEE; [Anonymous], 2011, 302755 ETSI EN; [Anonymous], 2009, 80211N IEEE; BERROU C, 2004, P IEEE INT C COMM IC, V1, P341; Berrou C., 1993, P IEEE INT C COMM IC, V2, P1064, DOI 10.1109-ICC.1993.397441; BINGHAM JAC, 1990, IEEE COMMUN MAG, V28, P5, DOI 10.1109-35.54342; BISWAS A, 1991, IEEE T SIGNAL PROCES, V39, P1415, DOI 10.1109-78.136547; BURRUS CS, 1988, IEEE T ACOUST SPEECH, V36, P1086, DOI 10.1109-29.1631; Chang GJ, 1999, NETWORKS, V33, P261, DOI 10.1002-(SICI)1097-0037(199907)33:4261::AID-NET33.0.CO;2-Q; Clarke RJ, 1997, ADV APPL MATH, V18, P237, DOI 10.1006-aama.1996.0506; COOLEY JW, 1965, MATH COMPUT, V19, P297, DOI 10.2307-2003354; Crozier S, 2001, IEEE VTS VEH TECHNOL, P2394, DOI 10.1109-VTC.2001.957178; DIETER U, 1971, NUMER MATH, V17, P101, DOI 10.1007-BF01406000; Dinoi L, 2005, IEEE T WIREL COMMUN, V4, P2540, DOI 10.1109-TWC.2005.853836; Divsalar D, 1995, MILCOM 95 - CONFERENCE RECORD, VOLS 1-3, P279, DOI 10.1109-MILCOM.1995.483313; Dolinar S., 1995, 42122 JPL TDA; Drouiche K, 2001, IEEE T SIGNAL PROCES, V49, P251, DOI 10.1109-78.890370; Elster A., 1989, P IEEE C AC SPEECH S, V2, P1099; Eroz M, 1999, IEEE VTS VEH TECHNOL, P1669, DOI 10.1109-VETEC.1999.780687; EVANS DMW, 1987, IEEE T ACOUST SPEECH, V35, P1120, DOI 10.1109-TASSP.1987.1165252; Ferrari M, 2002, 2002 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, CONFERENCE PROCEEDINGS, P1711, DOI 10.1109-ICC.2002.997141; FORNEY GD, 1971, IEEE T COMMUN TECHN, VCO19, P772, DOI 10.1109-TCOM.1971.1090719; Gallager R., 1963, LOW DENSITY PARITY C; Garello R, 2001, IEEE T COMMUN, V49, P793, DOI 10.1109-26.923803; He SS, 1996, IEEE SIGNAL PROC LET, V3, P173; HOLM S, 1987, IEEE T ACOUST SPEECH, V35, P1776, DOI 10.1109-TASSP.1987.1165102; Hu Z, 2005, IEEE T SIGNAL PROCES, V53, P274, DOI 10.1109-TSP.2004.838925; JEONG JC, 1992, IEEE T SIGNAL PROCES, V40, P1091, DOI 10.1109-78.134472; Kim K, 1999, IPPS PROC, P268; Knuth D.E., 1998, ART COMPUTER PROGRAM, VII; Lee R., 2004, P INT C INF TECHN CO, V2, P569; MacMahon P. A., 1913, AM J MATH, V35, P281, DOI 10.2307-2370312; MacMahon P. A., 1915, COMBINATORY ANAL, VI; Mansour MM, 2009, IEEE T COMMUN, V57, P3188, DOI 10.1109-TCOMM.2009.11.070661; Mansour MM, 2009, IEEE T VLSI SYST, V17, P1147, DOI 10.1109-TVLSI.2008.2008831; MARKEL JD, 1971, IEEE T ACOUST SPEECH, VAU19, P305, DOI 10.1109-TAU.1971.1162205; Nimbalker A, 2008, IEEE T COMMUN, V56, P1258, DOI 10.1109-TCOMM.2008.050502; Nimbalker A, 2008, IEEE WCNC, P1032; ORCHARD M, 1992, IEEE T SIGNAL PROCES, V40, P1004, DOI 10.1109-78.127979; Parsons A, 2009, IEEE SIGNAL PROC LET, V16, P477, DOI 10.1109-LSP.2009.2016836; Pei SC, 2007, IEEE T SIGNAL PROCES, V55, P1173, DOI 10.1109-TSP.2006.887567; POLGE RJ, 1974, IEEE T COMPUT, VC 23, P1, DOI 10.1109-T-C.1974.223771; Portnoff MR, 1999, IEEE T IMAGE PROCESS, V8, P1265, DOI 10.1109-83.784438; Prado J, 2004, IEEE SIGNAL PROC LET, V11, P933, DOI 10.1109-LSP.2004.838211; RAMSEY JL, 1970, IEEE T INFORM THEORY, V16, P338, DOI 10.1109-TIT.1970.1054443; RIUS JM, 1995, IEEE T SIGNAL PROCES, V43, P991, DOI 10.1109-78.376852; Rodriguez J., 1988, P INT C AC SPEECH SI, V3, P1407; SKODRAS AN, 1991, ELECTRON LETT, V27, P1973, DOI 10.1049-el:19911222; SORENSEN HV, 1993, IEEE T SIGNAL PROCES, V41, P1184, DOI 10.1109-78.205723; SREENIVAS TV, 1980, IEEE T ACOUST SPEECH, V28, P254, DOI 10.1109-TASSP.1980.1163376; SREENIVAS TV, 1979, IEEE T ACOUST SPEECH, V27, P291, DOI 10.1109-TASSP.1979.1163246; Sun J, 2005, IEEE T INFORM THEORY, V51, P101, DOI 10.1109-TIT.2004.839478; Takeshita OY, 2007, IEEE T INFORM THEORY, V53, P2116, DOI 10.1109-TIT.2007.896870; Takeshita OY, 2006, IEEE T INFORM THEORY, V52, P1249, DOI 10.1109-TIT.2005.864450; TANNER RM, 1981, IEEE T INFORM THEORY, V27, P533, DOI 10.1109-TIT.1981.1056404; Verbauwhede I., 1991, Journal of VLSI Signal Processing, V3, DOI 10.1007-BF00925830; Wang LK, 2012, IEEE SIGNAL PROC LET, V19, P167, DOI 10.1109-LSP.2012.2184283; YONG AA, 1991, IEEE T SIGNAL PROCES, V39, P2365, DOI 10.1109-78.91199; ZEHAVI E, 1992, IEEE T COMMUN, V40, P873, DOI 10.1109-26.1414530
A Parallel pruned bit-reversal interleaver
No full textA parallel algorithm and architecture for pruned bit-reversal interleaving (PBRI) are proposed. For a pruned interleaver of size N with mother interleaver size M=2 n ≥ N, the proposed algorithm interleaves any number x ε [0, N- 1] in at most n- 1 steps, as opposed to x steps using existing PBRI algorithms. A parallel architecture of the proposed algorithm employing simple logic gates and having a short critical path delay is presented. The proposed architecture is valuable in reducing (de-)interleaving latency in emerging wireless standards that employ PBRI channel (de-)interleaving in their PHY layer such as the 3GPP2 Ultra Mobile Broadband standard. © 2006 IEEE.DANESHGARAN F, 2004, IEEE T INFORM THEORY, V50, P445; Dobkin R, 2005, IEEE T VLSI SYST, V13, P427, DOI 10.1109-TVLSI.2004.842916; EROZ M, 1999, P IEEE 49 VEH TECHN, V2, P1669; Giulietti A, 2002, ELECTRON LETT, V38, P232, DOI 10.1049-el:20020148; Lin S., 2004, ERROR CONTROL CODING; Prado J, 2004, IEEE SIGNAL PROC LET, V11, P933, DOI 10.1109-LSP.2004.838211; Shao J., 2005, ACM INT C P SERIES, V136, P62; Shin MC, 2003, IEEE COMMUN LETT, V7, P210, DOI 10.1109-LCOMM.2003.812176; Tarable A, 2004, IEEE T INFORM THEORY, V50, P2002, DOI 10.1109-TIT.2004.833353; THUL MJ, 2002, P 9 INT C EL CIRC SY, V3, P1099; WALKER JS, 1990, IEEE T ACOUST SPEECH, V38, P1472, DOI 10.1109-29.57586; 2007, PHYS LAYER STANDARD33
Multi-key Security: The Even-Mansour Construction Revisited
No full textInternational audienceAt ASIACRYPT 1991, Even and Mansour introduced a block cipher construction based on a single permutation. Their construction has since been lauded for its simplicity, yet also criticized for not providing the same security as other block ciphers against generic attacks. In this paper, we prove that if a small number of plaintexts are encrypted under multiple independent keys, the Even-Mansour construction surprisingly offers similar security as an ideal block cipher with the same block and key size. Note that this multi-key setting is of high practical relevance, as real-world implementations often allow frequent rekeying. We hope that the results in this paper will further encourage the use of the Even-Mansour construction, especially when a secure and efficient implementation of a key schedule would result in significant overhead
- …
