default search action
Benjamin Arazi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j27]Christy M. Gearheart, Benjamin Arazi, Eric C. Rouchka:
DNA-based random number generation in security circuitry. Biosyst. 100(3): 208-214 (2010) - [j26]Christy M. Gearheart, Eric C. Rouchka, Benjamin Arazi:
Design of a DNA-based shift register. BMC Bioinform. 11(S-4): P31 (2010) - [c6]Srinivasa Anuradha Bulusu, Benjamin Arazi, Itamar Arel, Andrew S. Davis, George Bitar:
A data security protocol for the Trusted Truck® system. CSIIRW 2010: 37
2000 – 2009
- 2009
- [j25]Benjamin Arazi:
Message Authentication in Computationally Constrained Environments. IEEE Trans. Mob. Comput. 8(7): 968-974 (2009) - [c5]Aleksey Y. Ashikhmin, James H. Graham, Ahmed H. Desoky, Benjamin Arazi:
Design of a Hierarchical Principal Component Analysis System for Field Intrusion Detection. CAINE 2009: 125-132 - [c4]Aleksey Y. Ashikhmin, James H. Graham, Ahmed H. Desoky, Benjamin Arazi:
Intrusion Detection System for SCADA Networks. CATA 2009: 156-161 - 2008
- [j24]Christy M. Bogard, Eric C. Rouchka, Benjamin Arazi:
Random number generation for DNA-based security circuitry. BMC Bioinform. 9(S-7) (2008) - [j23]Benjamin Arazi:
Computationally Efficient Distributed and Delegated Certification. IEEE Trans. Parallel Distributed Syst. 19(9): 1167-1174 (2008) - [c3]Benjamin Arazi:
Mobile components security. CSIIRW 2008: 34:1-34:2 - 2007
- [c2]James H. Graham, Mostafa S. Mostafa, Benjamin Arazi, Ashraf Tantawy, Jeffrey L. Hieb, Patricia A. S. Ralston, Sandip C. Patel:
Improvements in SCADA and DCS Systems Security. CATA 2007: 194-200 - 2006
- [j22]Benjamin Arazi:
Enhancing Security with Nanotechnology. Computer 39(10): 106-107 (2006) - [j21]Benjamin Arazi:
Communication-Computation Trade-off in Executing ECDSA in a Contactless Smartcard. Des. Codes Cryptogr. 38(3): 399-415 (2006) - 2005
- [j20]Benjamin Arazi, Itamar Elhanany, Ortal Arazi, Hairong Qi:
Revisiting Public-Key Cryptography for Wireless Sensor Networks. Computer 38(11): 103-105 (2005)
1990 – 1999
- 1994
- [j19]Benjamin Arazi:
On Primality Testing using Purely Divisionless Operations. Comput. J. 37(3): 219-222 (1994) - 1993
- [j18]Benjamin Arazi:
Double-Precision Modular Multiplication Based on a Single-Precision Modular Multiplier and a Standard CPU. IEEE J. Sel. Areas Commun. 11(5): 761-769 (1993) - [j17]Benjamin Arazi:
Architectures for Exponentiation Over GF(2^n) Adopted for Smartcard Application. IEEE Trans. Computers 42(4): 494-497 (1993) - 1992
- [j16]Benjamin Arazi:
A Circular Binary Search. IEEE Trans. Computers 41(1): 109-112 (1992) - 1991
- [j15]Yoheved Dotan, Benjamin Arazi:
Using Flat Concurrent Prolog in System Modeling. IEEE Trans. Software Eng. 17(6): 493-512 (1991) - [c1]Benjamin Arazi:
Position Recovery on a Circle Based on Coding Theory. Algebraic Coding 1991: 87-101 - 1990
- [j14]Yoheved Dotan, Benjamin Arazi:
Concurrent Logic Programming as a Hardware Description Tool. IEEE Trans. Computers 39(1): 72-88 (1990)
1980 – 1989
- 1989
- [j13]Benjamin Arazi, Its'hak Dinstein, Oded Kafri:
Intuition, perception, and secure communication. IEEE Trans. Syst. Man Cybern. 19(5): 1016-1020 (1989) - 1988
- [b1]Benjamin Arazi:
A commonsense approach to the theory of error correcting codes. MIT Press Series in Computer Systems, MIT Press 1988, ISBN 978-0-262-01098-6, pp. I-X, 1-208 - 1986
- [j12]Benjamin Arazi:
A Binary Search with a Parallel Recovery of the Bits. SIAM J. Comput. 15(3): 851-855 (1986) - 1985
- [j11]Benjamin Arazi:
An electrooptical adder. Proc. IEEE 73(1): 162-163 (1985) - 1984
- [j10]Benjamin Arazi:
An Approach for Generating Different Types of Gray Codes. Inf. Control. 63(1/2): 1-10 (1984) - 1983
- [j9]Benjamin Arazi:
Automatic handwriting identification based on the external properties of the samples. IEEE Trans. Syst. Man Cybern. 13(4): 635-642 (1983) - 1981
- [j8]Benjamin Arazi:
On the Synthesis of de-Bruijn Sequences. Inf. Control. 49(2): 81-90 (1981) - 1980
- [j7]Benjamin Arazi:
A trapdoor multiple mapping (Corresp.). IEEE Trans. Inf. Theory 26(1): 100-102 (1980)
1970 – 1979
- 1978
- [j6]Benjamin Arazi:
The Optimal Burst-Error Correction Capability of the Codes Generated by f(X) = (X^p+1)(X^q+1)/(X+1). Inf. Control. 39(3): 303-314 (1978) - [j5]J. H. J. Filter, Benjamin Arazi, R. G. W. Thomson:
The Fadeogram, A Sonogram-Like Display of the Time-Varying Frequency Response of HF-SSB Radio Channels. IEEE Trans. Commun. 26(6): 913-917 (1978) - 1977
- [j4]Benjamin Arazi:
Self Synchronizing Digital Scramblers. IEEE Trans. Commun. 25(12): 1505-1507 (1977) - 1976
- [j3]Benjamin Arazi:
Improving the Throughput of an ARQ Stop and Wait Scheme for Burst Noise Channels. IEEE Trans. Commun. 24(6): 661-663 (1976) - 1975
- [j2]Benjamin Arazi:
An Optimal Coding Scheme for a Certain Type of Ensemble. IEEE Trans. Commun. 23(7): 741-743 (1975) - 1974
- [j1]Benjamin Arazi:
Hadamard Transforms of Magnified, Expanded, and Periodic Signals. IEEE Trans. Commun. 22(6): 848-850 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint