Showing cs.ITShow all
2 papers · 1 filter
cs.IT2007
Bounds on Key Appearance Equivocation for Substitution Ciphers
Yuri Borissov, Moon Ho Lee
The average conditional entropy of the key given the message and its corresponding cryptogram, H(K|M,C), which is reffer as a key appearance equivocation, was proposed as a theoret…
cs.IT2006★ 1 cited
A New Fault-Tolerant M-network and its Analysis
R. N. Mohan, P. T. Kulkarni
This paper introduces a new class of efficient inter connection networks called as M-graphs for large multi-processor systems.The concept of M-matrix and M-graph is an extension of…