Sciweavers

130 search results - page 18 / 26
» How to Encrypt with a Malicious Random Number Generator
Sort
View
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 9 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
ICCBR
2003
Springer
14 years 1 months ago
Soft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Proble...
Nicoleta Neagu, Boi Faltings
LATINCRYPT
2010
13 years 7 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...
DATE
2008
IEEE
148views Hardware» more  DATE 2008»
14 years 3 months ago
On Analysis and Synthesis of (n, k)-Non-Linear Feedback Shift Registers
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
Elena Dubrova, Maxim Teslenko, Hannu Tenhunen
KBSE
2005
IEEE
14 years 2 months ago
AMNESIA: analysis and monitoring for NEutralizing SQL-injection attacks
The use of web applications has become increasingly popular in our routine activities, such as reading the news, paying bills, and shopping on-line. As the availability of these s...
William G. J. Halfond, Alessandro Orso