Cryptographic Applications of Forrelation-based Quantum Algorithms
close menu
Bookswagon
search
My Account
Home > Research and information: general > Coding theory and cryptology > Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)
Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)

Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

This book provides a research-level treatment of quantum algorithms for analyzing Boolean functions through the framework of Forrelation. It develops a unified account of how Forrelation, nega-Forrelation, and generalized Forrelation can be used to study major Boolean-function spectra, including Walsh-Hadamard, nega-Hadamard, crosscorrelation, and autocorrelation spectra, along with related questions on bent, negabent, and their hidden-shift structures. The central aim is to connect modern quantum query complexity related techniques with spectral problems that are fundamental in cryptography, coding theory, and the combinatorial theory of Boolean functions.

The book begins with the necessary background on Boolean functions and basics of quantum computing, making the later chapters substantially self-contained. It then develops three main contributions. First, it studies Forrelation as a tool for sampling and estimating Walsh-Hadamard, crosscorrelation, and autocorrelation spectra, including applications to resiliency testing and bounded-degree uncorrelatedness checking. Next, it introduces nega-Forrelation and uses it to design quantum algorithms for estimating nega-Hadamard, nega-crosscorrelation, and nega-autocorrelation spectra, while linking these methods to hidden-shift problems involving bent and negabent functions. Finally, it presents a generalized framework based on roots of unity, extending prior transform-based methods and introducing generalized Deutsch-Jozsa and generalized Forrelation algorithms.

The topic is timely because Forrelation is one of the landmark problems establishing a separation between the probabilistic classical and bounded-error quantum models, and the spectral analysis of Boolean functions remains central to the design and evaluation of cryptographic primitives. By bringing these strands together, the book offers both new algorithmic perspectives and a coherent mathematical framework for spectral analysis in the quantum setting. The primary audience of this book comprises researchers, advanced graduate students, and specialists in cryptography, discrete mathematics, and quantum computation.


Best Sellers


Product Details
  • ISBN-13: 9783032395900
  • Publisher: Springer Nature Switzerland AG
  • Publisher Imprint: Springer Nature Switzerland AG
  • Height: 235 mm
  • No of Pages: 96
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Series Title: SpringerBriefs in Information Security and Cryptography
  • Width: 155 mm
  • ISBN-10: 3032395909
  • Publisher Date: 26 Oct 2026
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Returnable: N
  • Sub Title: Examining Results Related to Boolean Functions


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)
Springer Nature Switzerland AG -
Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)
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.

Cryptographic Applications of Forrelation-based Quantum Algorithms: Examining Results Related to Boolean Functions(SpringerBriefs in Information Security and Cryptography)

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

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!
    Your IP: 216.73.217.23 IN