Sciweavers

24 search results - page 4 / 5
» Practical leakage-resilient pseudorandom generators
Sort
View
118
Voted
FUN
2010
Springer
306views Algorithms» more  FUN 2010»
15 years 4 months ago
Leveling-Up in Heroes of Might and Magic III
We propose a model for level-ups in Heroes of Might and Magic III, and give an O 1 ε2 ln 1 δ learning algorithm to estimate the probabilities of secondary skills induced by any ...
Dimitrios I. Diochnos
LATINCRYPT
2010
14 years 10 months ago
Generic Attacks on Misty Schemes
Abstract. Misty schemes are classic cryptographic schemes used to construct pseudo-random permutations from 2n bits to 2n bits by using d pseudo-random permutations from n bits to ...
Valérie Nachef, Jacques Patarin, Joana Treg...
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
15 years 3 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
73
Voted
ITC
2000
IEEE
91views Hardware» more  ITC 2000»
15 years 4 months ago
A mixed mode BIST scheme based on reseeding of folding counters
In this paper a new scheme for deterministic and mixed mode scan-based BIST is presented. It relies on a new type of test pattern generator which resembles a programmable Johnson ...
Sybille Hellebrand, Hans-Joachim Wunderlich, Huagu...
80
Voted
ACISP
2010
Springer
15 years 1 months ago
One-Time-Password-Authenticated Key Exchange
To reduce the damage of phishing and spyware attacks, banks, governments, and other security-sensitive industries are deploying one-time password systems, where users have many pa...
Kenneth G. Paterson, Douglas Stebila