277:
24:
247:
23:
314:
254:
338:
348:
197:
307:
72:
343:
333:
300:
92:
8:
153:
129:
208:
213:
288:
284:
85:
327:
103:
164:
229:
179:
110:
2 complexity meet-in-the-middle preimage attack against EnRUPT hash,
124:
is a block cipher and a family of cryptographic algorithms based on
62:
245:
115:
Chosen plaintext attack with 2 queries against EnRUPT block cipher
195:
276:
125:
50:
154:"EnRUPT: First all-in-one symmetric cryptographic primitive"
177:
325:
151:
308:
178:Khovratovich, Dmitry; Nikolić, Ivica (2008).
196:Sebastiaan Indesteege; Bart Preneel (2009).
132:but it wasn't selected to the second round.
315:
301:
147:
145:
212:
246:Sean O'Neil; Karsten Nohl; Luca Henzen.
128:. EnRUPT hash function was submitted to
283:This cryptography-related article is a
227:
142:
112:collision attack with 2 time complexity
97:8 * (plaintext words) + 4 * (key words)
77:arbitrary, at least two words (64 bits)
326:
271:
248:"EnRUPT Hash Function Specification"
13:
14:
360:
198:"Practical Collisions for EnRUPT"
275:
22:
230:"Cryptanalysis of block EnRUPT"
239:
221:
207:. FSE 2009. pp. 246–259.
189:
171:
1:
135:
287:. You can help Knowledge by
214:10.1007/978-3-642-03317-9_15
7:
10:
365:
270:
203:. In Orr Dunkelman (ed.).
86:Unbalanced Feistel Network
180:"Cryptanalysis of EnRUPT"
109:
101:
91:
81:
71:
61:
56:
46:
38:
33:
21:
205:Fast Software Encryption
228:Yarrkov, Elias (2010).
339:Broken block ciphers
152:Sean O'Neil (2008).
51:Corrected Block TEA
28:One round of EnRUPT
18:
349:Cryptography stubs
165:SASC 2008 workshop
16:
296:
295:
130:SHA-3 competition
119:
118:
356:
317:
310:
303:
279:
272:
262:
261:
260:on 13 July 2010.
259:
253:. Archived from
252:
243:
237:
236:
234:
225:
219:
218:
216:
202:
193:
187:
186:
184:
175:
169:
168:
158:
149:
26:
19:
15:
364:
363:
359:
358:
357:
355:
354:
353:
344:Feistel ciphers
324:
323:
322:
321:
268:
266:
265:
257:
250:
244:
240:
232:
226:
222:
200:
194:
190:
182:
176:
172:
161:Workshop Record
156:
150:
143:
138:
113:
39:First published
29:
12:
11:
5:
362:
352:
351:
346:
341:
336:
320:
319:
312:
305:
297:
294:
293:
280:
264:
263:
238:
220:
188:
170:
140:
139:
137:
134:
117:
116:
107:
106:
99:
98:
95:
89:
88:
83:
79:
78:
75:
69:
68:
65:
59:
58:
54:
53:
48:
44:
43:
40:
36:
35:
31:
30:
27:
9:
6:
4:
3:
2:
361:
350:
347:
345:
342:
340:
337:
335:
334:Block ciphers
332:
331:
329:
318:
313:
311:
306:
304:
299:
298:
292:
290:
286:
281:
278:
274:
273:
269:
256:
249:
242:
231:
224:
215:
210:
206:
199:
192:
181:
174:
166:
162:
155:
148:
146:
141:
133:
131:
127:
123:
114:
108:
105:
104:cryptanalysis
100:
96:
94:
90:
87:
84:
80:
76:
74:
70:
66:
64:
60:
57:Cipher detail
55:
52:
49:
45:
41:
37:
32:
25:
20:
289:expanding it
282:
267:
255:the original
241:
223:
204:
191:
173:
160:
121:
120:
111:
102:Best public
47:Derived from
73:Block sizes
328:Categories
136:References
82:Structure
63:Key sizes
67:variable
34:General
122:EnRUPT
93:Rounds
17:EnRUPT
258:(PDF)
251:(PDF)
233:(PDF)
201:(PDF)
183:(PDF)
157:(ZIP)
126:XXTEA
285:stub
42:2008
209:doi
330::
163:.
159:.
144:^
316:e
309:t
302:v
291:.
235:.
217:.
211::
185:.
167:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
