Sciweavers

301 search results - page 25 / 61
» An efficient algorithm to verify generalized false paths
Sort
View
GLVLSI
2007
IEEE
166views VLSI» more  GLVLSI 2007»
14 years 10 days ago
Efficient pipelining for modular multiplication architectures in prime fields
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...
Nele Mentens, Kazuo Sakiyama, Bart Preneel, Ingrid...
WWW
2004
ACM
14 years 9 months ago
Affinity rank: a new scheme for efficient web search
Maximizing only the relevance between queries and documents will not satisfy users if they want the top search results to present a wide coverage of topics by a few representative...
Yi Liu, Benyu Zhang, Zheng Chen, Michael R. Lyu, W...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
14 years 11 days ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
TWC
2008
109views more  TWC 2008»
13 years 8 months ago
Using the physical layer for wireless authentication in time-variant channels
Abstract--The wireless medium contains domain-specific information that can be used to complement and enhance traditional security mechanisms. In this paper we propose ways to expl...
Liang Xiao, Larry J. Greenstein, Narayan B. Manday...
APLAS
2008
ACM
13 years 10 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...