Sciweavers

397 search results - page 32 / 80
» Pseudorandom Functions and Lattices
Sort
View
MOC
2000
111views more  MOC 2000»
15 years 1 months ago
Voronoi's algorithm in purely cubic congruence function fields of unit rank 1
The first part of this paper classifies all purely cubic function fields over a finite field of characteristic not equal to 3. In the remainder, we describe a method for computing ...
Renate Scheidler, Andreas Stein
COMGEO
2006
ACM
15 years 1 months ago
A new algorithmic approach to the computation of Minkowski functionals of polyconvex sets
An algorithm is proposed for the simultaneous computation of all Minkowski functionals (except for the volume) of sets from the convex ring in Rd discretized with respect to a give...
Simone Klenk, Volker Schmidt, Evgueni Spodarev
AAECC
1990
Springer
100views Algorithms» more  AAECC 1990»
15 years 5 months ago
Duality between Two Cryptographic Primitives
This paper reveals a duality between constructions of two basic cryptographic primitives, pseudo-random string generators and one-way hash functions. Applying the duality, we pres...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
ICCSA
2010
Springer
15 years 3 months ago
An Identifiable Yet Unlinkable Authentication System with Smart Cards for Multiple Services
The purpose of this paper is to realize an authentication system which satisfies four requirements for security, privacy protection, and usability, that is, impersonation resistanc...
Toru Nakamura, Shunsuke Inenaga, Daisuke Ikeda, Ke...
CISS
2007
IEEE
15 years 3 months ago
A Union Bound Approximation for Rapid Performance Evaluation of Punctured Turbo Codes
— In this paper, we present a simple technique to approximate the performance union bound of a punctured turbo code. The bound approximation exploits only those terms of the tran...
Ioannis Chatzigeorgiou, Miguel R. D. Rodrigues, Ia...