Results 201 to 210 of about 3,809 (235)

Anatomical characteristics of the styloid process associated with internal carotid artery dissection: a systematic review and meta-analysis of controlled trials. [PDF]

Front Radiol
Klail T, Kalioras E, von Gernler M, Giger R, Exadaktylos AK, Müller M, Wagner F.   +6 more
europepmc   +1 more source

CRATER tumor niches facilitate CD8⁺ T cell engagement and correspond with immunotherapy success. [PDF]

Cell
Ludin A, Stirtz GL, Tal A, Nirmal AJ, Pfaff KL, Manos M, Besson N, Eskndir N, Porter B, Jones SM, Faulkner HM, Gong Q, Liu S, Barrera I, Wu L, Pessoa Rodrigues C, Sahu A, Jerison E, Alessi JV, Ricciuti B, Richardson DS, Weiss JD, Moreau HM, Stanhope ME, Afeyan AB, Sefton J, McCall WD, Formato E, Yang S, Zhou Y, Hoytema van Konijnenburg DP, Cole HL, Cordova M, Deng L, Rajadhyaksha M, Quake SR, Awad MM, Chen F, Wucherpfennig KW, Sorger PK, Hodi FS, Rodig SJ, Murphy GF, Zon LI.   +43 more
europepmc   +1 more source

Related-Key Rectangle Attack on 42-Round SHACAL-2

Lecture Notes in Computer Science, 2006
Based on the compression function of the hash function standard SHA-256, SHACAL-2 is a 64-round block cipher with a 256-bit block size and a variable length key of up to 512 bits. In this paper, we present a related-key rectangle attack on 42-round SHACAL-2, which requires 2243.38 related-key chosen plaintexts and has a running time of 2488.37. This is
Jiqiang Lu, Jongsung Kim, Nathan Keller   +2 more
exaly   +7 more sources

Related-key rectangle attack on 36 rounds of the XTEA block cipher

International Journal of Information Security, 2008
XTEA is a 64-round block cipher with a 64-bit block size and a 128-bit user key, which was designed as a short C program that would run safely on most computers. In this paper, we present a related-key rectangle attack on a series of inner 36 rounds of XTEA without making a weak key assumption, and a related-key rectangle attack on the first 36 rounds ...
Jiqiang Lu, Lu Jiqiang
exaly   +4 more sources

Integral Attack on Reduced-Round Rectangle

2015 IEEE 2nd International Conference on Cyber Security and Cloud Computing, 2015
RECTANGLE is a 64-bit block cipher with 80 and 128-bit key length proposed by Zhang et al(Lightweight Cryptography Workshop 2015). Integral attack is one of the typical evaluation tools of block cipher. The designers showed 7-round integral distinguisher.
Haruhisa Kosuge, Hidema Tanaka
exaly   +3 more sources

Rectangle Algebraic Attack of Serpent Encryption Algorithm

2010 International Symposium on Intelligence Information Processing and Trusted Computing, 2010
After exploring multi-round difference feature of Serpent encryption algorithm and using the method of constructing S-boxes algebraic equations, we put forward Rectangle algebraic attack of 10-round Serpent-256. This method analyzed that 10-round Serpent-256 needed 2×2144 ×210 = 2155 pairs of selective plaintexts, 2155 times of 10-round encryption and ...
Wenlue Chen, Boli Li, Zhihua Hu
exaly   +3 more sources

Optimizing Rectangle and Boomerang Attacks: A Unified and Generic Framework for Key Recovery [PDF]

Journal of Cryptology
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qianqian Yang, Danping Shi, Libo Wang
exaly   +5 more sources

Some of the next articles are maybe not open access.

Related searches:

Improved Rectangle Attack on SMS4 Reduced to 18 Rounds

2013 Ninth International Conference on Computational Intelligence and Security, 2013
SMS4 is a 32-round block cipher with 128-bit block size and 128-bit secret key. It is used in WAPI, the Chinese WLAN national standard. In this paper, we analyze the security of SMS4 against the rectangle attack. First we describe two properties of SMS4. Next, we propose the 16-round rectangle distinguisher with probability 2-250.
Xianglong Kong, Qiuliang Xu
exaly   +2 more sources

Quantum rectangle attack and its application on Deoxys-BC

Designs, Codes, and Cryptography
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zheng Yuan
exaly   +3 more sources

Countering overlapping rectangle privacy attack for moving kNN queries

Information Systems, 2013
An important class of LBSs is supported by the moving k nearest neighbor (MkNN) query, which continuously returns the k nearest data objects for a moving user. For example, a tourist may want to observe the five nearest restaurants continuously while exploring a city so that she can drop in to one of them anytime.
Tanzima Hashem, Rui Zhang
exaly   +2 more sources