搜索结果: 1-5 共查到“signature verification”相关记录5条 . 查询时间(0.06 秒)
BLOCKWISE BINARY PATTERN: A ROBUST AND AN EFFICIENT APPROACH FOR OFFLINE SIGNATURE VERIFICATION
BLOCKWISE BINARY PATTERN EFFICIENT APPROACH FOR OFFLINE SIGNATURE VERIFICATION
font style='font-size:12px;'>
2017/6/19
This paper presents a variant of local binary pattern called Blockwise Binary Pattern (BBP) for the offline signature verification. The proposed approach has three major phases : Preprocessing, Featur...
Low-Latency ECDSA Signature Verification - A Road Towards Safer Traffic -
ECDSA signature verification NIST P-256
font style='font-size:12px;'>
2016/1/6
Car-to-car and Car-to-Infrastructure messages exchanged in Intelligent Transportation Systems can
reach reception rates up to and over 1000 messages per second. As these messages contain ECDSA signat...
Offline Signature Verification Using Graph Matching
Offline Signature Verification Graph Matching Thinning Normalization
font style='font-size:12px;'>
2009/7/28
In this paper, we present a simple and effective signature verification method that depends only on the raw binary pixel intensities and avoids using complex sets of features. The method looks at the ...
Faster Multi-Exponentiation through Caching:Accelerating (EC)DSA Signature Verification
Efficient implementation elliptic curve cryptography ECDSA verification
font style='font-size:12px;'>
2009/6/2
Q We consider the task of computing power products
1ik gei
i (“multi-exponentiation”) where base elements g2, . . ., gk are
fixed while g1 is variable between multi-exponentiations but may repea...
Faster Multi-Exponentiation through Caching:Accelerating (EC)DSA Signature Verification
Efficient implementation elliptic curve cryptography ECDSA verification exponentiation DSA verification
font style='font-size:12px;'>
2008/5/20
We consider the task of computing power products Q1ik gei
i (“multi-exponentiation”) where base elements g2, . . ., gk are
fixed while g1 is variable between multi-exponentiations but may repeat,
...