Sciweavers

281 search results - page 17 / 57
» Non-black-box Techniques in Cryptography
Sort
View
SIAMCOMP
2010
88views more  SIAMCOMP 2010»
15 years 24 days ago
Hardness Amplification Proofs Require Majority
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
Ronen Shaltiel, Emanuele Viola
TCOS
2010
15 years 23 days ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
CHES
2004
Springer
148views Cryptology» more  CHES 2004»
15 years 11 months ago
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
We present an implementation of elliptic curves and of hyperelliptic curves of genus 2 and 3 over prime fields. To achieve a fair comparison between the different types of groups,...
Roberto Maria Avanzi
ACMSE
2006
ACM
15 years 9 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
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...
Selçuk Baktir, Berk Sunar
CN
2007
117views more  CN 2007»
15 years 6 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...