2432 search results - page 101 / 487 » Cryptographic logical relations |
108
click to vote
CRYPTO
2008
Springer
15 years 2 months ago
2008
Springer
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
133
Voted
TIT
2008
15 years 15 days ago
2008
Abstract. The recent algebraic attacks have received a lot of attention in cryptographic literature. The algebraic immunity of a Boolean function quantifies its resistance to the s...
77
Voted
CHES
2001
Springer
15 years 5 months ago
2001
Springer
Attacks are presented on the IBM 4758 CCA and the Visa Security Module. Two new attack principles are demonstrated. Related key attacks use known or chosen differences between two...
112
Voted
INFORMATICALT
2010
14 years 10 months ago
2010
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
100
Voted
CODES
2007
IEEE
15 years 7 months ago
2007
IEEE
In current Field-Programmable-Logic Architecture (FPGA) design flows, it is very hard to control the routing of submodules. It is thus very hard to make an identical copy of an ex...