4340 search results - page 253 / 868 » Formal Methods and Cryptography |
157
click to vote
FMCAD
2008
Springer
15 years 7 months ago
2008
Springer
The semantics of temporal logic is usually defined with respect to a word representing a computation path over a set of atomic propositions. A temporal logic formula does not contr...
157
click to vote
JCS
2006
15 years 6 months ago
2006
Abstract: Cryptographic protocols are successfully analyzed using formal methods. However, formal approaches usually consider the encryption schemes as black boxes and assume that ...
195
click to vote
EUROCRYPT
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. The Joint Sparse Form is currently the standard representation system to perform multi-scalar multiplications of the form [n]P + m[Q]. We introduce the concept of Joint D...
192
click to vote
ACMSE
2006
ACM
15 years 9 months ago
2006
ACM
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
144
click to vote
ICFCA
2007
Springer
16 years 6 days ago
2007
Springer
Pseudo-intents (also called pseudo-closed sets) of formal contexts have gained interest in recent years, since this notion is helpful for finding minimal representations of impli...