Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Bijan Ansari

dblp:36/3824 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 66% Hardware security and side channels · 34%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 87% Processor architecture and microarchitecture · 13%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Hardware security and side channels
fault attacks		 0.112011
Fault-Based Attack on Montgomery's Ladder Algorithm · J. Cryptol. 2011
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography		 0.122011
High-Performance Architecture of Elliptic Curve Scalar Multiplication · IEEE Trans. Computers 2008
Fault-Based Attack on Montgomery's Ladder Algorithm · J. Cryptol. 2011
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
scalar multiplication		 0.112008
High-Performance Architecture of Elliptic Curve Scalar Multiplication · IEEE Trans. Computers 2008
Integrated circuit design
digital circuit design		 0.112008
High-Performance Architecture of Elliptic Curve Scalar Multiplication · IEEE Trans. Computers 2008
Integrated circuit design › finite field arithmetic
finite field multiplier		 0.112008
High-Performance Architecture of Elliptic Curve Scalar Multiplication · IEEE Trans. Computers 2008
Cryptographic primitives and cryptanalysis
public-key cryptography		 0.012011
Fault-Based Attack on Montgomery's Ladder Algorithm · J. Cryptol. 2011
Processor architecture and microarchitecture › computer arithmetic
pipelined arithmetic		 0.012008
High-Performance Architecture of Elliptic Curve Scalar Multiplication · IEEE Trans. Computers 2008

Methods — techniques the papers use, named apart from their topics

pseudo-pipelined word serial multiplication · 0.2montgomery ladder · 0.2
YearPublicationVenuePosition
2011 Fault-Based Attack on Montgomery's Ladder Algorithm
Agustin Dominguez-Oviedo, M. Anwar Hasan, Bijan Ansari
 J. Cryptol.3
2008 High-Performance Architecture of Elliptic Curve Scalar Multiplication
abstract
A high performance architecture of elliptic curve scalar multiplication based on the Montgomery ladder method over finite field GF(2m) is proposed. A pseudo-pipelined word serial finite field multiplier with word size w, suitable for the scalar multiplication is also developed. Implemented in hardware, this system performs a scalar multiplication in approximately 6⌈m/w⌉(m−1) clock cycles and the gate delay in the critical path is equal to TAND + ⌈log2(w/k)⌉TXOR, where TAND and TXOR are delays due to two-input AND and XOR gates respectively and 1 ≤ k ≪ w is used to shorten the critical path.
Bijan Ansari, M. Anwar Hasan
 IEEE Trans. Computers1