搜索结果: 1-4 共查到“军事学 Run”相关记录4条 . 查询时间(0.014 秒)
Design in Type-I, Run in Type-III: Fast and Scalable Bilinear-Type Conversion using Integer Programming
Conversion Bilinear Groups Integer Programming
2016/6/6
Bilinear-type conversion is to convert cryptographic schemes designed over symmetric groups instantiated with imperilled curves into ones that run over more secure and efficient asymmetric groups. In ...
Side-Channel Watchdog: Run-Time Evaluation of Side-Channel Vulnerability in FPGA-Based Crypto-systems
Side-Channel Vulnerability FPGA-Based Crypto-systems
2016/2/24
Besides security against classical cryptanalysis, its important
for cryptographic implementations to have sufficient robustness against
side-channel attacks. Many countermeasures have been proposed ...
How to Run Turing Machines on Encrypted Data
Functional encryption Fully homomorphic encryption
2014/3/13
Algorithms for computing on encrypted data promise to be a fundamental building block of cryptography. The way one models such algorithms has a crucial effect on the efficiency and usefulness of the r...
Tim Cook,No Place to Run: The Canadian Corps and Gas Warfare in the First World War
Tim Cook Canadian Corps Gas Warfare First World War
2009/3/12
The desperate stand of Canadian troops against the German gas attack at Second Ypres has long been immortalized but as Tim Cook astutely argues, gas itself has been relegated to the historical periphe...