搜索结果: 1-6 共查到“军事学 Natural”相关记录6条 . 查询时间(0.171 秒)
Cracking-Resistant Password Vaults using Natural Language Encoders
Honey Encryption Password Password vault
2015/12/24
Password vaults are increasingly popular applications that store multiple passwords encrypted under a single master password that the user memorizes. A password vault can greatly reduce the burden on ...
Analysis of some natural variants of the PKP Algorithm
identification scheme zero knowledge permuted kernel problem
2012/8/28
In 1989, Adi Shamir proposed a new zero-knowledge identification scheme based on a NP-complete problem called PKP for Permuted Kernel Problem. For a given prime p, a given matrix A and a given vector ...
Analysis of some natural variants of the PKP Algorithm
identification scheme zero knowledge permuted kernel problem
2012/6/14
In 1989, Adi Shamir proposed a new zero-knowledge identification scheme based on a NP-complete problem called PKP for Permuted Kernel Problem. For a given prime p, a given matrix A and a given vector ...
Analysis of some natural variants of the PKP Algorithm
public-key cryptography / identification scheme zero knowledge permuted kernel problem
2012/3/20
In 1989, Adi Shamir proposed a new zero-knowledge identification scheme based on a NP-complete problem called PKP for Permuted Kernel Problem. For a given prime p, a given matrix A and a given vector ...
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs
foundations / Advanced encryption standard (AES circuit exponential hardness lower bound natural proofs pseudorandom function (PRF) TC^0 Turing machine
2012/3/28
We put forth several simple candidate pseudorandom functions $f_k : \zo^n \to \zo$ with security (a.k.a.~hardness) $2^n$ that are inspired by the AES block-cipher by Daemen and Rijmen (2000). The func...
The Advanced Encryption Standard, Candidate Pseudorandom Functions, and Natural Proofs
foundations / Advanced encryption standard (AES) circuit exponential hardness lower bound natural proofs pseudorandom function (PRF) TC^0 Turing machine
2011/6/8
We put forth several simple candidate pseudorandom functions $f_k : \zo^n \to \zo$ with security (a.k.a.~hardness) $2^n$ that are inspired by the AES block-cipher by Daemen and Rijmen (2000). The func...