2018 International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T) 2018

DOI: 10.1109/infocommst.2018.8632017

|View full text |Cite

|

Sign up to set email alerts

|

Heuristic Methods of Hill Climbing of Cryptographic Boolean Functions

Illarion Moskovchenko

¹

,

Mykola Pastukhov

²

,

Alexandr Кuznetsov

³

et al.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

0

Mentioning

0

Contrasting

0

Year Published

2020

2020

2023

2023

Publication Types

Select...

Other3

Book1

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 8 publications

References 22 publications

Supporting

0

Mentioning

0

Contrasting

0

Order By: Relevance

Output Feedback Encryption Mode: Periodic Features of Output Blocks Sequence

¹

,

²

,

³

et al. 2020

Data-Centric Business and Applications

View full text Add to dashboard Cite

No abstract

Output Feedback Encryption Mode: Periodic Features of Output Blocks Sequence

¹

,

²

,

³

et al. 2020

Data-Centric Business and Applications

View full text Add to dashboard Cite

No abstract

A survey of metaheuristic algorithms for the design of cryptographic Boolean functions

¹

,

²

,

³

et al. 2023

Cryptogr. Commun.

View full text Add to dashboard Cite

Boolean functions are mathematical objects used in diverse domains and have been actively researched for several decades already. One domain where Boolean functions play an important role is cryptography. There, the plethora of settings one should consider and cryptographic properties that need to be fulfilled makes the search for new Boolean functions still a very active domain. There are several options to construct appropriate Boolean functions: algebraic constructions, random search, and metaheuristics. In this work, we concentrate on metaheuristic approaches and examine the related works appearing in the last 25 years. To the best of our knowledge, this is the first survey work on this topic. Additionally, we provide a new taxonomy of related works and discuss the results obtained. Finally, we finish this survey with potential future research directions.

Non-Binary Cryptographic Functions for Symmetric Ciphers

¹

,

²

,

³

et al. 2020

2020 IEEE International Conference on Problems of Infocommunications. Science and Technology (PIC S&T)

View full text Add to dashboard Cite

No abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

hi@scite.ai

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2024 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.