Statistical Trend Analysis of Physically Unclonable Functions
Home > References & Encyclopaedias > Research & information: general > Decision theory: general > Statistical Trend Analysis of Physically Unclonable Functions
Statistical Trend Analysis of Physically Unclonable Functions

Statistical Trend Analysis of Physically Unclonable Functions


     0     
5
4
3
2
1



Available


About the Book

Physically Unclonable Functions (PUFs) translate unavoidable variations in certain parameters of materials, waves, or devices into random and unique signals. They have found many applications in the Internet of Things (IoT), authentication systems, FPGA industry, several other areas in communications and related technologies, and many commercial products.

Statistical Trend Analysis of Physically Unclonable Functions first presents a review on cryptographic hardware and hardware-assisted cryptography. The review highlights PUF as a mega trend in research on cryptographic hardware design. Afterwards, the authors present a combined survey and research work on PUFs using a systematic approach. As part of the survey aspect, a state-of-the-art analysis is presented as well as a taxonomy on PUFs, a life cycle, and an established ecosystem for the technology. In another part of the survey, the evolutionary history of PUFs is examined, and strategies for further research in this area are suggested.

In the research side, this book presents a novel approach for trend analysis that can be applied to any technology or research area. In this method, a text mining tool is used which extracts 1020 keywords from the titles of the sample papers. Then, a classifying tool classifies the keywords into 295 meaningful research topics. The popularity of each topic is then numerically measured and analyzed over the course of time through a statistical analysis on the number of research papers related to the topic as well as the number of their citations. The authors identify the most popular topics in four different domains; over the history of PUFs, during the recent years, in top conferences, and in top journals. The results are used to present an evolution study as well as a trend analysis and develop a roadmap for future research in this area. This method gives an automatic popularity-based statistical trend analysis which eliminates the need for passing personal judgments about the direction of trends, and provides concrete evidence to the future direction of research on PUFs. Another advantage of this method is the possibility of studying a whole lot of existing research works (more than 700 in this book).

This book will appeal to researchers in text mining, cryptography, hardware security, and IoT.


About the Author:

Behrouz Zolfaghari is currently a postdoctoral fellow at Indian Institute of Technology Guwahati. His research interests include hardware-oriented cryptography, information-theoretic cryptography, information theory, VLSI design and discrete mathematics.

Khodakhast Bibak is an Assistant Professor at the Department of Computer Science and Software Engineering at Miami University. Previously, he was a Postdoctoral Research Associate (September 2017 - August 2018) in the Coordinated Science Laboratory at the University of Illinois at Urbana-Champaign. Before this, Khodakhast was a Postdoctoral Research Fellow (May-August 2017) at the Department of Computer Science, University of Victoria, from where he also received his PhD (April 2017). He earned a Master of Mathematics degree (April 2013) at the Department of Combinatorics and Optimization, University of Waterloo, where he was also a member of the Centre for Applied Cryptographic Research (CACR). Khodakhast's research interests are Cybersecurity, Applied Cryptography, Information Theory, Communications, Quantum Information Science (QIS), and related areas.

Takeshi Koshiba received the PhD degree from Tokyo Institute of Technology. He is a full professor at the Department of Mathematics, the Faculty of Education and Integrated Arts and Sciences, Waseda University, Japan. His interests include theoretical and applied cryptography, the randomness in algorithms, and quantum computing and cryptography.

Hamid R. Nemati is a full Professor of Information Systems at the University of North Carolina at Greensboro. He received his PhD from the University of Georgia in Information Technology and Management Science and his MBA from The University of Massachusetts. He is internationally recognized for his research in various aspects of Information Technology, including data analytics, big data, information security and privacy, organizational and behavioral aspects of Information Technology development and use. He has extensive professional experience as a developer, an analyst and project leader and has been a consultant for numerous major corporations. He has published nine books and over 120 peer reviewed academic publications in various premier scholarly and professional journals and conference proceedings.

Pinaki Mitra is currently an associate professor at Department of Computer Science & Engineering, IIT Guwahati. He obtained his B. Tech in Computer Science and Engineering from Jadavpur University, Kolkata in 1987, India and his M. Tech in Computer Science and Engineering from Indian Institute of Science Bangalore, India in 1989. Finally, he obtained his Ph. D from Simon Fraser University, Canada in 1994. He worked on a project at Jadavpur University, department of Computer Science and Engineering. Subsequently he joined National Institute of Management, Kolkata, and served as an assistant professor. He joined IIT Guwahati in December, 2004. His research interest includes Cryptography, Network Security, Computer Graphics, Multimedia and Machine Learning.


Best Sellers



Product Details
  • ISBN-13: 9780367754556
  • Publisher: Taylor and Francis
  • Publisher Imprint: CRC Press
  • Height: 216 mm
  • No of Pages: 148
  • Spine Width: 11 mm
  • Weight: 385 gr
  • ISBN-10: 036775455X
  • Publisher Date: 25 Mar 2021
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Sub Title: An Approach via Text Mining
  • Width: 140 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Statistical Trend Analysis of Physically Unclonable Functions
Taylor and Francis -
Statistical Trend Analysis of Physically Unclonable Functions
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Statistical Trend Analysis of Physically Unclonable Functions

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!