Completeness (cryptography)

Completeness (cryptography)

Jesse Russell Ronald Cohn

     

бумажная книга

Продать эту книгу

ISBN: 978-5-5120-8197-6

High Quality Content by WIKIPEDIA articles! In cryptography, a boolean function is said to be complete if the value of each output bit depends on all input bits.

Каталог