SEMINAR TOPICS

Mechanical

Electronics

Electrical

Civil

Computer / IT

Electronics & Instrumentation

Management

STUDY HELp DeSK

SEMINAR TOPICS

EXAMINATION TIPS

MEMORY TIPS

INTERVIEW TIPS

C.V TIPS

PROJECT GUIDANCE

 

 

Acoustic cryptanalysis	Acoustic cryptanalysis is a side channel attack which exploits sounds, audible or not, produced during a computation or input-output operation. In 2004, Dmitri Asonov and Rakesh Agrawal of the IBM Almaden Research Center announced that computer keyboards and keypads used on telephones and automated teller machines (ATMs) are vulnerable to attacks based on differentiating the sound produced by different keys. Their attack employed a neural network to recognize the key being pressed. By analyzing recorded sounds, they were able to recover the text of data being entered. These techniques allow an attacker using covert listening devices to obtain passwords, passphrases, personal identification numbers (PINs) and other security information. Also in 2004, Adi Shamir and Eran Tromer demonstrated that it may be possible to conduct timing attacks against a CPU performing cryptographic operations by analysis of variations in its humming noise. In his book Spycatcher, former MI5 operative Peter Wright discusses use of an acoustic attack against Egyptian Hagelin cipher machines in 1956. The attack was codenamed 'ENGULF'.
Adaptive Partition Scheduler	Adaptive Partition Schedulers are a relatively new type of partition scheduler, pioneered with the most recent version of the QNX operating system. Adaptive Partitioning (or AP) allows the real-time system designer to request that a percentage of processing resources be reserved for a particular subsystem (group of threads and/or processes). The operating systems priority driven pre-emptive scheduler will behave in the same way that a non-AP system would until the system is overloaded (i.e. system-wide there is more computation to perform, than the processor is capable of sustaining over the long term). During overload, the AP scheduler enforces hard limits on total run-time for the subsystems within a partition (as dictated by the allocated percentage of processor bandwidth for the particular partition). If the system is not overloaded, a partition that is allocated (for example) 10% of the processor bandwidth, can, in fact, use more than 10%, as it will borrow from the spare budget of other partitions (but will be required to pay it back later). This is very useful for the non real-time subsystems that experience variable load, since these subsystems can make use of spare budget from hard real-time partitions in order to make more forward progress than they would in a Fixed Partition Scheduler such as ARINC-653, but without impacting the hard real-time subsystems deadlines.
ZIgbee the wireless future

See Computer Seminar topics without ABSTRACT

SEE MORE & MORE>>

<<PREVIOUS                           NEXT>>